Skip to content
Open access

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

Aug 2026 · Asia Pacific Symposium on Intelligent and Evolutionary Systems · pp. 1-5 · 2 citations · 26 references
Computer Science

TL;DR

It is argued and shown empirically that maintenance cost scales with the amount of change, not corpus size, and that maintaining, rather than repeatedly reconstructing, a semantic substrate is supported.

Abstract

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 $\mathbf{1 0}^{\mathbf{- 1 1}}$ 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% of the corpus. The results support maintaining, rather than repeatedly reconstructing, a semantic substrate.

Read PDF

Similar papers

Preprint Aug 2026

RAG Deserves an Index: Why Ingest-Time Compilation Beats Query-Time Interpretation

The paradigm ingest-time semantic compilation (ISC) is called: compile a corpus's meaning into a queryable substrate with two coupled layers - incrementally maintained embeddings, and atomic claims whose provenance is validated at compile time - and treat that substrate as a first-class database object with its own DDL...

Kyle Wild, Yusuke Takahashi, Asako Uraki · 0 citations
#artificial intelligence Preprint Aug 2026

Ingest-Time Fact Compilation for Cost-Efficient and Reliable Question Answering over Revised Corpora

This work presents ingest-time fact compilation, an architecture that performs this work when corpus data is ingested or changed and supports a narrow but practical claim: resolving a corpus state once can make subsequent QA cheaper and more reliable for inexpensive models.

Kyle Wild, Yusuke Takahashi, Asako Uraki · 0 citations
Preprint Aug 2026

Beyond Top-K: Replacing Black-Box Retrieval with Interpretable Agentic Operations

This work proposes READ (Reliable Embedding-free Agentic Document-search), in which an agent reads the raw document through three deterministic operations -- normalized lexical search, structural navigation, and bounded span reads -- exposed over the Model Context Protocol, so a trajectory is a replayable audit trail,...

Sagar Tamang, Ayush Vyas, Tabarakul Hazarika · 0 citations
#artificial intelligence Preprint Sep 2026

Which Part of the Context Layer Does the Work? Separating Semantic Content from Retrieval Scaffolding in Text-to-SQL Agents

Context layers, curated documentation that an analytics agent fetches at query time, produce large accuracy gains on text-to-SQL benchmarks. A with/without comparison cannot say which part of the layer does the work: the semantic content, the retrieval scaffolding that delivers it, or the pre-computed views that usuall...

Qing Ye · 0 citations
Preprint Aug 2026

MegaMem: A Retrieval Solution for Ultra-Large Context Windows

These results show that MegaMem supports ultra-large persistent memory while preserving strong answer accuracy under a bounded generation context, and provides a practical path toward accurate retrieval over memories ranging from hundreds of millions to one billion tokens.

Xin-Yuan Song, Bo-Wen Zhu, H. Haque et al. · 0 citations
#artificial intelligence Preprint Aug 2026

rEDMRec: Distilling Large Language Model Reasoning into an Editable Experience Memory for Recommendation

Large language models can improve recommendation quality by reasoning explicitly over user history and candidate items - for example, extracting a user's preferences or explaining why one item fits better than another - rather than mapping history directly to a ranked list. This reasoning, however, is expensive to repe...

M. H. Nguyen, Tung Le, Huy-Tien Nguyen · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.