Uncertainty-Guided Metric Learning Without Labels

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.

Authors

Institutions

Publication Details

Published
2025-02-26
DOI
https://doi.org/10.1109/wacv61041.2025.00683
Citations
1
Primary Topic
Machine Learning and Algorithms
Type
article
Field-Weighted Citation Impact
2.48
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Uncertainty-Guided Metric Learning Without Labels

Dhanunjaya Varma Devalraju, C. Chandra Sekhar
1 citations
Machine Learning and Algorithms
2.48
article

Uncertainty-Guided Metric Learning Without Labels

Dhanunjaya Varma Devalraju, C. Chandra Sekhar
article en
1 citations

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.

Indian Institute of Technology Madras (IN)
Reduced inequalities
Openalex Percentile: Top 11%
Machine Learning and Algorithms
2.48
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.