Arora 2012 - Practical Provable Topic Modeling

Routing Summary

Fully captures Arora et al., A Practical Algorithm for Topic Modeling with Provable Guarantees (arXiv 1212.4777; ICML 2013), 26 pp. incl. appendices. Five notes cover separability, the recovery step, FastAnchorWords with proofs, and experiments.

Concept Map

ConceptNoteTypeDepends OnKey Result
p-separable matrix; anchor wordArora 2012 - Separability and Anchor Wordsdefinitionadmixtureeach topic has a private word
Original recovery theoremArora 2012 - Separability and Anchor Wordstheoremseparabilitypolynomial documents suffice
Convex-hull structureArora 2012 - Recover Algorithms RecoverKL and RecoverL2theoremseparabilityrows of in hull of anchor rows
RecoverKL / RecoverL2Arora 2012 - Recover Algorithms RecoverKL and RecoverL2definitionconvex hullper-word simplex regression + Bayes
gamma-robust simplexArora 2012 - FastAnchorWords Algorithm and Guaranteesdefinitiongeometryvertex far from hull of others
FastAnchorWordsArora 2012 - FastAnchorWords Algorithm and Guaranteestheoremrobustness-cover in
Sample complexityArora 2012 - FastAnchorWords Algorithm and GuaranteestheoremLemma B.1
Metrics and resultsArora 2012 - Experiments and Evaluation Metricsexamplealgorithmscomparable to Gibbs, far faster

Notes

Sources

  • Arora et al 2012 - A Practical Algorithm for Topic Modeling with Provable Guarantees — Arora S, Ge R, Halpern Y, Mimno D, Moitra A, Sontag D, Wu Y, Zhu M (2012/2013).

See Also

Blei 2003 - Latent Dirichlet Allocation - Overview, Concept - Short-Text Topic Models GSDMM and BTM, Factor Analysis and PPCA