mlsanityData to 7 Oct 2026

Cost Scales with Change, Not Corpus Size: Incrementally Maintaining an Evolving Semantic Substrate

arXiv 2608.16621 ↗First posted 17 Aug 2026cs.AI cs.DB cs.IRcited by 2

On the map: Retrieval-augmented generation → Generation and context integration

also in 1 more
Abstract (arXiv)

Retrieval-augmented and agentic question-answering systems increasingly re-derive the meaning of a corpus at query time. Put plainly, instead of re-deriving what a corpus means on every question, the work is done once when a document arrives and is thereafter merely consulted -- a compiler, not an interpreter, of meaning. An alternative is to compile that meaning once, at ingest time, into a compact, queryable semantic substrate and maintain it as the corpus evolves. The central objection is maintenance cost: rebuilding a truncated singular value decomposition (SVD) on every change appears prohibitive, and a change of embedding model seems to force a full re-embedding. We argue and show empirically that maintenance cost scales with the amount of change, not corpus size. On a controlled synthetic pilot (dimension 256, rank 32, a corpus grown from 3,000 to 9,000 documents over 50 update events), incremental low-rank updates were 33.7 times cheaper per update than full re-SVD and 23.8 times cheaper cumulatively, while the incremental subspace tracked the full recomputation to within floating-point precision (maximum principal-angle drift below 1e-11 degrees; recall@10 = 1.0). An orthogonal Procrustes virtual axis update recovered 0.95 mean cosine to truly re-embedded vectors by re-embedding only about 10 percent of the corpus. The results support maintaining, rather than repeatedly reconstructing, a semantic substrate.

Key facts. Cited by 2 papers in the map (data through 7 Oct 2026). Placed in Generation and context integration, one of 15 directions in Retrieval-augmented generation. Builds on 17 of its 26 references that are in the map. First posted on arXiv 17 Aug 2026.

Builds on

17 of 26 references.

Closest ancestors · 1

Same direction, newest first

  1. 2020Retrieval-Augmented Generation for Knowledge-Intensive NLP Tasks22 May

Other references · 16

  1. 2020Dense Passage Retrieval for Open-Domain Question Answeringcited by 3,779
  2. 2023Lost in the Middle: How Language Models Use Long Contextscited by 3,383
  3. 2017Billion-scale similarity search with GPUscited by 2,477
  4. 2021SimCSE: Simple Contrastive Learning of Sentence Embeddingscited by 2,168
  5. 2023Self-RAG: Learning to Retrieve, Generate, and Critique through Self-Reflectioncited by 1,800
  6. 2020Leveraging Passage Retrieval with Generative Models for Open Domain Question Answeringcited by 1,203
  7. 2020ColBERT: Efficient and Effective Passage Search via Contextualized Late Interaction over BERTcited by 1,160
  8. 2016Efficient and robust approximate nearest neighbor search using Hierarchical Navigable Small World graphscited by 853
  9. 2019How Contextual are Contextualized Word Representations? Comparing the Geometry of BERT, ELMo, and GPT-2 Embeddingscited by 770
  10. 2022MTEB: Massive Text Embedding Benchmarkcited by 623
  11. 2022Matryoshka Representation Learningcited by 268
  12. 2020On the Sentence Embeddings from Pre-trained Language Modelscited by 83
4 more
  1. 2021A Comprehensive Survey and Experimental Comparison of Graph-Based Approximate Nearest Neighbor Searchcited by 82
  2. 2020Towards Backward-Compatible Representation Learningcited by 74
  3. 2021A Cluster-based Approach for Improving Isotropy in Contextual Embedding Spacecited by 27
  4. 2026Facts as First Class Objects: Knowledge Objects for Persistent LLM Memorycited by 2

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2026: 2.

2 papers.

Similar, not cited

Close in wording, no citation either way

  1. 2026BM25 Wins at Scale: A Scaling Study of Retrieval-Augmented Generation Paradigms
  2. 2026MemDelta: Controlled Baselines and Hidden Confounds in Agent Memory Evaluation
  3. 2026From Delivery to Stateful Exploration: Rethinking the Index for Agentic Search
  4. 2026Contiguity, Not Importance: Budgeted Repair of Stale KV Caches After Document Edits
  5. 2026FRESCO: Benchmarking and Optimizing Re-rankers for Evolving Semantic Conflict in Retrieval-Augmented Generation
  6. 2026Bridging Static and Agentic RAG for Taiwanese Historical Question Answering
  7. 2026On the impact of retrieved content representations in RAG Pipelines
  8. 2026How often do Answers Change? Estimating Recency Requirements in Question Answering