Provable algorithms for inference in topic models
Recently, there has been considerable progress on designing algorithms with provable guarantees - typically using linear algebraic methods - for parameter learning in latent variable models. But designing provable algorithms for inference has proven to be more challenging. Here we take a first step...
| Main Authors: | , , , , |
|---|---|
| Other Authors: | |
| Format: | Article |
| Published: |
PMLR
2018
|
| Online Access: | http://hdl.handle.net/1721.1/115942 https://orcid.org/0000-0001-7047-0495 |