Wasserstein Adversarial Mixture Clustering

Clustering complex data is a key element of unsupervised learning which is still a challenging problem. In this work, we introduce a deep approach for unsupervised clustering based on a latent mixture living in a low-dimensional space. We achieve this clustering task through adversarial optimization of the Wasserstein distance between the real and generated data distributions. The proposed approach also allows both dimensionality reduction and model selection. We achieve competitive results on difficult datasets made of images, sparse and dense data