Skip to content
Preprint

Resample or Reroute? Recoverable Stopping Debt Without Identified Action Selection

Jul 2026 · 0 citations · 54 references
Computer Science

TL;DR

After a weak verifier accepts a large-language-model response, a second call may resample or reroute, but current evidence does not identify when to resample rather than reroute, so stopping debt exists, but current evidence does not identify when to resample rather than reroute.

Abstract

After a weak verifier accepts a large-language-model response, a second call may resample or reroute. Because correctness is hidden, action selection is an identification problem. We order three gates: recoverable stopping debt, two-sided FIT action support, and held-out value from an outcome-blind selector. In a pinned 152-query MBPP+ experiment, a Qwen2.5-14B Base-only false-positive stop leaves +2.592 percentage points of Qwen2.5-7B recovery (query-cluster 95% interval [+1.618, +3.664]). Separately, after 7B Base-test rejection, fixed escalation to 14B exceeds leave-one-out 7B resampling by +2.882 points [+0.931, +5.201]; this is fixed-action ranking, not conditional selection. An all-episode audit produces a +2.697-point realized-maximum gap, but for two actions this statistic equals (1/2)E|Delta| - (1/2)|E Delta| and contains no observable-history term. It lies inside an exact-fold exchangeable reference (mean +3.158; 95% interval [+2.434, +3.947]). The audit unconditionally acts on 1,520 episodes: 1,240 observable stops and 280 verifier rejections; 198 stops are evaluator-only false positives. Neither tested outcome-blind controller improves on fixed rerouting. A separate LiveCodeBench ladder has all-zero FIT action advantages despite exclusive TEST rescues. A preregistered BigCodeBench support gate then finds only 23/19 and 22/19 signed episodes/queries against minima of 25/20, so L1-L4, DEV, and TEST stay unopened. Stopping debt exists, but current evidence does not identify when to resample rather than reroute.

View source

Similar papers

Preprint Aug 2026

Counterfactual Sensitivity Is Not Repairability: Auditing Replay Probes for Video Evidence

CARVE is introduced, a black-box counterfactual probe that compares answer changes under matched SHAM and DESTROY replays, and shows only a weak association with annotated temporal coverage, so CARVE is best understood as a routing signal rather than a direct grounding classifier.

Rama Y. AlHamidi, Rasul Khanbayov, E. Serpedin et al. · 0 citations
Preprint Aug 2026

HERALD: Counterfactual Audits and Minimal Repairs for Proof-of-Retrieval Rewards

HERALD is introduced, an offline audit that applies exact same-question interventions, separates candidate-visible from oracle information, and enumerates detector contracts before policy optimization, and separates robust scoring, sparse learning signal, and policy transfer.

Zhuowen Liu, Bohan Cui, YinShang Guo et al. · 0 citations
Preprint Aug 2026

The Replay Gap: Static Evaluation of Model Switching in LLM Agents Scores the Wrong World

This work forks live SWE-bench agent trajectories at controlled points, rebuild the environment, continue each fork with a different model, and compare against same-model control forks that isolate sampling and replay noise, finding configuration-dependent temperature-0"determinism" is configuration-dependent.

Ashritha Gonuguntla · 8 citations · ⚡2
#artificial intelligence Preprint Sep 2026

Can a Cacheable Decision Model Follow Rules?

Certo is a small non-generative decision model (Qwen3-4B): it scores candidate actions from their text and returns a probability, instead of generating an answer, and how much rule-sensitivity survives that move, and whether it can be trained back.

D. Rajput, Nirdesh Chauhan, S.Rao Kosaraju · 0 citations

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