Computer Science – Artificial Intelligence
Scientific paper
2012-03-15
Computer Science
Artificial Intelligence
Appears in Proceedings of the Twenty-Sixth Conference on Uncertainty in Artificial Intelligence (UAI2010)
Scientific paper
Languages for open-universe probabilistic models (OUPMs) can represent situations with an unknown number of objects and iden- tity uncertainty. While such cases arise in a wide range of important real-world appli- cations, existing general purpose inference methods for OUPMs are far less efficient than those available for more restricted lan- guages and model classes. This paper goes some way to remedying this deficit by in- troducing, and proving correct, a generaliza- tion of Gibbs sampling to partial worlds with possibly varying model structure. Our ap- proach draws on and extends previous generic OUPM inference methods, as well as aux- iliary variable samplers for nonparametric mixture models. It has been implemented for BLOG, a well-known OUPM language. Combined with compile-time optimizations, the resulting algorithm yields very substan- tial speedups over existing methods on sev- eral test cases, and substantially improves the practicality of OUPM languages generally.
Arora Nimar S.
Russell Stuart
Salvo Braz Rodrigo de
Sudderth Erik B.
No associations
LandOfFree
Gibbs Sampling in Open-Universe Stochastic Languages does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Gibbs Sampling in Open-Universe Stochastic Languages, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Gibbs Sampling in Open-Universe Stochastic Languages will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-32053