Variational Information Bottleneck for Unsupervised Clustering: Deep Gaussian Mixture Embedding
원문 초록
In this paper, we develop an unsupervised generative clustering framework that combines the Variational Information Bottleneck and the Gaussian Mixture Model. Specifically, in our approach, we use the Variational Information Bottleneck method and model the latent space as a mixture of Gaussians. We derive a bound on the cost function of our model that generalizes the Evidence Lower Bound (ELBO) and provide a variational inference type algorithm that allows computing it. In the algorithm, the coders' mappings are parametrized using neural networks, and the bound is approximated by Monte Carlo sampling and optimized with stochastic gradient descent. Numerical results on real datasets are provided to support the efficiency of our method.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
Robust Variational Contrastive Learning for Partially View-unaligned Clustering
Tri-Learn Graph Fusion Network for Attributed Graph Clustering
Interpretable Bayesian Tensor Network Kernel Machines with Automatic Rank and Feature Selection
Car Object Counting and Position Estimation via Extension of the CLIP-EBC Framework
Scalable Bayesian Low-Rank Adaptation of Large Language Models via Stochastic Variational Subspace Inference
HERCULES: Hierarchical Embedding-based Recursive Clustering Using LLMs for Efficient Summarization
토론
이 논문과 연결된 포럼 글이 아직 없습니다.