Papers › Deep Metric Learning via Lifted Structured Feature Embedding

Deep Metric Learning via Lifted Structured Feature Embedding

19 Nov 2015CVPR 2016 6arXiv:1511.06452archive 2025-07-28

Hyun Oh Song, Yu Xiang, Stefanie Jegelka, Silvio Savarese

Learning the distance metric between pairs of examples is of great importance for learning and visual recognition. With the remarkable success from the state of the art convolutional neural networks, recent works have shown promising results on discriminatively training the networks to learn semantic feature embeddings where similar examples are mapped close to each other and dissimilar examples are mapped farther apart. In this paper, we describe an algorithm for taking full advantage of the training batches in the neural network training by lifting the vector of pairwise distances within the batch to the matrix of pairwise distances. This step enables the algorithm to learn the state of the art feature embedding by optimizing a novel structured prediction objective on the lifted problem. Additionally, we collected Online Products dataset: 120k images of 23k classes of online products for metric learning. Our experiments on the CUB-200-2011, CARS196, and Online Products datasets demonstrate significant improvement over existing deep feature embedding methods on all experimented embedding sizes with the GoogLeNet network.

PaperPDFConference PDFCode

In Syntology View this paper on Syntology, its page in Syntology's graph. That page lists the repositories linked to the paper, the abstract and the calls for agents.

Open this paper in Syntology's Atlas, the map of the papers in Syntology's graph and their citations.

For agents, on Syntology's MCP service (how to connect):

Code

rksltnl/Deep-Metric-Learning-CVPR16 officialmentioned in paperMITSyntology: not harvested report
Cadene/recipe1m.bootstrap.pytorch mentioned on GitHubpytorchSyntology: not harvested report
layumi/Person_reID_baseline_pytorch pytorchSyntology: no sample linked to this paper (harvested for another paper). Syntology's graph links these samples to Swin Transformer: Hierarchical Vision Transformer using Shifted Windows (arXiv:2103.14030; that paper's own run record: 123 ran (of which 45 constructed an object rather than computing a result; 79 with no instrument failure: 6 honoured, 3 violated, 70 with no contract checked; 44 where Syntology's instrument failed) · 84 unverified); nothing checks that they implement this paper's method. report

Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.

A paper named beside a repository with no sample linked to this paper is shown with that paper's own run record, not this paper's: “ran” means executed on a synthesized input, not that the code is correct, and “where Syntology's instrument failed” counts failures of Syntology's instrument, not of the code. Papers are listed in arXiv-id order, at most three per repository.

Code Syntology ran Syntology

Not run by Syntology. Nothing on this page verifies that the listed code works.

Tasks

Metric LearningStructured Prediction

Datasets

Introduced by this paper, per the archive.

Stanford Online Products

Results from the paper archive 2025-07-28

No leaderboard rows for this paper in the archive.

Methods

1x1 ConvolutionAuxiliary ClassifierAverage PoolingConvolutionDense ConnectionsDropoutGoogLeNetInception ModuleLocal Response NormalizationMax PoolingReLUSoftmax

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections