Deep Amortized Clustering
By Juho Lee, Yoonho Lee, Yee Whye Teh. 2019
24 citations recorded by the source corpus.
We propose a deep amortized clustering (DAC), a neural architecture which learns to cluster datasets efficiently using a few forward passes. DAC implicitly learns what makes a cluster, how to group data points into clusters, and how to count the number of clusters in datasets. DAC is meta-learned using labelled datasets for training, a process distinct from traditional clustering algorithms which usually require hand-specified prior knowledge about cluster shapes/structures. We empirically show, on both synthetic and image data, that DAC can efficiently and accurately cluster new datasets coming from the same distribution used to generate training datasets.
Subfields: Artificial Intelligence, Computer Vision and Pattern Recognition
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Artificial Intelligence
- Fahad Shahbaz Khan
- Antreas Antoniou
- Salman Hameed Khan
- Timothy M. Hospedales
- Amos J. Storkey
- Paul Micaelli
- Mubarak Shah
- Muzammal Naseer
In Computer Vision and Pattern Recognition
- Fahad Shahbaz Khan
- Luc Van Gool
- Ming-Hsuan Yang
- Salman Hameed Khan
- Dacheng Tao
- Bernt Schiele
- Timothy M. Hospedales
- Philip H. S. Torr
Citations in the corpus
- Transformers in Vision: A Survey (2021, background): “More recently, [145] improves [144] by taking a sequential approach to cluster generation, thereby allowing assignment to a variable number of clusters.”
- Meta-Learning in Neural Networks: A Survey (2020, methodology): “The methods in this group that make use of feed-forwardmodels are often known as amortized clustering [178], [179], because they amortize the typically iterative computation of clustering algorithms into the cost of training a single inference model, which subsequently performs”