- Rating
- 2
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 3
- Soundness
- 2
Read review
Paper summary
The paper argues that best-of-N one-step flow policies such as MVP face a "connectivity barrier": a continuous map of Gaussian noise has connected support, so when high-value action chunks form separated regions, some proposal mass falls between them unless the Lipschitz constant is large. ModeFlow clusters offline trajectories into K labels that condition both the generator and the critic, and splits a fixed proposal budget evenly across labels. A second theorem lower-bounds the baseline's return gap to an idealized mode-conditioned policy by the chance that all its proposals miss the optimal region. On ten sparse-reward Robomimic and OGBench tasks, ModeFlow raises average final success over MVP from 0.79 to 0.99 and solves cube-triple-task5, where MVP fails entirely.
Critical strengths
-
A minimal change yields large gains at no extra inference cost. ModeFlow adds only a label embedding and stratified sampling to MVP at essentially MVP's latency. Because the cube-triple-task5 comparison holds every other setting fixed (App. C), the jump from complete failure to near-perfect success reflects the labels and stratification rather than tuning.
-
The obstruction is stated precisely. Theorem 1 carries known connected-support and isoperimetry arguments (Tanielian et al.; Salmona et al.) over to best-of-N proposals, the proofs appear correct, and the lemma that stratified proposals dominate i.i.d. ones is clean and reusable. This gives the paper a sound formal core.
Critical weaknesses
-
The causal story behind the gains is not established. The paper attributes ModeFlow's success to breaking a connectivity barrier, but its own analysis does not support this at the operating point. In Theorem 2 the bridge mass enters only through b^N, which is negligible at N = 32, so what the bound effectively captures is how proposals are allocated across regions, an effect that does not depend on connectivity. The experiments point the same way: the toy study (App. D) is equally consistent with an allocation explanation, and success keeps rising with K up to one proposal per label (Fig. 5c) instead of saturating at a plausible number of strategies, which fits added proposal diversity or exploration as well as mode discovery. The method may well work, but the paper's central explanation of why it works remains unverified.
-
The empirical comparison is less controlled than it appears. On nine of the ten tasks, the baseline numbers coincide exactly with those reported by Zhan et al. (2026) under a smaller configuration than ModeFlow's (fewer critic heads and, on Robomimic, fewer proposals), and Table 1 does not indicate this; a matched comparison is given only for a subset of OGBench tasks (Fig. 4). In addition, ModeFlow makes almost no progress during the offline phase on two Robomimic tasks where the baselines do (Fig. 3), which the paper does not discuss, and the number of modes K is set per benchmark although performance is highly sensitive to it. Together these make it hard to judge how much of the headline improvement is a fair and general gain.
Questions for authors
-
On cube-triple-task4/5 and one Robomimic task, does ModeFlow keep its advantage when the K-means labels are replaced by random labels with the same K, or when stratified sampling is replaced by i.i.d. label sampling? How often does some proposal succeed, and how often does the critic pick it?
-
Could you report MVP under ModeFlow's exact configuration on all ten tasks (and with larger proposal budgets, if run), report end-of-offline success for every method, and explain why ModeFlow makes almost no offline progress on Robomimic-can and square?
-
How was K chosen for each benchmark without using evaluation success, and what happened on cube-quadruple and antmaze-giant-navigate, whose partitions appear in Table 5, if you ran them, including negative results?
-
LDCQ (Venkatraman et al., ICLR 2024) selects trajectory-derived latent skills with a Q-function, and DDiffPG (Li et al., NeurIPS 2024) learns mode-specific Q-functions over trajectory clusters; neither is cited. What is new beyond pairing such clustering with a one-step generator and stratified best-of-N?