Uncertainty-Guided Metric Learning Without Labels

Abstract

Unsupervised metric learning aims to learn the discriminative representations by grouping similar examples in the absence of labels. Many unsupervised metric learning algorithms combine clustering-based pseudo-label generation with embedding fine-tuning. However pseudo-labels can be unreliable and noisy. This could affect metric learning and degrade the quality of the learned representations. In this work we propose an approach to reduce the negative effect of label noise on learning discriminative embeddings by using context and prediction uncertainty. In particular we refine the pseudo-labels by aggregating information from neighbors. We propose a function to weigh the pairs leveraging their prediction confidence and uncertainty. We modify the metric learning loss function to incorporate this weight. Experimental results demonstrate the effectiveness of our proposed method on standard datasets for metric learning.

Cite

Text

Devalraju and Sekhar. "Uncertainty-Guided Metric Learning Without Labels." Winter Conference on Applications of Computer Vision, 2025.

Markdown

[Devalraju and Sekhar. "Uncertainty-Guided Metric Learning Without Labels." Winter Conference on Applications of Computer Vision, 2025.](https://mlanthology.org/wacv/2025/devalraju2025wacv-uncertaintyguided/)

BibTeX

@inproceedings{devalraju2025wacv-uncertaintyguided,
  title     = {{Uncertainty-Guided Metric Learning Without Labels}},
  author    = {Devalraju, Dhanunjaya Varma and Sekhar, C Chandra},
  booktitle = {Winter Conference on Applications of Computer Vision},
  year      = {2025},
  pages     = {7029-7038},
  url       = {https://mlanthology.org/wacv/2025/devalraju2025wacv-uncertaintyguided/}
}