/ Paper arXiv 2610.39497
Curator's notes
Co-design System-1 predictor with System-2 to screen low‑utility actions, reducing execution compute.
Curator's notesWritten by AI from the paperEvery number here appears in the abstractReport a mistake
What's new
Introduces a predict‑gate‑execute‑update loop and formal bounds linking utility density to compute savings, unlike prior work focusing only on scaling System-2.
Key result
Execution compute falls by a factor approaching 1/ρ_u under ideal screening, where ρ_u is the density of utility‑relevant interactions.
Why it matters
Developers can cut inference costs by letting a cheap model filter tasks before invoking a large model.
Abstract
From the paperThe authors' own words.
Progress toward artificial general intelligence (AGI) has largely relied on scaling a resource-intensive executive, System-2, through larger models, more data and compute, longer reasoning, and more agents. We ask whether the next stage may come instead from co-designing it with System-1, a lightweight, semantically aware predictor that evaluates candidate interactions before execution, so that System-2 acts only on those worth their cost. Our answer is a qualified yes. We study conditional interaction, a predict--gate--execute--update loop: System-1 estimates each candidate's utility, System-2 executes those admitted by an adaptive threshold, and the outcomes update System-1. The loop spans training, test-time reasoning, adaptive decision-making, and agentic tool use, with utility and cost defined by the application. Under ideal screening and equal execution costs, execution compute falls by a factor approaching 1/ρ_u, where ρ_u is the density of utility-relevant interactions (cost-weighted when costs differ); prediction errors, exploration, and distribution shift reduce the saving. We bound selection regret by predictor error and the utility margin. These results motivate our central hypothesis: ρ_u is a measurable coordinate of scaling efficiency and makes informative compute a better description of scaling than total compute.
From the full paper
From the paperCopied from the paper itself by our code.
Reading the paper on arXiv…
What you could build
Written by AIIntermediateRequires integrating two models and handling adaptive thresholds
- Implement a lightweight utility predictor to pre‑filter queries for a large language model
- Create an adaptive threshold system that routes high‑value tasks to expensive agents
- Build a tool‑use agent that updates its predictor based on execution outcomes
Ask this paper
/ Ask a questionAnswers come from the full paper and name the section
/ Quiz yourself
What factor reduces execution compute according to the paper’s ideal scenario?
Execution compute is reduced by a factor approaching the inverse of the utility density ρ_u.
/ Your notes
Select text in the abstract to highlight it or add a note. They stay in this browser.
