Meta-learning representations for clustering with infinite Gaussian mixture models
Not on the map. Why?
Abstract (arXiv)
For better clustering performance, appropriate representations are critical. Although many neural network-based metric learning methods have been proposed, they do not directly train neural networks to improve clustering performance. We propose a meta-learning method that train neural networks for obtaining representations such that clustering performance improves when the representations are clustered by the variational Bayesian (VB) inference with an infinite Gaussian mixture model. The proposed method can cluster unseen unlabeled data using knowledge meta-learned with labeled data that are different from the unlabeled data. For the objective function, we propose a continuous approximation of the adjusted Rand index (ARI), by which we can evaluate the clustering performance from soft clustering assignments. Since the approximated ARI and the VB inference procedure are differentiable, we can backpropagate the objective function through the VB inference procedure to train the neural networks. With experiments using text and image data sets, we demonstrate that our proposed method has a higher adjusted Rand index than existing methods do.
Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Builds on 20 of its 53 references that are in the map. First posted on arXiv 1 Mar 2021.
Builds on
20 of 53 references.
References · 20
- 2014Adam: A Method for Stochastic Optimizationcited by 36,960
- 2017Model-Agnostic Meta-Learning for Fast Adaptation of Deep Networkscited by 4,861
- 2017Prototypical Networks for Few-shot Learningcited by 3,001
- 2016Matching Networks for One Shot Learningcited by 2,246
- 2017Deep Setscited by 1,394
- 2018Deep Clustering for Unsupervised Learning of Visual Featurescited by 1,020
- 2017Zero-Shot Learning -- A Comprehensive Evaluation of the Good, the Bad and the Uglycited by 536
- 2014Deep metric learning using Triplet networkcited by 421
- 2017Zero-Shot Learning -- The Good, the Bad and the Uglycited by 254
- 2016Variational Deep Embedding: An Unsupervised and Generative Approach to Clusteringcited by 219
- 2014Learning Fine-grained Image Similarity with Deep Rankingcited by 189
- 2016Composing graphical models with neural networks for structured representations and fast inferencecited by 113
8 more
- 2019Infinite Mixture Prototypes for Few-Shot Learningcited by 99
- 2018Unsupervised Learning via Meta-Learningcited by 81
- 2019Deep Spectral Clustering using Dual Autoencoder Networkcited by 71
- 2020Unraveling Meta-Learning: Understanding Feature Representations for Few-Shot Taskscited by 47
- 2016Stick-Breaking Variational Autoencoderscited by 44
- 2018Meta-Learning Update Rules for Unsupervised Representation Learningcited by 37
- 2014Warped Mixtures for Nonparametric Cluster Shapescited by 3
- 2019Meta-Learning to Clustercited by 2
Built on by
Citing papers per year: 2022: 1.
1 paper.