Durable Reasoning Under Drift: Cost-Sensitive Reuse of Persistent Reasoning Artifacts over Continual Knowledge Streams

Large language models repeatedly recompute responses even when previously derived computation may remain reusable. This inefficiency becomes more consequential in continual knowledge environments, where persistent computation can become stale as the underlying information changes. We study persistent reasoning as a selective-refresh control problem: given a previously computed artifact and newly arriving information, when should the system reuse the artifact and when should it pay the additional inference cost required to refresh it? We introduce a drift-aware cost-sensitive persistence controller that scores observable signals of change and selects REUSE or REFRESH. We evaluate a frozen controller on an untouched 636-transition test set derived from the OAKS continual knowledge-stream benchmark. At a validation-locked threshold of 0.50, the controller achieved 55.75% recall and an F1 score of 0.4145 for changed transitions, while selecting reuse on 69.97% of test transitions. Relative to always recomputing, the evaluated policy reduced model-query tokens by 69.97% and query latency by approximately 70%. Bootstrap analysis and offline ablations quantify uncertainty and sensitivity.

Authors

Publication Details

Journal
Zenodo (CERN European Organization for Nuclear Research)
Published
2026-09-25
DOI
https://doi.org/10.5281/zenodo.22966836
Primary Topic
Advanced Graph Neural Networks
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
preprint

Durable Reasoning Under Drift: Cost-Sensitive Reuse of Persistent Reasoning Artifacts over Continual Knowledge Streams

Nirushanth Murugadas
Zenodo (CERN European Organization for Nuclear Research)
Advanced Graph Neural Networks
preprint

Durable Reasoning Under Drift: Cost-Sensitive Reuse of Persistent Reasoning Artifacts over Continual Knowledge Streams

Nirushanth Murugadas
preprint en

Abstract

Large language models repeatedly recompute responses even when previously derived computation may remain reusable. This inefficiency becomes more consequential in continual knowledge environments, where persistent computation can become stale as the underlying information changes. We study persistent reasoning as a selective-refresh control problem: given a previously computed artifact and newly arriving information, when should the system reuse the artifact and when should it pay the additional inference cost required to refresh it? We introduce a drift-aware cost-sensitive persistence controller that scores observable signals of change and selects REUSE or REFRESH. We evaluate a frozen controller on an untouched 636-transition test set derived from the OAKS continual knowledge-stream benchmark. At a validation-locked threshold of 0.50, the controller achieved 55.75% recall and an F1 score of 0.4145 for changed transitions, while selecting reuse on 69.97% of test transitions. Relative to always recomputing, the evaluated policy reduced model-query tokens by 69.97% and query latency by approximately 70%. Bootstrap analysis and offline ablations quantify uncertainty and sensitivity.

Zenodo (CERN European Organization for Nuclear Research)
Advanced Graph Neural Networks
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.