Metric Compatible Training for Online Backfilling in Large-Scale Retrieval

Backfilling is the process of re-extracting all gallery embeddings from upgraded models in image retrieval systems. It inevitably spends a prohibitively large amount of computational cost and even entails the downtime of the service. Although backward-compatible learning sidesteps this challenge by tackling query-side representations, this leads to suboptimal solutions in principle because gallery embeddings cannot benefit from model upgrades. We address this dilemma by introducing an online backfilling algorithm, which enables us to achieve a progressive performance improvement during the backfilling process without sacrificing the full performance of the new model after the completion of backfilling. To this end, we first show that a simple distance rank merge is a reasonable option for online backfilling. Then, we incorporate a reverse transformation module for more effective and efficient merging, which is further enhanced by adopting metric-compatible contrastive learning. These two components help to make the distances of old and new models compatible, resulting in desirable merge results during backfilling with no extra computational over-head. Extensive experiments show the benefit of our frame-work on four standard benchmarks in various settings.

Authors

Institutions

Publication Details

Published
2025-02-26
DOI
https://doi.org/10.1109/wacv61041.2025.00157
Citations
1
Primary Topic
Optimization and Search Problems
Type
article
Field-Weighted Citation Impact
1.49
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Metric Compatible Training for Online Backfilling in Large-Scale Retrieval

Mustafa Gökhan Uzunbaş, Bohyung Han, Seonguk Seo, Sheng Cao et al.
1 citations
Optimization and Search Problems
1.49
article

Metric Compatible Training for Online Backfilling in Large-Scale Retrieval

Mustafa Gökhan Uzunbaş, Bohyung Han, Seonguk Seo, Sheng Cao, Ser-Nam Lim
article en
1 citations

Abstract

Backfilling is the process of re-extracting all gallery embeddings from upgraded models in image retrieval systems. It inevitably spends a prohibitively large amount of computational cost and even entails the downtime of the service. Although backward-compatible learning sidesteps this challenge by tackling query-side representations, this leads to suboptimal solutions in principle because gallery embeddings cannot benefit from model upgrades. We address this dilemma by introducing an online backfilling algorithm, which enables us to achieve a progressive performance improvement during the backfilling process without sacrificing the full performance of the new model after the completion of backfilling. To this end, we first show that a simple distance rank merge is a reasonable option for online backfilling. Then, we incorporate a reverse transformation module for more effective and efficient merging, which is further enhanced by adopting metric-compatible contrastive learning. These two components help to make the distances of old and new models compatible, resulting in desirable merge results during backfilling with no extra computational over-head. Extensive experiments show the benefit of our frame-work on four standard benchmarks in various settings.

University of Central Florida (US)
Openalex Percentile: Top 19%
Optimization and Search Problems
1.49
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Metric Compatible Training for Online Backfilling in Large-Scale Retrieval — Mustafa Gökhan Uzunbaş, Bohyung Han, et al. · (2025) | TGRS Research Map | TGRS