Papers › Embedding Expansion: Augmentation in Embedding Space for Deep Metric Learning

Embedding Expansion: Augmentation in Embedding Space for Deep Metric Learning

5 Mar 2020CVPR 2020 6arXiv:2003.02546archive 2025-07-28

Byungsoo Ko, Geonmo Gu

Learning the distance metric between pairs of samples has been studied for image retrieval and clustering. With the remarkable success of pair-based metric learning losses, recent works have proposed the use of generated synthetic points on metric learning losses for augmentation and generalization. However, these methods require additional generative networks along with the main network, which can lead to a larger model size, slower training speed, and harder optimization. Meanwhile, post-processing techniques, such as query expansion and database augmentation, have proposed the combination of feature points to obtain additional semantic information. In this paper, inspired by query expansion and database augmentation, we propose an augmentation method in an embedding space for pair-based metric learning losses, called embedding expansion. The proposed method generates synthetic points containing augmented information by a combination of feature points and performs hard negative pair mining to learn with the most informative feature representations. Because of its simplicity and flexibility, it can be used for existing metric learning losses without affecting model size, training speed, or optimization difficulty. Finally, the combination of embedding expansion and representative metric learning losses outperforms the state-of-the-art losses and previous sample generation methods in both image retrieval and clustering tasks. The implementation is publicly available.

PaperPDFConference PDFCodeCode Syntology ran

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

For agents, Syntology's MCP tool lists every function and class Syntology harvested from this paper and whether it ran (how to connect): get_harvested_code_for_paper(arxiv_id="2003.02546")

Code

Syntology Ran 1 of 9 code samples harvested from 2 repositories linked to this paper; 8 have no recorded run. Of those that ran: 1 ran · fixture could not drive it.

By repository: official repository: 1 sample from 1 repository, 1 ran; community (archive-listed): 8 samples from 1 repository, 0 ran. The run record, sample by sample. “Ran” means executed on a synthesized input, not that the code is correct or reproduces the paper.

clovaai/embedding-expansion officialmentioned in papermentioned on GitHubmxnet report
puneesh00/loop mentioned on GitHubmxnetMIT 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.

Code Syntology ran Syntology

9 samples harvested; 1 ran; 0 honoured the contract we drafted; 8 have no recorded run. Read from Syntology's graph 2026-09-24; that is when this build read the record, not when the samples ran.

1ran · fixture could not drive it
8unverified

Licence: 0 of the 9 samples are pointer only, meaning Syntology does not serve that copy's text. This page shows no code text for any sample; each one links to its file in the repository.

Harvested from 2 repositories linked to this paper, official or community; each sample names its own and says which. “Ran” means the sample executed on a synthesized input. It does not mean the output is correct, and nothing here reproduces the paper's results. “Honoured” and “violated” refer to a contract Syntology drafted from the code itself; “our draft was wrong” and “fixture could not drive it” are failures of Syntology's instrument, not of the code.

Each sample ends with its code_sha256, Syntology's identity for that exact code. An agent fetches the stored sample with Syntology's MCP tool get_code(code_sha256="…") (how to connect); click an identity to copy that call.

Repository labels, per sample. official repository: The archive marks this repository official for the paper. named in the paper: The archive records that the paper mentions this repository; it is not marked official. community (archive-listed): In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper. found in paper text by Syntology: Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted. community: Not in the archive's code links for this paper; a community repository Syntology harvested. Samples from a repository marked official are listed first. Licence labels name the repository's licence as recorded at harvest. “Pointer only” means Syntology does not serve that copy's text, for one of four reasons: no licence file was found; the licence was not identified; the licence is recorded as permissive but that copy's record is not marked cleared; or the licence is outside the permissive list Syntology serves text under (MIT, Apache-2.0, BSD and similar). Some licences outside that list permit redistribution, such as WTFPL, and GPL-3.0 under its conditions; they are simply not on the list. Hover a licence label for the reason. File links open the file on GitHub at the default branch, which may have changed since the harvest.

get_embedding_aug clovaai/embedding-expansion/loss/embedding_aug.py official repository ran · fixture could not drive it MIT (permissive) · 70b3555b698a27db · report
concat puneesh00/loop/loss/embedding_aug_mx.py community (archive-listed) unverified MIT (permissive) · a645a2dfd75685c5 · report
euclidean_dist puneesh00/loop/loss/embedding_aug_mx.py community (archive-listed) unverified MIT (permissive) · 63190af7829635b2 · report
euclidean_dist_alt puneesh00/loop/loss/embedding_aug_mx.py community (archive-listed) unverified MIT (permissive) · 98fc6cdbe46dc59f · report
get_lam_lin puneesh00/loop/loss/optimum_pts_lin.py community (archive-listed) unverified MIT (permissive) · 238d0e58bf5e2c2a · report
get_roots puneesh00/loop/loss/optimum_pts.py community (archive-listed) unverified MIT (permissive) · ad23c83f976df643 · report
getn puneesh00/loop/loss/optimum_pts.py community (archive-listed) unverified MIT (permissive) · 4efe9ed220f93e69 · report
normalize puneesh00/loop/loss/optimum_pts.py community (archive-listed) unverified MIT (permissive) · 5f68094ff552c59d · report
point_lin puneesh00/loop/loss/optimum_pts_lin.py community (archive-listed) unverified MIT (permissive) · 7be77be876544ef9 · report

Tasks

ClusteringImage RetrievalMetric LearningRetrieval

Results from the paper archive 2025-07-28

No leaderboard rows for this paper in the archive.

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