HackerPapers

arXiv:2509.23471cs.LG

Drift-Adapter: A Practical Approach to Near Zero-Downtime Embedding Model Upgrades in Vector Databases

Harshil Vejendla

Early discovery. Linked by one identifiable commenter. This paper is outside the main ranking; a mention is not an endorsement.

Abstract

Upgrading embedding models in production vector databases typically requires re-encoding the entire corpus and rebuilding the Approximate Nearest Neighbor (ANN) index, leading to significant operational disruption and computational cost. This paper presents Drift-Adapter, a lightweight, learnable transformation layer designed to bridge embedding spaces between model versions. By mapping new queries into the legacy embedding space, Drift-Adapter enables the continued use of the existing ANN index, effectively deferring full re-computation. We systematically evaluate three adapter parameterizations: Orthogonal Procrustes, Low-Rank Affine, and a compact Residual MLP, trained on a small sample of paired old and new embeddings. Experiments on MTEB text corpora and a CLIP image model upgrade (1M items) show that Drift-Adapter recovers 95-99% of the retrieval recall (Recall@10, MRR) of a full re-embedding, adding less than 10 microseconds of query latency. Compared to operational strategies like full re-indexing or dual-index serving, Drift-Adapter reduces recompute costs by over 100 times and facilitates upgrades with near-zero operational interruption. We analyze robustness to varied model drift, training data size, scalability to billion-item systems, and the impact of design choices like diagonal scaling, demonstrating Drift-Adapter's viability as a pragmatic solution for agile model deployment.

arXiv comments
EMNLP 2025 Main 12 pages, 6 figures
Journal reference
DOI
Subjects
cs.LGMachine Learning cs.IRInformation Retrieval

On Hacker News

Linked by 1 identifiable commenter in 1 comment across 1 thread, from Jun 2026 to Jun 2026.

Comments linking this paper, per year.

Discussed in comments1 thread

    • Changing your embedding model usually doesn't need a reindex, and that surprised me enough to build around it. Two models' vector spaces are close to a rotation of each other, so you can fit one orthogonal matrix (an SVD over a few thousand paired vectors, ~15s on CPU) and apply…

      aayush4vediView on HNParent context

Submitted to Hacker News

Connected through shared HN threads, not inferred similarity or a recommendation.