Fast Harness
A control harness for VLA robot policies

Fast Harness

A robot policy that learns to skip its own reviews — GPT-6 calls and tokens fall with every repetition, while task success holds.

The expensive teacher normally checks every action. Fast Harness accumulates verified experience across repetitions, so it reviews less each time.

↔ scroll
Three panels: left, wall-clock per run averaged over the four full tasks falls from 100% to about a third by the warm episodes; center, GPT-6 tokens per episode averaged over the four tasks drop sharply from episode 1 to the Fast Harness warm mean; right, success rate averaged over five tasks, where our harness leads the published methods.
Figure 1. Left: wall-clock per run, averaged over the four full tasks. Center: GPT-6 tokens per run, averaged over the four full tasks. Right: success rate averaged over five tasks. Baseline results are taken from third-party evaluations.
FAST HARNESS
The problem

Reviewing every step is accurate — but expensive and redundant.

In the baseline loop, the teacher drives the robot chunk by chunk: every short action segment is a fresh, costly model generation. Cost scales with the number of steps and never goes down — the thousandth repetition of a solved task costs exactly as much as the first. And most of that spend is redundant: a familiar task repeats the same easy, already-mastered stretches, yet each one is re-reviewed at full price, no differently from a genuinely uncertain moment.

The missing capability is judgement about when the teacher is actually needed. The baseline loop has no way to tell a trivial, well-practised step apart from a risky one, so it plays it safe and reviews everything. What if the harness could instead learn, per task, which steps it can safely release on its own — spending GPT-6 only where it truly matters, and cutting calls, tokens, and wall-clock time while holding task success? That is exactly the loop we build next.

How it works

An experience-driven execution loop.

The harness loop sits between the student policy and the teacher. Each chunk, it takes a fresh student proposal and decides — from accumulated experience — whether this chunk needs a review or can be released on a zero-call fast path. Only unfamiliar, risky, or previously-failed moments pay for a review.

01

Backend · π0.5

Proposes a fresh action chunk from the new observation; executes and acknowledges.

02

Reviewer · GPT-6

Judges the last segment, the current stage, and the next chunk’s intent. It is the only component that can change an action, and does so only when it detects a failure or a mismatch with the intended plan.

03

Memory + Scheduler

Accumulates verified outcomes per stage; sets the review interval from a conservative reliability score.

04

Recovery + Harness

Runs the loop, audits every chunk, and drives bounded recovery when something goes wrong.

↔ scroll to see the full diagram
fast-harness v7 flow diagram: proposal enters the adaptive scheduler, which routes to a zero-call fast path or a GPT-6 review, then to validated execution, with a bounded recovery block and evidence written back to memory tables.
Figure 2. The gray row is the legacy “ask GPT-6 every chunk” baseline. In color: proposals enter the adaptive scheduler, take the green zero-call fast path when no review is triggered, and fall back to GPT-6 review otherwise.

Inside that loop, two cooperating mechanisms do the real work, and they are clearer looked at apart. One learns to review less over time; the other decides what to do when a review catches a failure.

The fast path

Getting faster: learning which reviews to skip

The efficiency gain rests on a single principle: reuse verified experience rather than re-verifying it at every step. The harness decomposes each task into a small set of recurring stages — approach, grasp, lift, place — and maintains, for each stage, an empirical estimate of how reliably the student policy has completed it. Stages with a consistent record of success are permitted longer unsupervised execution; stages without such a record are not.

At every chunk the harness resolves a single question: whether the current step requires teacher review, or can be executed on a zero-call fast path. For a stage with an established record, the interval between reviews is allowed to grow. This interval is governed not by the raw success rate but by a conservative estimate of it — one that discounts for how few times the stage has been attempted — so that a handful of favorable outcomes does not, on its own, widen the interval.

These stages are not labelled in advance. The harness recognizes one by resemblance: it keeps a small set of remembered examples for each stage and matches the current observation to the nearest of them. A step that resembles no remembered stage — or sits ambiguously between two — is treated as unfamiliar and reviewed regardless of any record, so a genuinely new situation cannot inherit another stage's permission to skip.

Three mechanisms make this improvement cumulative rather than transient, so that repetition yields improvement and not merely speed:

Pure accumulation

Confirmed successes are retained without decay. A repeated task’s reliability estimate therefore increases monotonically, and the review interval widens accordingly across episodes.

Persistent error review

In the neighborhood of a previously observed failure, review is enforced until the stage is reliably re-solved. Difficult states remain under supervision rather than being released after a short run of successes.

Span budget

A subtask with an established record is permitted to run for its empirically observed length before the next mandatory review, reducing the calls spent within well-characterized segments.

Skipping is nonetheless the exception rather than the default. A fixed set of conditions forces review regardless of a stage’s record: an unfamiliar or newly entered stage, a contact or alignment moment, proximity to a past failure, a stalled trajectory, or a bound on the number of consecutive unreviewed steps; a small fraction of chunks are also reviewed at random as an audit. A review is skipped only when none of these conditions holds.

The recovery path

Recovering when something goes wrong

Skipping is safe only if the failures that do occur are detected and corrected. When a review reports a failure — an execution error, or an action inconsistent with the intended goal — the harness leaves the fast path and reviews every chunk until the fault is cleared, after which normal skipping resumes. Correction escalates only as far as it needs to, within a bounded step budget; if the budget is exhausted without the task getting back on track, the episode is ended rather than left to run on indefinitely.

Repair in place

The harness first tries to fix the problem where it occurred. It re-attempts the current sub-task from where it is, with every chunk reviewed, for a limited number of steps. Many faults — a slightly missed grasp, a small misalignment — are resolved here, without giving up any progress.

Return to a verified waypoint

If local attempts do not succeed, the harness gives up the current position and returns to a verified waypoint — an earlier point whose state the reviewer had already confirmed to be correct. It falls back to the most recent such waypoint first, or an earlier one if that is still not enough, and carries on from there instead of pressing on from a broken state.

Remember the failure

Every failure is recorded and kept, even once it is cleared, so recovery also improves future runs. The next time the task reaches the same place, the scheduler reviews those steps pre-emptively instead of skipping them — the problem is anticipated in advance, rather than met head-on and repaired again from scratch.

See it happen — the drop-and-recover moment

This clip is trimmed to the few seconds that matter (Bottle disposal, episode 19). Mid-transport the green bottle slips out of the gripper; the very next review flags the drop and hands off to recovery, which re-approaches and re-grasps it before normal skipping resumes. Scrub the timeline — teal is the fast path, gray a GPT-6 review, sand the recovery. The full episode still finished 100/100.
GPT-6 reviewing
0.0s · step 0/553 · chunk 0
π0.5 fast path — review skipped GPT-6 reviewing Recovery path
Recovery escalates in three graded steps — repair in place → return to the latest waypoint → fall back to an earlier one.
The result

It gets faster with experience.

Across repeated episodes of the same task, the trend is consistent: the number of teacher calls falls while the review-skip rate rises, and both level off at a stable value. The first episode is reviewed in full by design, so every curve begins at a skip rate of zero.

↔ scroll to see all four tasks
Small-multiple charts for four tasks, three rows each. Top row: GPT-6 calls per episode falling from 30-40 to under 15. Middle row: review-skip rate rising from 0% to roughly 50-75%. Bottom row: wall-clock minutes per run falling from 40-75 min to a warm plateau.
Figure 3. Top: GPT-6 calls per episode. Middle: review-skip rate (auto chunks ÷ all chunks). Bottom: wall-clock minutes per run. Even the hardest task, build tower, converges to ~13 calls and ~75% skip. A cross marks a failed episode.
The payoff

Fewer reviews, fewer tokens.

A skipped review is a teacher call that is never made, so the token cost recorded per episode decreases with experience — by roughly two-thirds to three-quarters across the four tasks.

↔ scroll to see all four tasks
Bar charts per task comparing cold-start episode-1 tokens against the warm last-five-episode mean; every task drops 64 to 74 percent.
Figure 4. Recorded GPT-6 tokens (input + output) per episode: cold-start episode 1 vs. the mean of the final five episodes.
The guardrail

Success is preserved.

The purpose of skipping is to reduce cost without reducing reliability. Over the same episodes in which reviews fall by roughly two-thirds, task success is maintained, and the harness remains competitive with published methods on every task the benchmark reports.

Grouped bar chart of binary success rate for five tasks — build tower, stack bowls, fold clothes, bottle disposal, classify objects — comparing our harness against published methods (π0.5, π0.5+GPT-6, GPT-6). Our harness is at or near the top on every task.
Figure 5. Binary success rate on each task, our harness vs. published methods (π0.5, π0.5+GPT-6, and GPT-6). Baseline results are taken from third-party evaluations.