dirichlet-process component adaptation

To address the challenge of nonparametrically modeling mixed component distributions in heterogeneous data, this paper proposes a finite mixture model with nonparametric components, where each component density is itself modeled via a Dirichlet process mixture (DPM) prior. First, we establish identifiability conditions for the mixing components under this framework. Second, we theoretically prove that the posterior contraction rate for component densities is polynomial—significantly faster than the logarithmic rate typical of conventional deconvolution for mixing measures. Third, to enable efficient Bayesian inference, we design a tailored MCMC algorithm. Extensive simulations and real-data analyses demonstrate the method’s high accuracy and robustness in identifying latent subgroups, estimating population-level and component-specific densities. The approach thus offers both rigorous theoretical guarantees and practical utility for complex heterogeneous data analysis.

This work addresses the computational inefficiency often encountered in enriched Dirichlet process mixture models within Bayesian nonparametric inference, particularly when employing complex MCMC algorithms or handling large-scale data. The authors propose an improved truncation approximation strategy integrated with variational Bayes, which substantially simplifies model implementation and accelerates inference. The resulting variational solution serves as a high-quality initialization for Gibbs sampling and is further enhanced by combining blocked Gibbs updates with Pólya urn sampling schemes, enabling efficient implementation within the Nimble platform. Experimental results demonstrate that the proposed approach achieves substantial gains in computational efficiency and practical usability while preserving inferential accuracy.

This work addresses the high implementation complexity and accessibility barriers of inference algorithms in Bayesian nonparametric modeling by proposing a flexible Dirichlet process (DP) framework implemented in R. The framework encapsulates the DP as a reusable object that supports density estimation, clustering, and hierarchical model prior construction, while automatically performing Markov chain Monte Carlo (MCMC) posterior inference. Users can either directly apply pre-specified models or customize base distributions and mixture structures without manually implementing sampling algorithms. By abstracting away computational intricacies while preserving substantial modeling flexibility, this approach significantly lowers the practical barrier to applying Bayesian nonparametric methods across a wide range of statistical analysis tasks.

Gibbs sampling for Bayesian mixture models suffers from slow mixing in the marginal posterior over component assignments and struggles to jointly perform model selection and parameter inference. Method: We propose two novel joint-sampling MCMC algorithms: (1) a collapsed Gibbs sampler incorporating unconventional move sets, and (2) a prior-driven, rejection-free component allocation sampler. Both methods jointly update observation assignments and the number of components, unifying model fitting and dimensionality inference. Contribution/Results: Our approaches eliminate the need for post-hoc model selection and substantially improve Markov chain mixing efficiency. In latent class analysis tasks, they reduce mixing time by several-fold compared to state-of-the-art methods while achieving comparable or superior posterior inference accuracy. The framework provides an efficient, fully automated computational solution for high-dimensional Bayesian nonparametric modeling.

This paper addresses the longstanding limitation in posterior summarization for nonparametric Bayesian mixture models—where inference has predominantly focused on random partition point estimates, neglecting direct inference on the mixing measure itself. We propose a decision-theoretic framework that prioritizes the mixing measure as the primary inferential target. Methodologically, we introduce, for the first time, a model-agnostic variant of the sliced Wasserstein distance, integrated with generalized geodesic projection and optimization on the symmetric positive-definite matrix manifold; leveraging the linear structure of Gaussian mixing measures, our approach delivers coherent point estimates of the mixing measure, density function, and random partition simultaneously. Compared to conventional paradigms, our method preserves statistical validity under complex dependency structures, substantially improves geometric coherence and computational efficiency in posterior summarization, and unifies support for both density estimation and clustering inference.

This study addresses the trade-off between computational efficiency and full posterior inference in Bayesian clustering of multivariate binary data by proposing a Bayesian mixture model that integrates a penalized complexity prior with an asymmetric Dirichlet prior. The approach accommodates a large number of latent components while enabling intuitive control over the distribution of the number of clusters through its asymmetric prior structure. Computational feasibility is ensured via an efficient Markov chain Monte Carlo (MCMC) algorithm. Empirical evaluations on both simulated and real-world ecological presence–absence species data demonstrate that the proposed model performs comparably or superiorly to existing methods, successfully achieving a balance among computational efficiency, Bayesian inferential completeness, and interpretability in cluster analysis.

This study addresses the challenge of inferring underlying population distributions from aggregated data available only in the form of histograms or frequency tables. The authors propose a nonparametric Bayesian inference method based on mixture models, employing reversible-jump Markov chain Monte Carlo to fit Gaussian mixtures with either a finite or countably infinite number of components. This work represents the first systematic application of a nonparametric Bayesian framework to histogram data analysis. Furthermore, by leveraging Dirichlet processes, the approach jointly models multiple histograms, enabling information sharing across groups and providing posterior probabilities to quantify homogeneity among them. Empirical evaluations demonstrate that the method effectively reconstructs complex distributions from large-scale aggregated data and offers principled clustering and homogeneity assessment.

This study investigates the posterior asymptotic behavior of Dirichlet process mixture models when the true data-generating distribution is a finite mixture with $K$ components. By integrating the stick-breaking representation, Wasserstein distance, and posterior contraction theory, the work demonstrates that the model adaptively recovers the true number of components $K$ at the parametric $n^{-1/2}$ rate. Moreover, it reveals a phase transition phenomenon: when estimation accuracy exceeds the $n^{-1/2}$ threshold, the required number of mixture components grows on the order of $\log n$. The analysis further establishes that only $O(\log n)$ components are sufficient to replicate the full posterior’s clustering structure, and any truncated model with at least $K$ components simultaneously achieves optimal posterior contraction rates for both density estimation and the mixing measure.

The Hierarchical Dirichlet Process (HDP) provides a flexible Bayesian nonparametric framework for modeling grouped data with a shared yet unbounded collection of mixture components. While existing applications of the HDP predominantly focus on the Dirichlet-multinomial conjugate structure, the framework itself is considerably more general and, in principle, accommodates a broad class of conjugate prior-likelihood pairs. In particular, exponential family distributions offer a unified and analytically tractable modeling paradigm that encompasses many commonly used distributions. In this paper, we investigate analytic results for two important members of the exponential family within the HDP framework: the Poisson distribution and the normal distribution. We derive explicit closed-form expressions for the corresponding Gamma-Poisson and Normal-Gamma-Normal conjugate pairs under the hierarchical Dirichlet process construction. Detailed derivations and proofs are provided to clarify the underlying mathematical structure and to demonstrate how conjugacy can be systematically exploited in hierarchical nonparametric models. Our work extends the applicability of the HDP beyond the Dirichlet-multinomial setting and furnishes practical analytic results for researchers employing hierarchical Bayesian nonparametrics.

This study addresses the joint inference of a consensus ranking, individual preferences, and clustering structure from preference data without requiring a pre-specified number of clusters. To this end, it introduces Bayesian nonparametrics into the Mallows model for the first time, constructing an extended framework based on Dirichlet process mixtures that accommodates both incomplete rankings and pairwise comparison data. The proposed approach enables simultaneous posterior inference of the number of clusters and cluster assignments via Markov chain Monte Carlo (MCMC) sampling. Experimental results demonstrate that the method accurately recovers the true number of clusters in simulated data, outperforming finite mixture models, and significantly enhances personalized recommendation performance on real-world movie rating data, particularly excelling in predicting missing ratings.