- Rating
- 3(+1)
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 3(+1)
Read review
Paper summary
The paper proposes LOTUS, a training-free method for steering diffusion policies. LOTUS constructs virtual actions that move the end-effector along straight lines toward the task keypoints. Both these virtual chunks and samples from the policy are noised to an intermediate denoising time, and a semi-unbalanced optimal transport problem is solved between them. The resulting transport plan gives a refined latent, which the policy then denoises into the executed action.
The authors evaluate LOTUS on Libero-Pro, Libero-Plus and VLABench, and on five real-world tasks with a Dobot Nova2 arm. LOTUS improves the base policy across all benchmarks, for example from 23.69% to 40.81% on Libero-Pro, and outperforms VLA-Pilot and VLS on VLABench. On the real robot, it improves the overall success rate from 23% to 59%. The paper also includes component ablations, hyperparameter sensitivity, and an efficiency comparison with VLS.
Critical strengths
-
The method is training-free and works with frozen policies, which is practical for large VLAs where fine-tuning is expensive. It consistently improves the base policy across three simulated benchmarks. The real-world experiments are also a useful addition: on five tasks with a Dobot Nova2 arm, LOTUS improves the overall success rate from 23% to 59%.
-
The paper includes useful ablations. In particular, it ablates the key components of the method (Figure 5) and provides an efficiency analysis against VLS (Table 4). The visualization in Figure 6 is also informative, as it clearly shows that the actions refined by LOTUS stay closer to the original policy's actions than those of VLS.
Critical weaknesses
-
Viewing the straight-line trajectories as "samples from a reward-induced action distribution" is not supported with mathematical rigor. In particular, no target distribution is defined. Moreover, the straight-line construction is a heuristic that is unlikely to help in tasks that are contact-rich or rotation-dominated, such as turning a knob, or where the target is ambiguous, such as tying shoelaces. The failure on the Stack Bowl task (Table 3) is consistent with this limitation.
-
From my understanding, the algorithm ultimately reduces to a weighted average of noised policy and virtual particles, with weights determined by reward and proximity, followed by a short denoising pass. The optimal transport formulation adds considerable complexity, which makes the paper harder to read, and it is unclear whether it is necessary. A comparison against a simpler alternative, such as averaging the same particles with weights proportional to exp(βR) and then denoising, would clarify this.
-
The method introduces many new hyperparameters (β, λ, ε, τ_s, k, b, N, M). Figure 5 shows that performance is sensitive to β and λ, ranging from about 22% to 30% on VLABench, and Table 5 shows that λ, τ_s and N are set differently across benchmarks. The sensitivity to the remaining parameters is not reported, and there is no principled way to select them. Moreover, most results compare only against the base policy, and Figure 4 includes only two additional steering baselines.
Questions for authors
-
Can the authors include additional steering baselines in the main results? In particular, methods that do not fine-tune the policy, such as V-GPS [1], and SDEdit [2] applied to the best virtual chunk (noising it and denoising it with the policy).
-
Can the authors report the sensitivity of LOTUS to the remaining hyperparameters (ε, τ_s, k, b)? In addition, can the authors compare against a simple baseline that averages the same particles with weights proportional to exp(βR), without optimal transport?
References
[1] Nakamoto et al. Steering Your Generalists: Improving Robotic Foundation Models via Value Guidance, '24
[2] Meng et al. SDEdit: Guided Image Synthesis and Editing with Stochastic Differential Equations, '22