SnapFlow

Paper: SnapFlow: plug-and-play self-distillation for one-step flow-matching VLAs (arXiv:2604.05656). Deep-read 2026-08-05 for the pre-registration; this is the rare radar paper we then fully replicated on our own stack, so this page can report both what they claimed and what held up here (results). Fed: #12 — the distillation leg; closed the charter cost-caveat on the #1 draws win.

The problem it solves

Flow-matching action experts decode by integrating an ODE — our teacher used 30 Heun steps, i.e. ~60 expert forward passes per action chunk. That solver cost is the deployment tax of the flow family, and it multiplies into everything downstream (mean-of-N ensembling at N draws costs N × solver steps). The one-step (“1-NFE” — one network function evaluation) literature asks: can the model learn to jump straight from noise to the answer?

What SnapFlow contributes

A self-distillation recipe — no external teacher, no architecture change:

• Training mixes standard flow-matching samples with consistency samples whose targets are two-step Euler shortcut velocities computed from the model’s own (stop-gradient) marginal predictions — the model teaches itself the long jump from its own short steps. Mixture and weight frozen in their recipe (we used their α=0.5, λ=0.1).
• A zero-initialized target-time embedding φ_s switches the network between velocity-estimation mode and one-step mode — at init the extended model is exactly the pretrained one (a property we turned into a bit-exactness gate).
• Cost claim: ~12 h on one GPU, plug-and-play on existing checkpoints.

Their experiments: π0.5-3B distilled to 1-NFE matches its 10-step teacher (98.75% vs 97.75% LIBERO) while cutting latency 274 → 83 ms; also verified on SmolVLA-500M (−8.3% MSE, 3.56× end-to-end speedup) — at the time, the closest external analogue to our trunk-plus-flow-expert protocol. Their gains grow at fewer solver steps, which is what made it the first pick from the one-step menu (over OFP’s from-scratch self-distillation and MeanFlow-style objective replacement).

What we ran — the replication

Pre-registered 2026-08-06, executed the same day: 30k distillation steps of our flow-80k expert (trunk frozen), σ_draw-derived adopt band fixed by amendment before the endpoint, results instrument oracle-gated before any data existed. Outcome, full 25,800-frame panel:

The paper’s central claim held on our stack, and then some: the 1-NFE student didn’t just match its teacher, a single one-eval draw beat both the teacher’s 30-eval read and the AR anchor; ~4.5 h wall on one H100, under half their quoted budget.

The replication also surfaced a mechanism the paper doesn’t dwell on: distillation compiled the mean, not the distribution. The student’s residual draw spread is ~5× smaller than the teacher’s (averaging gain −0.236 vs −1.258), and its per-step advantage over the teacher widens monotonically along the action horizon — exactly where draw spread is largest. For chunk-MAE deployment that’s the profitable direction; for anything needing mode diversity (best-of-N search, the #19 selection rungs), the Heun teacher’s draw distribution has no student counterpart. One number makes the point: the teacher’s best-of-10 oracle bound on the probe subset is 3.86; the student has nothing comparable.

What transfers, what doesn’t, and what it fed

Transfers, verified: the recipe itself — every claimed property (zero-init identity, self-distillation stability, teacher-parity at 1-NFE) survived contact with a different trunk, action space, and metric. This is our strongest evidence that the one-step literature is real rather than benchmark-tuned.

Doesn’t transfer: their success-rate framing. On our panel the interesting effects (mean-compilation, horizon-dependent compression) only became visible because chunk-MAE decomposes per-step — a rollout benchmark would have reported “parity” and hidden the distribution collapse.

Fed: #12 (the distillation leg is now confirmed — the 1-NFE student is the proposed deployment-class config, owner sign-off pending); closed the charter §2 cost caveat on #1’s mean-of-10 result (10 expert evals now cost less than one Heun-30 draw); gave #1’s Golden-Ticket noise search a 30× cheaper substrate; and its draw-collapse finding is standing context for #19 — selection methods need the teacher’s draws, not the student’s.