Sampling pairs directly with auxiliary information for higher inclusion probabilities on informative pairs yields near-full pairwise loss performance at reduced computational cost.
Sampling Matters in Deep Embedding Learning
1 Pith paper cite this work. Polarity classification is still indexing.
abstract
Deep embeddings answer one simple question: How similar are two images? Learning these embeddings is the bedrock of verification, zero-shot learning, and visual search. The most prominent approaches optimize a deep convolutional network with a suitable loss function, such as contrastive loss or triplet loss. While a rich line of work focuses solely on the loss functions, we show in this paper that selecting training examples plays an equally important role. We propose distance weighted sampling, which selects more informative and stable examples than traditional approaches. In addition, we show that a simple margin based loss is sufficient to outperform all other loss functions. We evaluate our approach on the Stanford Online Products, CAR196, and the CUB200-2011 datasets for image retrieval and clustering, and on the LFW dataset for face verification. Our method achieves state-of-the-art performance on all of them.
fields
stat.ML 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Doing well with less! On Sampling Techniques for Empirical Pairwise Loss Estimation/Minimization
Sampling pairs directly with auxiliary information for higher inclusion probabilities on informative pairs yields near-full pairwise loss performance at reduced computational cost.