- Rating
- 3(+1)
- Confidence
- 2
- Informativeness
- 2
- Presentation
- 3
- Soundness
- 3(+1)
Read review
Paper summary
This paper proposes InstantWAM, a training-free inference scheme for flow-matching World Action Models (WAMs), instantiated on FastWAM. After a standard first plan generated with 10 network calls, each subsequent replan works as follows: (i) shift the unexecuted part of the previous action chunk and pad it by repeating the last action; (ii) re-noise it to the last nonzero timestep of FastWAM’s sampling schedule; (iii) correct it with a single observation-conditioned network call. The paper reports reducing the average number of network calls per plan from 10 to 1.62, giving 3.19× faster planner calls and 2.47× faster episode-level planning, achieving comparable success rates to FastWAM w/o inference speedup on RoboTwin 2.0 and LIBERO.
Critical strengths
- S1. Simple and easy to adopt. The method is training-free and requires no modification to the frozen model.
- S2. Substantial end-to-end speedup. The speedup is measured as end-to-end planning latency, not only as a reduction in network calls.
Critical weaknesses
W1. Limited novelty and missing related work. Reusing the unexecuted part of a previous action chunk to accelerate the next generation has already been proposed in training-free form for pre-trained generative policies, e.g., Falcon (ICML 2025) and RTI-DP (IROS 2025). These works are not cited. The authors should discuss them in the related work and clearly state what is novel beyond transferring the idea to FastWAM’s flow-matching decoder, especially relative to RTI-DP, which appears highly similar (RTI-DP also shifts the unexecuted part of the previous chunk, repeats the last action, and generates a new action chunk from it). Candidate differences could be re-noising for the reused action chunk, the single network call update. These should be articulated and their advantages should be supported empirically.
W2. Insufficient experimental controls. (i) Table 1 and Table 5 should include a call-matched baseline. Although Table 2 includes Fresh Noise (1 call from noise per plan), its first plan also uses only 1 call, so its budget differs from InstantWAM’s (10 calls for the first plan, then 1 call), and on RoboTwin it is evaluated only on a 15-task subset. A Fresh Noise variant with the same 10→(1 or 2) schedule, evaluated on the full benchmarks, would isolate how much reusing the previous chunk helps under an identical computational budget.
(ii) Table 1 and Table 5 report point estimates only. Please state the number of random seeds, report standard deviations, and indicate in the main text which benchmark and episodes Table 5 is measured on.
(iii) All experiments use FastWAM only. Results on other WAM backbones would further demonstrate the generality of the method.
[1] Chen et al. Falcon: Fast Visuomotor Policies via Partial Denoising. ICML, 2025.
[2] Duan et al. Real-Time Iteration Scheme for Diffusion Policy. IROS, 2025.
Questions for authors
Q. What exactly does Direct Prior compute at each replan? Two interpretations seem possible to me: (a) the unexecuted and padded action chunk is executed without a policy call, or (b) the unexecuted and padded action chunk is fed to the policy without re-noising. Sec. 5.3 says "Direct Prior cannot absorb the new observation", which supports (a). However, Table 8 reports a 10→1 schedule and a 144.0 ms update latency (equal to one call), which supports (b). If (b), the observation is actually used.