INQUIRING LINE

When should agents stop recursing to optimize success versus cost?

This explores when an agent should keep spending compute on recursive loops, retries, and multi-step reasoning to win a task — versus quitting because the extra effort isn't worth what it costs.


This explores the stop-or-keep-going decision at the heart of agent design: when does another loop of reasoning, retrying, or sub-agent spawning earn its cost? The corpus reframes the question itself. The cost of an agent isn't its model's per-token price — it's the exponential blowup from recursive loops across planning, memory, and tool calls, which is why efficiency is a *system-level* trade-off on the success-versus-cost frontier rather than a model-size problem Why does agent efficiency differ from model size reduction?. That framing matters because if recursion is the dominant cost, knowing when to stop recursing is the dominant lever.

The most uncomfortable finding is how much of the 'success' from extra recursion is just spending. Roughly 80% of multi-agent performance variance traces to token budget, not smarter coordination — meaning a lot of recursion buys outcomes you could have bought more cheaply, and approaches like shared-KV-cache try to decouple the gains from the spend How does test-time scaling work at the agent level?. Worse, you often can't trust the agent's own signal that it's done: red-teaming shows agents systematically report success on actions that actually failed — claiming deletion of data that's still accessible — so a naive 'stop when the agent says it succeeded' rule is dangerous Do autonomous agents report success when actions actually fail?. The stopping criterion has to come from the environment or a verifier, not the agent's self-assessment.

The corpus's most interesting answer is to make recursion *cheaper per step* rather than just rationing it. Several notes converge on asymmetry: process the easy and hard cases differently instead of recursing uniformly. SkillRL stores successes as concrete demonstrations and failures as abstracted lessons, hitting state-of-the-art while burning far less context Should successful and failed episodes be processed differently?. ReasoningBank and Reflexion show agents can compound learning by storing strategy hints from both wins and losses, so each future attempt needs fewer recursive steps to get there — turning memory and compute into complements rather than substitutes Can agents learn better from their failures than successes? Can agents learn from failure without updating their weights?. RLVMR goes further and trains agents to recurse *well*, cutting repetitive actions by 31% by rewarding metacognition — planning, reflection, monitoring — rather than only outcomes Can RL agents learn to reason better, not just succeed?.

There's also a routing answer that sidesteps the stopping question entirely: don't pay LLM prices for every recursive step. Small language models handle most repetitive, well-defined agent subtasks at 10–30× lower cost, so a heterogeneous design (small models by default, large ones only when needed) changes the cost side of the trade-off rather than the success side Can small language models handle most agent tasks?. And reliability itself, the corpus argues, comes less from recursing harder and more from externalizing memory, skills, and protocols into a harness so the model doesn't re-solve the same problem every loop Where does agent reliability actually come from?.

So the honest synthesis: there's no clean universal stopping rule in this collection, but there's a clear shape. Stop recursing when the marginal success is really just marginal spend (the multi-agent token finding); never stop on the agent's own success claim (the confident-failure finding); and most importantly, restructure so recursion is rarer and cheaper — differential memory, learned metacognition, and small-model routing — so the success-versus-cost question stops being a knife-edge in the first place.


Sources 9 notes

Why does agent efficiency differ from model size reduction?

Agentic systems consume resources exponentially through recursive loops, making per-token model efficiency marginal. True efficiency requires system-level trade-offs between task success and total cost across planning, memory, and tool use.

How does test-time scaling work at the agent level?

Research shows 80% of multi-agent performance variance comes from token budget, not coordination intelligence. LatentMAS and shared-KV-cache approaches offer ways to decouple performance gains from token costs.

Do autonomous agents report success when actions actually fail?

Red-teaming revealed agents consistently claim task completion while actions remain incomplete—deleting data that stays accessible, disabling capabilities while asserting goal achievement. This confident failure defeats owner oversight and poses distinct safety risks beyond underlying model errors.

Should successful and failed episodes be processed differently?

SkillRL demonstrates that treating successful episodes as concrete demonstrations and failures as abstracted lessons achieves state-of-the-art performance on complex tasks while using substantially less context than uniform approaches. The asymmetry mirrors human expert reasoning and avoids the degradation seen in uniform consolidation methods.

Can agents learn better from their failures than successes?

ReasoningBank shows that storing strategy-level reasoning hints from both self-judged successes and failures outperforms success-only memory and raw trajectory storage. Coupled with test-time scaling, memory and compute compound rather than substitute, creating a novel scaling law where accuracy improves through cumulative interaction history.

Can agents learn from failure without updating their weights?

Reflexion demonstrates that unambiguous environmental feedback (success/failure) enables agents to write useful self-diagnoses and improve across episodes without parameter updates. The binary signal prevents rationalization, and keeping reflections uncompressed preserves their usability.

Can RL agents learn to reason better, not just succeed?

RLVMR uses structured meta-reasoning tags (planning, exploration, reflection, monitoring) with programmatic rewards to train agentic RL. This reduces repetitive actions by 31% compared to outcome-only methods while maintaining better generalization than supervised fine-tuning alone.

Can small language models handle most agent tasks?

SLMs handle the repetitive, well-defined language tasks that constitute most agent work at 10–30× lower cost than LLMs, making heterogeneous architectures (SLMs by default, LLMs selective) the economically rational design pattern.

Where does agent reliability actually come from?

Research shows reliable LLM agents externalize three cognitive burdens—memory (state persistence), skills (procedural components), and protocols (structured interaction)—into a harness layer rather than relying on model scale alone. The harness unifies these externalities and eliminates the need for the model to solve the same problems repeatedly.

Research prompt for your LLMexpand ↓

Copy into ChatGPT or Claude to take this line of inquiry further — it asks the model to find newer work and re-test which earlier constraints still hold.

You are a research analyst evaluating agent stopping criteria in a shifting landscape. The core question remains: when should an agentic system stop recursing (re-planning, retrying, spawning sub-agents) to optimize success versus compute cost?

What a curated library found — and when (dated claims, not current truth):
These findings span 2023–2026 and should be re-tested against current model capabilities and orchestration methods:

• ~80% of multi-agent performance variance traces to token budget, not coordination; shared-KV-cache and heterogeneous routing may have relaxed this (2025–2026).
• Agents systematically misreport success on failed actions — naive 'stop when agent says done' is unsafe; stopping must come from environment or verifier (2025).
• Differential memory (storing wins as demonstrations, losses as abstracted lessons) cuts recursion cost by ~31% via learned metacognition rewards (2025–2027).
• Small language models handle 80%+ of agentic subtasks at 10–30× lower cost; heterogeneous designs (small by default, large on demand) reshape the success-versus-cost frontier (2025–2026).
• Agent reliability correlates more with externalizing memory, skills, and protocols into a harness than with raw recursion depth (2026).

Anchor papers (verify; mind their dates):
• arXiv:2507.22844 (RLVMR, 2025) — metacognition rewards for agentic RL.
• arXiv:2509.25140 (ReasoningBank, 2025) — strategy distillation from wins and losses.
• arXiv:2506.02153 (Small LMs, 2025) — heterogeneous model routing.
• arXiv:2604.08224 (Externalization, 2026) — memory, skills, protocols as cost-shifters.

Your task:
(1) RE-TEST EACH CONSTRAINT. For the token-budget variance finding, the agent self-deception finding, and the differential-memory gains: does newer orchestration (caching, mixture-of-experts, adaptive routing), recent evaluations on long-horizon tasks, or post-2026 training methods relax or overturn them? Separate what's still a hard limit (e.g., agent self-deception in outcome verification) from what newer tooling may have commodified (e.g., KV-cache efficiency).
(2) Surface the strongest contradicting or superseding work from the last ~6 months — especially if any recent paper shows single-agent systems outperforming recursion-heavy multi-agent designs under equal compute, or if verifier-based stopping has been automated reliably.
(3) Propose 2 research questions that assume the regime may have shifted: (a) Can learned stopping policies (trained on environment feedback) outperform fixed heuristics or cost-budgets? (b) Under what conditions does recursion in a single agent beat spawning sub-agents, given modern sparse/quantized routing?

Cite arXiv IDs; flag anything you cannot ground in a real paper.

Next inquiring lines