aiqbench analysis
This paper introduces a model-free Bayesian clustering framework that eliminates the need for explicit likelihood-prior specifications and expensive MCMC sampling, offering a more efficient approach to handling noise-aware clusterings. By employing a Wasserstein-type summarization method, it effectively compresses high-dimensional posterior draws into weighted representatives while maintaining theoretical guarantees for density level uncertainty. The work represents a significant methodological advance in probabilistic machine learning, particularly for complex data structures where traditional variational approximations fall short.
Model-free Bayesian Clustering and Multimodal Posterior Summarisation
arXiv:2610.13397v1 Announce Type: cross Abstract: We develop a model-free, noise-aware Bayesian clustering framework that constructs a martingale posterior over clusterings from a predictive Bayesian perspective. This avoids explicit likelihood-prior model specification, expensive MCMC sampling, and mode-seeking variational approximations, while accommodating irregular cluster shapes and enabling parallel generation of posterior draws. To interpret the posterior over high-dimensional, noise-aware clusterings, we introduce a Wasserstein-type summarization method. Using a novel noise-aware loss, this approach compresses the large collection of posterior draws into a small set of weighted representatives, capturing distinct cluster structures and noise assignments. Further, we marginalise the uncertainty in the density level, avoiding reliance on a specific choice. We establish theoretical properties of the proposed loss and guarantees for the level-marginal posterior approximation. Results demonstrate the framework's effectiveness in capturing clustering and noise uncertainty.
Abstract:We develop a model-free, noise-aware Bayesian clustering framework that constructs a martingale posterior over clusterings from a predictive Bayesian perspective. This avoids explicit likelihood-prior model specification, expensive MCMC sampling, and mode-seeking variational approximations, while accommodating irregular cluster shapes and enabling parallel generation of posterior draws. To interpret the posterior over high-dimensional, noise-aware clusterings, we introduce a Wasserstein-type summarization method. Using a novel noise-aware loss, this approach compresses the large collection of posterior draws into a small set of weighted representatives, capturing distinct cluster structures and noise assignments. Further, we marginalise the uncertainty in the density level, avoiding reliance on a specific choice. We establish theoretical properties of the proposed loss and guarantees for the level-marginal posterior approximation. Results demonstrate the framework's effectiveness in capturing clustering and noise uncertainty.
Machine Learning (stat.ML); Machine Learning (cs.LG)
arXiv:2610.13397 [stat.ML]
(or arXiv:2610.13397v1 [stat.ML] for this version)
https://doi.org/10.48550/arXiv.2610.13397 Focus to learn more arXiv-issued DOI via DataCite (pending registration)
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.
Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.
Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.
Full text under the publisher's open licence · 225 words
Related coverage
Diffusion Models for High-Dimensional Clustered Data: Intrinsic-Dimension Adaptivity via Bayesian Classification
arXiv · Aug 20, 2026
Folded Transport MCMC: Certifiable Quotient Posterior Computation for Symmetric Bayesian Models
arXiv · Jun 5, 2026

Fast Radio Bursts Map Hidden Matter, Constraining Galaxy Formation
Quantum Zeitgeist · Sep 8, 2026
Cost-Aware Speculative Execution for LLM-Agent Workflows: An Integrated Five-Dimension Method
arXiv · Jun 9, 2026