INSTANCE CROSS ENTROPY FOR DEEP METRIC LEARNING
Authors: Xinshao Wang, Elyor Kodirov, Yang Hua, Neil M. Robertson
Keywords: Deep Metric Learning, Instance Cross Entropy, Sample Mining/Weighting, Image Retrieval
TL;DR: We propose instance cross entropy (ICE) which measures the difference between an estimated instance-level matching distribution and its ground-truth one. 
Abstract: Loss functions play a crucial role in deep metric learning thus a variety of them have been proposed. Some supervise the learning process by pairwise or tripletwise similarity constraints while others take the advantage of structured similarity information among multiple data points. In this work, we approach deep metric learning from a novel perspective. We propose instance cross entropy (ICE) which measures the difference between an estimated instance-level matching distribution and its ground-truth one. ICE has three main appealing properties. Firstly, similar to categorical cross entropy (CCE), ICE has clear probabilistic interpretation and exploits structured semantic similarity information for learning supervision. Secondly, ICE is scalable to infinite training data as it learns on mini-batches iteratively and is independent of the training set size. Thirdly, motivated by our relative weight analysis, seamless sample reweighting is incorporated. It rescales samples’ gradients to control the differentiation degree over training examples instead of truncating them by sample mining. In addition to its simplicity and intuitiveness, extensive experiments on three real-world benchmarks demonstrate the superiority of ICE.