mlsanityData to 14 Oct 2026

Transferable Deep Metric Learning for Clustering

arXiv 2302.06523 ↗First posted 13 Feb 2023cs.LG cs.AI cs.CVcited by 0

Not on the map. Why?

Abstract (arXiv)

Clustering in high dimension spaces is a difficult task; the usual distance metrics may no longer be appropriate under the curse of dimensionality. Indeed, the choice of the metric is crucial, and it is highly dependent on the dataset characteristics. However a single metric could be used to correctly perform clustering on multiple datasets of different domains. We propose to do so, providing a framework for learning a transferable metric. We show that we can learn a metric on a labelled dataset, then apply it to cluster a different dataset, using an embedding space that characterises a desired clustering in the generic sense. We learn and test such metrics on several datasets of variable complexity (synthetic, MNIST, SVHN, omniglot) and achieve results competitive with the state-of-the-art while using only a small number of labelled training datasets and shallow networks.

Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 8 of its 19 references that are in the map. First posted on arXiv 13 Feb 2023.

Builds on

8 of 19 references.

References · 8

  1. 2017Fashion-MNIST: a Novel Image Dataset for Benchmarking Machine Learning Algorithmscited by 4,349
  2. 2015Domain-Adversarial Training of Neural Networkscited by 3,044
  3. 2016Variational Graph Auto-Encoderscited by 1,382
  4. 2015Unsupervised Deep Embedding for Clustering Analysiscited by 767
  5. 2019Learning to Discover Novel Visual Categories via Deep Transfer Clusteringcited by 225
  6. 2017Asymmetric Tri-training for Unsupervised Domain Adaptationcited by 152
  7. 2017Learning to cluster in order to transfer across domains and taskscited by 128
  8. 2021AutoNovel: Automatically Discovering and Learning Novel Visual Categoriescited by 116

Built on by

Not cited yet.