Pith. sign in

REVIEW 1 cited by

Calibrated neighborhood aware confidence measure for deep metric learning

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2006.04935 v1 pith:VGKDQBCQ submitted 2020-06-08 cs.LG stat.ML

classification cs.LGstat.ML
keywords metriclearningconfidencedeepcalibrateddatadistributioninterpretable
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Deep metric learning has gained promising improvement in recent years following the success of deep learning. It has been successfully applied to problems in few-shot learning, image retrieval, and open-set classifications. However, measuring the confidence of a deep metric learning model and identifying unreliable predictions is still an open challenge. This paper focuses on defining a calibrated and interpretable confidence metric that closely reflects its classification accuracy. While performing similarity comparison directly in the latent space using the learned distance metric, our approach approximates the distribution of data points for each class using a Gaussian kernel smoothing function. The post-processing calibration algorithm with proposed confidence metric on the held-out validation dataset improves generalization and robustness of state-of-the-art deep metric learning models while provides an interpretable estimation of the confidence. Extensive tests on four popular benchmark datasets (Caltech-UCSD Birds, Stanford Online Product, Stanford Car-196, and In-shop Clothes Retrieval) show consistent improvements even at the presence of distribution shifts in test data related to additional noise or adversarial examples.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Unsupervised Incremental Learning Using Confidence-Based Pseudo-Labels

    cs.CV 2025-08 conditional novelty 4.0 of 10

    ICPL generates pseudo-labels by clustering embeddings with KMeans, keeps only confident ones, and uses them to train class-incremental models without human labels, losing about 10 points versus supervised CIL but beat...

Pith tools