The Planner That Cost 16.37 Points Read Perfectly to a Human
One arm of this ablation is the only result that survives statistical scrutiny, and it argues for a deterministic check on plan text before any planning layer touches production traffic.
What the four numbers license, and what they don't
The ablation is four point estimates with no confidence intervals, no seeds, and no run counts. WebArena-Lite's standard split runs on the order of 165 tasks scored as binary success. Near a success rate of 0.5, single-arm standard error is about ±4 percentage points, so the unpaired gap between 43.63% for the grounded planner and 53.94% for planner plus dynamic replanning sits around two sigma. Suggestive, not decisive. Both arms run the same task set. A paired McNemar test, the right test when the same items are scored twice, would almost certainly be tighter and might clear p<0.05. It is not in the reporting as summarized. The estimate that survives scrutiny comfortably is the negative one: the naively finetuned planner at 20.60%, 16.37 points below running no planner at all.
Why a wrong plan passes human review
The naive planner was finetuned without ever seeing the target sites. Its steps read fine. A reviewer would approve them. They corresponded to nothing in the page's DOM, and the executor followed them faithfully anyway. That is the hardest bug class in an agent system: a plausible-looking artifact with no grounding, emitted by a component whose output is prose and whose consumer is another model.
A plan that reads well and grounds in nothing is worse than no plan at all — the artifact passes review and the executor obeys it.
The paper's plan-step contract is specific enough to encode as a deterministic check, which is why a linter is the cheapest item here:
- One unit of work per step. "Search for the product in the search box" qualifies. A single click is too small.
- No cognitive verbs. "Analyze the search results" is not a step. It pushes reasoning back onto the executor and dissolves the point of planning.
- Fully value-instantiated. "Input New York as the arrival city," never "input the arrival city." The vague version makes the executor guess which value belongs in the box.
The replanning gain is the expensive one
Dynamic replanning contributes the largest single increment, +10.31 points from 43.63% to 53.94%, by letting the planner see current state, prior plans, and actions already taken. The reported example rewrites "library at CMU" into "libraries near CMU." It also costs one planner call per executor step. The authors flag that cost as unresolved and propose executor-triggered replanning instead.
That is a measurable design. Fire a replan only on concrete failure signals, such as an empty result set, element-not-found, or no state change, and instrument replan-trigger precision: the fraction of replans that actually change the plan. If most fired replans are no-ops, most of the gain survives at a fraction of the token spend. That is an inference-cost win, not only a line item.
The rule both of today's threads land on
Today's forensic-modeling material argues the same operating rule from the other end of the stack: a new layer earns entry only by beating a mandatory baseline that then stays permanently in the harness. Here the baseline is the planner-free loop. There it is a naive rule the complex model must clear. Neither case defends against a crash. Both defend against output that looks right.
So instrument before rearchitecting. Log tokens per step, the share of context occupied by failed or stale observations, and step-level action success. If token growth outpaces step success past some N, the append-only diagnosis has reproduced on live traffic and the horizon limit is located. Short-horizon agents may never reach it, which makes refactoring on faith premature.
What to do
Log per-step context composition on production agent traces this sprint: total tokens, share of tokens from failed or stale observations, and step-level action success.
Ship a deterministic plan-step linter before any planner reaches traffic, rejecting steps with unbound variables, cognitive verbs, or sub-unit-of-work granularity.
Gate the planner variant behind a flag that requires beating the planner-free loop on 150 or more held-out tasks with a paired McNemar test at p<0.05.