SearcharxivSearch

arXiv · 2508.09758

sanba: An R Package for Bayesian Clustering of Distributions via Shared Atoms Nested Models

Abstract

Nested data structures arise when observations are grouped into distinct units, such as patients within hospitals or students within schools. Accounting for this hierarchical organization is essential for valid inference, as ignoring it can lead to biased estimates and poor generalization. This article addresses the challenge of clustering both individual observations and their corresponding groups while flexibly estimating group-specific densities. Bayesian nested mixture models offer a principled and robust framework for this task. However, their practical use has often been limited by computational complexity. To overcome this barrier, we present sanba, an R package for Bayesian analysis of grouped data using nested mixture models with a shared set of atoms, a structure recently introduced in the statistical literature. The package provides multiple inference strategies, including state-of-the-art Markov Chain Monte Carlo routines and variational inference algorithms tailored for large-scale datasets. All core functions are implemented in C++ and seamlessly integrated into R, making sanba a fast and user-friendly tool for fitting nested mixture models with modern Bayesian algorithms.

Explore related subjects

Keep this discovery

BibTeXRIS

Francesco Denti, Laura D'Angelo. 2025-08-13. sanba: An R Package for Bayesian Clustering of Distributions via Shared Atoms Nested Models. https://arxiv.org/abs/2508.09758

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Estimating Hierarchically Rank Structured Covariance Matrices

We consider the problem of estimating a high-dimensional covariance matrix from a very limited number of samples. This problem is ubiquitous in computational fluid dynamics, where a small number of fluid snapshots must be used to construct a Gramian matrix determining a reduced-order model, as well as in computational geoscience, where a small ensemble of Earth system forecasts must be used to estimate the covariance matrix associated with the forecast uncertainty. It is common practice to regularize the small-sample covariance by imposing a "localization" structure that enforces a physically realistic correlation length scale, imposing a sparsity constraint, "shrinking" towards a prescribed target, or attenuating small correlations. We propose an alternate technique that regularizes the small-sample covariance by imposing hierarchical rank structure. Compared to regularization methods that assume sparsity such as spatial localization, hierarchical rank structure accommodates a wider range of covariance matrices, roughly corresponding to situations where long-range correlations vary more smoothly than short-range ones. It also results in a data-sparse matrix format that permits highly efficient matrix-vector products. We present theory and algorithms which show how to efficiently estimate a high-dimensional, hierarchically rank structured covariance matrix from limited samples. Through an error analysis and numerical experiments with a variety of model problems, we demonstrate that these techniques are effective at reducing sampling errors, and that in many cases they achieve smaller estimation error than conventional techniques.

stat.CO

Optimal Slice-Adaptive Tuning of Hybrid Slice Sampling

Slice sampling is a Markov chain Monte Carlo algorithm that draws its next state uniformly from a "slice"---a super-level set of the target density function---at each iteration, thereby providing automatic local adaptivity to the scale of the target. In practice the exact slice is not known, so general-purpose implementations use an approximate slice that is grown from a starting interval of length $w>0$, with a computational cost that depends on $w$. This work presents an analysis of the average per-iteration number of target density evaluations, as a function of $w$, of hybrid slice sampling with various slice-finding schemes for targets with contiguous slices. The paper uses the results of the analysis to develop automated, slice-adaptive tuning schemes along with suboptimality bounds and asymptotic convergence guarantees. Simulations demonstrate that the tuning schemes reliably yield near-optimal slice-adaptive tuning with essentially no dependence on the initial setting of $w$.

stat.CO