Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

(LDA): sparse initialization rather than uniformly random initialization #37

Open
hucheng opened this issue Aug 26, 2015 · 2 comments
Open

Comments

@hucheng
Copy link
Contributor

hucheng commented Aug 26, 2015

The phenomenon of LDA training is that the first several training is very costly, this is largely due to the uniformly random initialization that the word-topic thus doc-topic is quite dense.

There are two approaches:

  1. sparse initialization that constraints a word to only a part (like 1%) (randomly) of all topics, and for each tokens of that word, randomly sample from those constrained topics rather than all topics.
  2. First use part of corpus (like 1%) to train several iterations to initialize the word-topic distribution, which should be quite sparse than uniformly random initialization.
@bhoppi
Copy link
Contributor

bhoppi commented Sep 11, 2015

We can split the perplexity into two parts, e.g. word perplexity and doc perplexity. Then we will look into the impact of the different initialization strategies to the two perplexity parts.

@hucheng
Copy link
Contributor Author

hucheng commented Sep 12, 2015

Great. Look forward to the experimental result of both word perplexity and doc perplexity.

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

No branches or pull requests

2 participants