Hidden Markov P\'olya trees for high-dimensional distributions
Naoki Awaya, Li Ma

TL;DR
This paper introduces a scalable Bayesian nonparametric model using Hidden Markov Pólya trees for high-dimensional distribution estimation, improving flexibility and performance in complex inference tasks.
Contribution
It develops a novel hybrid algorithm combining SMC and message passing for scalable posterior sampling in high-dimensional PT models with latent states.
Findings
Enhanced density estimation accuracy.
Improved two-group comparison performance.
Successful application to 19-dimensional cytometry data.
Abstract
The P\'olya tree (PT) process is a general-purpose Bayesian nonparametric model that has found wide application in a range of inference problems. It has a simple analytic form and the posterior computation boils down to beta-binomial conjugate updates along a partition tree over the sample space. Recent development in PT models shows that performance of these models can be substantially improved by (i) allowing the partition tree to adapt to the structure of the underlying distributions and (ii) incorporating latent state variables that characterize local features of the underlying distributions. However, important limitations of the PT remain, including (i) the sensitivity in the posterior inference with respect to the choice of the partition tree, and (ii) the lack of scalability with respect to dimensionality of the sample space. We consider a modeling strategy for PT models that…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsBayesian Methods and Mixture Models · Statistical Methods and Inference · Statistical Methods and Bayesian Inference
