Skip to content

Spawn Freely, Act Sparingly: Progressive Risk Vesting for Recursive LLM-Agent Trees

Sep 2026 · 1 citation · 26 references
Computer Science Mathematics

TL;DR

The analysis suggests a design rule: search broadly in the sandbox and grant recursive authority sparingly, with an explicit risk charge, with an explicit risk charge.

Abstract

Recursive LLM agents can broaden their search by spawning specialists. Some branches later request tools that send data or deploy code. When should a branch receive authority to act? We distinguish sandbox spawning, in which external controls prevent the specified harm, from capability activation, in which a selected branch crosses an irreversible-action boundary. Progressive Risk Vesting (PRV) holds a trajectory-level risk budget in escrow and debits it as branches are activated. We prove an anytime harm bound for adaptively generated trees. Branch outcomes may be dependent, but each local certificate needs to remain valid conditional on the full pre-activation history, including the information used to select the request. When activation gates, branch charges, and compute constraints are held fixed, delayed vesting preserves every policy available under irrevocable spawn charging. Marginal risk estimates can still fail after branch selection. In a stylized branching model, trajectory harm changes as the authority reproduction number $\mathcal{R}_A$ crosses one. As local risk $p$ approaches zero, trajectory harm is proportional to $p$ below criticality, proportional to $\sqrt{p}$ at criticality, and retains a positive floor above it. A finite-type occupancy model yields risk and compute shadow prices. For nested fanout modes with decreasing marginal value per unit risk, these prices produce a threshold rule. Branching calculations and a split-sample experiment illustrate the results. These synthetic studies do not estimate safety in deployed agents. The analysis suggests a design rule: search broadly in the sandbox and grant recursive authority sparingly, with an explicit risk charge.

View source

Similar papers

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
#machine learning Preprint Sep 2026

FORGE: Form-Optimal Routing of Grounded Evidence for Frozen LLM Agents

ForGE is proposed, a unified framework for adapting frozen models through per-query routing over a joint action space that spans both support form and thinking depth and improves accuracy at 42-45% lower token cost on both main hosts.

Xi Xiao, Yun-Bei Zhang, Chen Liu et al. · 0 citations
#artificial intelligence Preprint Aug 2026

COVER: Identifiable Evaluation of Coalition Routing

COLD is an auditable measurement methodology, an evaluation contract that fixes a public information boundary, downstream stack G, and finite legal team family before outcomes are generated, which exposes selection headroom without manufacturing a routing win.

R. Sugumar, Amrit Gopinath · 0 citations
#artificial intelligence Preprint Sep 2026

How Do Agent Harnesses Create Value? Planning Information and Release Control in Stateful LLM Agents

Which component matters more depends on the loss assigned to erroneous acceptance: at low liability the planning gain dominates; at high liability the verifier's avoided false passes dominate; and a standalone verifier captures nearly all the false-pass benefit of the full planning-plus-verification stack at a fraction...

Yu-Kun Zhang, Ke-Mu Xu, Yi-Shen Chen · 2 citations
#artificial intelligence Preprint Sep 2026

Recoverability as a System Primitive for Long-Horizon AI Agents

This work introduces recoverability as a system primitive that makes reuse an explicit decision: select a supported starting point and a permitted recovery action, or withhold automatic continuation, and establishes why recovery decisions need their own evaluation.

Zhi-Hui Zhang, Wei Liu · 0 citations
#artificial intelligence Preprint Sep 2026

REFLEX with Jev for Efficient Selective Control in LLM Agents

REFLEX, an agent architecture that uses Jev as a fast, typed decision layer and calls a strong LLM when confidence is low, or generation is required, is studied, identifying when selective control with Jev can reduce computation and where its benefits are limited.

Tian-Tong Wu, Wei Yang Bryan Lim · 9 citations · ⚡3

Related blog posts

MIT News · Artificial Intelligence Sep 29, 2026

Who we become when we talk to machines

Professor Sherry Turkle’s new book, “Artificial Intimacy,” offers a withering critique of chatbots and the antisocial dynamics she believes they encourage.

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