cs.IRNov 16, 2026

When the Bill Falls: Reusing the Old Index Defers,Never Avoids, Re-encoding in Complete Embedding-Model Migration

Authors: Nannan Zhao, Jiameng Zhang, Taoyu Zhong, Hao Wang, Bo Wang

Organizations: Northwestern Polytechnical University Xi’an, China

Abstract

Upgrading the embedding model behind a vector index requires re-encoding the corpus. Recent work reuses the old index through adapters or window re-ranking. Across sixteen model pairs on passage and code corpora, plus eleven on Natural Questions (NQ), we find three results. First, reuse never avoids re-encoding: if migration must complete, every strategy eventually encodes every document; reuse only changes when that work is paid and the quality served meanwhile. Second, adapters should be compared with the old model, not only the new one. Of five adapter variants, only same-family LLM bridges beat the old model, and only by a negligible margin. Third, window re-ranking cost can be priced from the old index alone; pre-registered replays on all 8,841,823 passages confirmed the prediction on all three tested pairs. Workload skew also matters: across 36 further pre-registered Zipf replays, the planned family matched on 32. These findings yield three pre-migration rules: whether reuse is worthwhile, which strategy to use, and how deep a window to take. The depth rule priced every window that reached target quality to within 4 parts in 10^5 of the corpus. On NQ, a pre-committed plan selected the family on 10 of 11 pairs and priced every window exactly. Quality inputs transferred less reliably across corpus scale, so the model gap and window quality loss must be measured on the serving index.

Figures & tables

Explore similar work

CardsList
  1. Do not copy and paste! Rewriting strategies for code retrieval

    May 8, 2026Andrea Gurioli, Federico Pennino, Maurizio GabbrielliQuery ReformulationInformation Retrieval

  2. Simple Linear Corrections for Compression in Late Interaction

    Oct 9, 2026Mihir Agarwal, Sabyasachi Basu, Viraj AgrawalLate Interaction RetrievalMulti-Vector Retrieval