Skip to main content

Stick-Breaking Beta Processes and the Poisson Process

Author(s): Paisley, John; Blei, David M; Jordan, Michael I

Download
To refer to this page use: http://arks.princeton.edu/ark:/88435/pr1k529
Full metadata record
DC FieldValueLanguage
dc.contributor.authorPaisley, John-
dc.contributor.authorBlei, David M-
dc.contributor.authorJordan, Michael I-
dc.date.accessioned2021-10-08T19:44:15Z-
dc.date.available2021-10-08T19:44:15Z-
dc.date.issued2012en_US
dc.identifier.citationPaisley, John, David Blei, and Michael Jordan. "Stick-Breaking Beta Processes and the Poisson Process." In Proceedings of the Fifteenth International Conference on Artificial Intelligence and Statistics 22, pp. 850-858. 2012.en_US
dc.identifier.issn2640-3498-
dc.identifier.urihttp://proceedings.mlr.press/v22/paisley12.html-
dc.identifier.urihttp://arks.princeton.edu/ark:/88435/pr1k529-
dc.description.abstractWe show that the stick-breaking construction of the beta process due to \citePaisley:2010 can be obtained from the characterization of the beta process as a Poisson process. Specifically, we show that the mean measure of the underlying Poisson process is equal to that of the beta process. We use this underlying representation to derive error bounds on truncated beta processes that are tighter than those in the literature. We also develop a new MCMC inference algorithm for beta processes, based in part on our new Poisson process construction.en_US
dc.format.extent850 - 858en_US
dc.language.isoen_USen_US
dc.relation.ispartofProceedings of the Fifteenth International Conference on Artificial Intelligence and Statisticsen_US
dc.rightsAuthor's manuscripten_US
dc.titleStick-Breaking Beta Processes and the Poisson Processen_US
dc.typeConference Articleen_US
pu.type.symplectichttp://www.symplectic.co.uk/publications/atom-terms/1.0/conference-proceedingen_US

Files in This Item:
File Description SizeFormat 
StickBreakingBetaPoissonProcess.pdf589.07 kBAdobe PDFView/Download


Items in OAR@Princeton are protected by copyright, with all rights reserved, unless otherwise indicated.