Variational inference for stick-breaking beta process priors
Publication
, Journal Article
Paisley, J; Carin, L; Blei, D
Published in: Proceedings of the 28th International Conference on Machine Learning, ICML 2011
October 7, 2011
We present a variational Bayesian inference algorithm for the stick-breaking construction of the beta process. We derive an alternate representation of the beta process that is amenable to variational inference, and present a bound relating the truncated beta process to its infinite counterpart. We assess performance on two matrix factorization problems, using a non-negative factorization model and a linear-Gaussian model. Copyright 2011 by the author(s)/owner(s).
Duke Scholars
Published In
Proceedings of the 28th International Conference on Machine Learning, ICML 2011
Publication Date
October 7, 2011
Start / End Page
889 / 896
Citation
APA
Chicago
ICMJE
MLA
NLM
Paisley, J., Carin, L., & Blei, D. (2011). Variational inference for stick-breaking beta process priors. Proceedings of the 28th International Conference on Machine Learning, ICML 2011, 889–896.
Paisley, J., L. Carin, and D. Blei. “Variational inference for stick-breaking beta process priors.” Proceedings of the 28th International Conference on Machine Learning, ICML 2011, October 7, 2011, 889–96.
Paisley J, Carin L, Blei D. Variational inference for stick-breaking beta process priors. Proceedings of the 28th International Conference on Machine Learning, ICML 2011. 2011 Oct 7;889–96.
Paisley, J., et al. “Variational inference for stick-breaking beta process priors.” Proceedings of the 28th International Conference on Machine Learning, ICML 2011, Oct. 2011, pp. 889–96.
Paisley J, Carin L, Blei D. Variational inference for stick-breaking beta process priors. Proceedings of the 28th International Conference on Machine Learning, ICML 2011. 2011 Oct 7;889–896.
Published In
Proceedings of the 28th International Conference on Machine Learning, ICML 2011
Publication Date
October 7, 2011
Start / End Page
889 / 896