A Data-Informed Variational Clustering Framework for Noisy High-Dimensional Data
Not on the map. Why?
Abstract (arXiv)
Clustering in high-dimensional settings with severe feature noise remains challenging, especially when only a small subset of dimensions is informative and the final number of clusters is not specified in advance. In such regimes, partition recovery, feature relevance learning, and structural adaptation are tightly coupled, and standard likelihood-based methods can become unstable or overly sensitive to noisy dimensions. We propose DIVI, a data-informed variational clustering framework that combines global feature gating with split-based adaptive structure growth. DIVI uses informative prior initialization to stabilize optimization, learns feature relevance in a differentiable manner, and expands model complexity only when local diagnostics indicate underfit. Beyond clustering performance, we also examine runtime scalability and parameter sensitivity in order to clarify the computational and practical behavior of the framework. Empirically, we find that DIVI performs competitively under severe feature noise, remains computationally feasible, and yields interpretable feature-gating behavior, while also exhibiting conservative growth and identifiable failure regimes in challenging settings. Overall, DIVI is best viewed as a practical variational clustering framework for noisy high-dimensional data rather than as a fully Bayesian generative solution.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 7 of its 18 references that are in the map. First posted on arXiv 8 Apr 2026.
Builds on
7 of 18 references.
References · 7
- 2014Adam: A Method for Stochastic Optimizationcited by 37,240
- 2019Sentence-BERT: Sentence Embeddings using Siamese BERT-Networkscited by 9,170
- 2016Categorical Reparameterization with Gumbel-Softmaxcited by 2,739
- 2016The Concrete Distribution: A Continuous Relaxation of Discrete Random Variablescited by 1,148
- 2023End-to-end Differentiable Clustering with Associative Memoriescited by 15
- 2013Inconsistency of Pitman-Yor process mixtures for the number of componentscited by 7
- 2014Efficient Sparse Clustering of High-Dimensional Non-spherical Gaussian Mixturescited by 6
Built on by
Not cited yet.