Variational Information Bottleneck for Unsupervised Clustering: Deep Gaussian Mixture Embedding
Abstract
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.
Cite
@article{arxiv.1905.11741,
title = {Variational Information Bottleneck for Unsupervised Clustering: Deep Gaussian Mixture Embedding},
author = {Yigit Ugur and George Arvanitakis and Abdellatif Zaidi},
journal= {arXiv preprint arXiv:1905.11741},
year = {2020}
}
Comments
accepted for publication in Entropy, Special Issue on Information Theory for Data Communications and Processing