Per-task routing between text, image, and hybrid observations of a browser page does not currently beat one fixed choice, because the labels needed to learn routing exist only where the agent already succeeds; only a cost-saving ceiling survives the noise check.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.CL 1years
2026 1verdicts
ACCEPT 1representative citing papers
citing papers explorer
-
Routing Is Least Learnable Where It Is Most Valuable: Bounds on Representation Routing for Web Agents
Per-task routing between text, image, and hybrid observations of a browser page does not currently beat one fixed choice, because the labels needed to learn routing exist only where the agent already succeeds; only a cost-saving ceiling survives the noise check.