[论文解读] Sampling Matters in Deep Embedding Learning

Chao-Yuan Wu, R. Manmatha+2 more|arXiv (Cornell University)|Jun 23, 2017

Face recognition and analysis参考文献 38被引用 85

一句话总结

论文认为训练样本选择在深度嵌入学习中的重要性不亚于损失函数选择，提出距离加权采样和基于边距的损失，两者共同在若干基准上达到最先进结果。

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.

研究动机与目标

• Motivate the importance of sample selection in deep embedding learning alongside loss design.
• Analyze existing sampling strategies and their impact on embedding quality.
• Propose distance weighted sampling to reduce gradient variance and stabilize training.
• Introduce a margin-based loss that adapts to data geometry and improves robustness.
• Demonstrate state-of-the-art performance across standard embedding benchmarks.

提出的方法

• Define distance D_ij as the Euclidean distance between embeddings f(x_i) and f(x_j).
• Propose distance weighted sampling with probabilities proportional to inverse distance (clipped for stability) to select negatives.
• Introduce a simple margin-based loss ell^margin(i,j) = (alpha + y_ij (D_ij - beta))_+ with class- and image-specific beta terms and a nu-regularizer for beta parameters.
• Show that the margin-based loss relaxes constraints and focuses on relative order of distances, akin to isotonic regression on distances.
• Compare sampling strategies (random, hard/ semi-hard mining) and losses (contrastive, triplet, margin) empirically on standard datasets.
• Provide analysis linking gradient variance to sample distance and how distance weighted sampling mitigates high-variance gradients.]
• research_questions: ["How does sampling strategy affect the effectiveness of different embedding losses (contrastive, triplet, margin) in deep embedding learning?","Can a distance-weighted sampling approach improve training stability and final embedding quality across datasets?","Does a margin-based loss with adaptive boundaries offer robustness and performance gains over traditional pairwise/triplet losses?","To what extent do sampling choices influence convergence speed and retrieval/ clustering/ verification performance?"]
• key_findings':['Distance weighted sampling yields more informative and stable negatives than traditional sampling, reducing gradient variance and improving embedding quality.','A simple margin-based loss with adaptive boundary beta outperforms conventional losses across multiple datasets and sampling schemes.','Distance weighted sampling combined with the margin-based loss achieves state-of-the-art results on Stanford Online Products, CARS196, and CUB200-2011 for retrieval and clustering, and improves LFW verification performance.','The margin-based loss, with class- and image-specific beta terms and isotonic-regression-like behavior, focuses on maintaining correct relative ordering rather than enforcing fixed margins.','The proposed approach converges faster and more stably than triplet semi-hard mining or contrastive random sampling across evaluated settings.'],
• table_headers: []
• table_rows: []

实验结果

研究问题

• RQ1 How does sampling strategy affect the effectiveness of different embedding losses (contrastive, triplet, margin) in deep embedding learning?
• RQ2 Can a distance-weighted sampling approach improve training stability and final embedding quality across datasets?
• RQ3 Does a margin-based loss with adaptive boundaries offer robustness and performance gains over traditional pairwise/triplet losses?
• RQ4 To what extent do sampling choices influence convergence speed and retrieval/ clustering/ verification performance?

主要发现

• Distance weighted sampling yields more informative and stable negatives than traditional sampling, reducing gradient variance and improving embedding quality.
• A simple margin-based loss with adaptive boundary beta outperforms conventional losses across multiple datasets and sampling schemes.
• Distance weighted sampling combined with the margin-based loss achieves state-of-the-art results on Stanford Online Products, CARS196, and CUB200-2011 for retrieval and clustering, and improves LFW verification performance.
• The margin-based loss, with class- and image-specific beta terms and isotonic-regression-like behavior, focuses on maintaining correct relative ordering rather than enforcing fixed margins.
• The proposed approach converges faster and more stably than triplet semi-hard mining or contrastive random sampling across evaluated settings.