Skip to content

UnitBoost: Managing Compound LLM Systems with a Merge Operator, Not a Model

Sep 2026 · 0 citations · 33 references
Computer Science

Abstract

Compound LLM systems often solve a coordination problem by adding a higher-level LLM. The resulting meta-agent reads workers'outputs, writes the final answer, allocates later calls, and decides when to stop. It is expressive, but it also concentrates three control decisions in an opaque, order-sensitive model call. We ask whether the manager needs to be generative at all. UnitBoost replaces that model with a defined meta-level operator: a task-given unit map turns worker outputs into slot-value proposals, a constrained argmax assembles the output, and the slots left unfilled or unsupported become an explicit residual for the next round. The operator is order-free, records unit provenance, and gives a simple guarantee: without coupling constraints, unit-wise maximization under the same admission score dominates selection of any complete candidate. On three held-out benchmarks, it exceeds the best single candidate chosen with gold labels by 0.060-0.195 absolute task-score points and input-matched generative managers by 0.048-0.076. Replacing only the management step improves six compound-system configurations by 0.013-0.182. Residual-directed rounds raise FanOutQA cell F1 from 0.4778 to 0.5524; matched controls show that the true residual outperforms random targets and ordinary rereading, while a label-free supply signal flags exhaustion after one unproductive round. The same analysis measures three conditions in which no such gain is available (one indivisible unit, unavailable unit identity, and an endpoint that charges for every emitted unit) and quantifies cross-unit coupling as a repair cost. The manager gives up semantic freedom and gains order invariance, unit provenance, and testable failure conditions.

View source

Similar papers

#artificial intelligence Preprint Sep 2026

SiLR: Structure-Preserving Admission and Process Reward for LLM Tool Agents

A runtime gate for an LLM tool agent is usually cast as a filter. In a ReAct loop a rejected proposal is followed by another at the same state, so the gate is a search operator over the proposal stream whose admission criterion shapes which trajectories are reachable. We study post-violation recovery admission, where p...

Chen-Yu Zhou, Qi-Liang Jiang, Shu-Ning Wu et al. · 1 citation
Preprint Aug 2026

Right-Sizing LLM-Agent Decomposition in VAT Determination: A Pilot Controlled Sweep

A bounded, preregistered pilot heuristic for right-sizing decomposition for bounded cross-border VAT determination with reverse charge, where every case has an oracle label and each intermediate decision is independently scoreable.

P. Santos · 0 citations
#artificial intelligence Preprint Sep 2026

Staying on Task: Testing the Foundations of Long-Horizon Agent Reliability

Long-horizon agentic workflows require models to sustain repeated state-dependent actions all while the context grows, sub-task complexity changes, and new data arrives. Each situation represents an independent axis along which an agent may fail. An agent reconciling a long ledger, for example, must repeatedly read its...

Jeffrey Willette, Krishna C. Puvvada, Boris Ginsburg · 0 citations

Related blog posts

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