Metraipolis › archive › dc_100fe7d239b4
A Generalized Bayesian Approach to Clustering with Dimension Reduction — arXiv:2611.09698
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2611.09698
- License (as archived)
- CC0-1.0
- Archived
- 2026-11-09T22:42:14.961Z
- SHA-256 of the archived text
7202f748488e508fe2423863d1f4ae8fc3a8b54b443b5cb1e7e2a4ed7272d9fe- Stable URL of this page
https://metraipolis.com/documento/dc_100fe7d239b4
How to cite
A Generalized Bayesian Approach to Clustering with Dimension Reduction — arXiv:2611.09698 — arXiv (en), https://arxiv.org/abs/2611.09698 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_100fe7d239b4 (Metraipolis archive dc_100fe7d239b4, sha256 7202f748488e508fe2423863d1f4ae8fc3a8b54b443b5cb1e7e2a4ed7272d9fe)
BibTeX
@misc{dc100fe7d239b4,
title = {A Generalized Bayesian Approach to Clustering with Dimension Reduction — arXiv:2611.09698},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2611.09698},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_100fe7d239b4; sha256 7202f748488e508fe2423863d1f4ae8fc3a8b54b443b5cb1e7e2a4ed7272d9fe},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2611.09698. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
Generalized Bayes product partition models provide a probabilistic counterpart to loss-based clustering. They update a prior over partitions through an exponentiated clustering loss rather than a likelihood, so allocation uncertainty can be quantified without a full generative model for the data. However, their performance depends on the space in which the loss is evaluated. For high-dimensional observations, a squared Euclidean loss on the raw features can be dominated by irrelevant coordinates or fail to reflect cluster structure lying near a nonlinear low-dimensional manifold. We propose an extension in which an autoencoder and the partition are learned together, so that the space in which the clustering loss is evaluated is shaped by the clustering itself. Our generalized posterior combines a reconstruction loss, which keeps the low-dimensional representation faithful to the observed data, with a within-cluster sum of squares in the latent representation, which encourages cluster separation. Posterior computation alternates between Gibbs sampling over partitions and gradient-based updates of the autoencoder network, with the learning rate estimated jointly. We illustrate the approach through simulation studies and applications to four benchmark datasets. Tema degli esploratori: statistica e scienza dei dati (elenco arXiv stat.ML, nuovi lavori del giorno). Categorie arXiv: Computation (stat.CO) ; Methodology (stat.ME); Machine Learning (stat.ML). Pagina del lavoro: https://arxiv.org/abs/2611.09698 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito). Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina. Letto il 2026-11-09T22:34:32.288Z dalla pagina https://arxiv.org/list/stat.ML/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).