- Rating
- 2
- Confidence
- 2
- Informativeness
- 1
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
The paper proposes TIME, a training-free planning objective for goal-conditioned MPC through a frozen latent world model. Every predicted block h is treated as a candidate arrival time. Its cost is b_h = αh + ρ·softplus_κ(c_h − ε), where c_h is the latent goal distance normalized by the current-to-goal distance. The costs are aggregated with a smooth minimum, F = −τ log Σ_h exp(−b_h/τ).
- α = 0 gives "Free" (endpoint flexibility only), and α = 1 gives TIME (adds a preference for early arrival).
- The analysis covers the Gibbs-weight view, causal gradients, a monotone shift of the weighted endpoint index with α, a discounted-return identity, penalty/smoothing bounds and analytic counter-examples.
Experiments:
- Frozen LeWM on TwoRoom, PushT, Reacher and Cube: 64 held-out test episodes × 3 seeds, a shared solver (96-start coarse-to-fine Adam + L-BFGS-B) selected on 16 development episodes, and paired bootstrap tests with Holm correction.
- Free beats Terminal on all four tasks. TIME beats Free on TwoRoom (−9.3 steps) and Reacher (−4.7) but not on PushT or Cube.
- TIME has the lowest mean steps against CEM/iCEM/MPPI*/GD/GRASP; 16 of 20 contrasts are significant, and all non-significant ones are on Cube.
- There is a DINO-WM check on PushT and Wall. Initial-plan latency is 4.8 s vs 0.18–0.57 s for the sampling planners.
Critical strengths
-
Exemplary experimental hygiene and honest reporting. The protocol separates development and test episodes, fixes the solver on the development set before testing (with a check that Free would select the same configuration), and uses paired episode-bootstrap intervals with Holm correction. Negative and unresolved results are disclosed rather than hidden, e.g. Cube favours Free over TIME, and Terminal beats both at H = 3 on Cube. The paper also states its caveats explicitly and gives analytic examples (App. A.5) showing that terminal matching under receding-horizon control can keep postponing arrival even with exact dynamics. This level of rigour is rare in planning papers and makes the reported numbers trustworthy.
-
A clean conceptual decomposition. The Terminal → Free → TIME ladder separates "allow arrival at any step" from "prefer earlier arrival", so the contribution of endpoint flexibility and of explicit time preference can be measured separately. The permutation argument (Free is invariant to reordering endpoint costs, TIME is not) is a crisp way to state the distinction, and the analytic example in Fig. 5c makes it concrete.
Critical weaknesses
- Weak Terminal baseline and missing standard alternatives. Free vs Terminal accounts for nearly all of the improvement (Reacher 95.36 → 19.19 steps). The explicit time term — the part that is new — is significant on only 2 of 4 tasks, and Cube moves the wrong way (+3.70). The internal Terminal reference at H = 8 with the normalized softplus penalty is much worse than the external GD planner on the raw C_H: on Reacher, GD gets 32.87 steps / 93.2% vs Terminal's 95.36 / 7.3%. Even at H = 3, Terminal gets only 70.78 / 50% (Table 9). At H = 3 on Cube, Terminal (28.56) beats both Free and TIME. So "Terminal at H = 8" largely captures the receding-horizon postponement effect plus the loss transform, not a well-tuned terminal planner. The obvious objectives are absent: the cumulative running cost (the default MPC stage cost, which already favours early arrival), a hard min over h (the "best-intermediate" distance the paper attributes to ProWorld), and a plain discounted sum. The paper itself notes that smooth temporal extrema and the discounted form are established (App. B, Eq. 7). Its novelty therefore rests on this particular composition, which cannot be judged without these baselines.
- Limited practical significance and scope. TIME's initial solve takes ~4.8 s, about 10–25× the sampling planners, and total wall-clock completion time is not reported. TIME is never plugged into CEM or iCEM, although it is solver-agnostic. Table 2 therefore still confounds objective and solver, and it remains unknown whether the benefit survives with fast samplers.
Questions for authors
- Please explain the Cube regression with α > 0: active-case success drops from 43.8% to 38.2%. Does the early-arrival preference produce more aggressive contact actions?
- Can you run Free and TIME as the cost inside iCEM/CEM with their development-selected budgets? Do the step reductions persist at sampling-level latency?
- Under the same shared solver and H = 8, how do (a) , (b) (hard), and (c) compare with Free and TIME? If (a) matches TIME, what is the specific benefit of the smooth-min formulation?
- How sensitive are the results to α (e.g., 0.25, 0.5, 2), τ and ε? Is Cube's degradation monotone in α?
2 comments
Thank you for the thorough rebuttal and for continuing to report the experimental outcomes transparently. The sensitivity sweeps over , , and together with clarifying Proposition 1 under action re-optimization (Q4), as well as checking raw versus penalized Terminal at H = 8 on Reacher, address those specific diagnostic questions, and the iCEM/CEM experiments (Q2) confirm that the objective can run at sub-second first-solve latency.
However, my main concerns regarding the methodological novelty of TIME's specific formulation (W1, Q3), the unresolved negative result on Cube (Q1), and the consistency of practical gains (W2, Q2) remain, and are in several places reinforced by the new results:
- Regarding W1 and Q3 (and Q1), the new ablations narrow rather than establish the necessity of TIME's specific formulation. First, on 64 TwoRoom episodes, the hard minimum min_h(αh + p_h) (13.56) slightly beats smooth TIME (13.75), indicating that log-sum-exp smoothing and multi-endpoint Gibbs gradients add no empirical benefit once αh is included. Second, outside TwoRoom (tested on 16 episodes in Q3), untuned sum_h c_h (9.35) and sum_h γ^h c_h (9.27) match or slightly beat dev-retuned TIME (9.60) on Reacher, discounted sum is close on PushT (65.69 vs. 64.00), and Cube remains an unresolved negative result for α > 0 across Q3 (36.48 vs. 35.08 for Free) and Q4 (while Q1 leaves the failure cause open and relies on ε = 0.01, which degrades Free to 45.63). Finally, checking H = 8 still leaves unexplained why internal Terminal at H = 3 on Reacher (70.78) lags far behind external GD (32.87) and iCEM raw Terminal (38.53).
- Regarding W2 and Q2, under fast samplers TIME loses its advantage over Free on TwoRoom (45.22 vs. 43.97, despite TwoRoom being the only task where TIME clearly beat running sums under the gradient solver) and PushT (68.50 vs. 67.25), while on Cube its episode time (3.01 s) does not improve over raw Terminal (2.95 s). Moreover, total episode wall-clock time for the main 4.8 s gradient solver is still unreported, even though its initial solve alone exceeds the full-episode runtime of the samplers (1.35 to 4.37 s).
While I appreciate the rigorous and transparent empirical effort, these findings reinforce my concerns regarding novelty and practical scope, so I currently lean toward maintaining my score.
Thank you for your careful review.
Q1. How does the time preference affect contact and success on Cube?
TIME made a larger first movement, and a positive time weight improved success on new episodes. We selected an H=8 setting on development episodes, then changed only α between TIME (0.092) and Free (0). Of 64 new test episodes, 49 required an action. TIME solved 24/49 (49.0%) vs 21/49 (42.9%) for Free. Across all 64, mean actions fell from 45.91 with Free to 41.27 with TIME.
On the paper’s 48 initially unsolved Cube episodes, first-action gripper travel averaged 24.29 mm with TIME vs 19.08 mm with Free. The cube moved 7.23 vs 6.02 mm closer to the goal on that action. Mean cube–gripper normal force over executed actions was 18.13 vs 15.45 N. On the 49 new active episodes, first-action travel was 21.92 vs 19.55 mm and force at the end of that action was 17.45 vs 13.64 N, including zero-contact episodes. The larger first move persisted when success improved. Whether force caused the original failures remains open.
Q2. Do the gains persist at sampling latency?
TIME averaged fewer actions than raw Terminal on all four tasks and under one second per first solve. Each sampler used its development-selected settings on 32 paired episodes. All three shared the first-solve budget. Free changed only α to zero. Raw Terminal used final unnormalized distance.
Against Free, TIME cut episode time on Reacher and Cube. Success rose from 96.9% to 100% and 37.5% to 50.0%, respectively. Raw Terminal took 1.80 s and 2.95 s per episode. First-solve means cover episodes requiring action (22 on Cube, 32 elsewhere). Episode times include preprocessing, planning and simulation after loading, through success or 100 actions.
Q3. What does TIME add over the three standard distance costs?
All five objectives used the H=8 gradient solver. TIME averaged fewer actions than all three distance costs on Cube, TwoRoom and PushT (normalized cₕ, discount γ=0.9). TwoRoom and PushT used the paper’s settings on the first 16 test episodes. For Reacher and Cube separately, we selected TIME’s cost parameters on 24 development episodes and tested all five objectives on the same 48 held-out episodes. Cube used α=0.0625 and τ=0.25. Free set α=0. Initial success counts as 0 actions and failure as 100.
TIME and both sums solved all 48 Reacher episodes. The sums averaged 0.25 and 0.33 fewer actions than TIME. By action 10, TIME reached 34/48 goals, each sum 33/48, Free 31/48 and the hard minimum 14/48. A running cost penalizes mismatch even after a trajectory reaches and leaves the goal. TIME can reward the earlier arrival and draw gradients from several endpoints.
To isolate smoothing on 64 TwoRoom episodes, we kept elapsed time and changed only how we combined endpoint costs. The hard minimum minₕ(αh+pₕ) averaged 13.56 actions, smooth TIME 13.75 and Free 22.38. The hard and smooth minima differed by 0.19 actions.
Does the penalty explain Terminal’s high action count on Reacher? With the same H=8 solver on 32 episodes, raw Terminal averaged 90.47 actions, penalized Terminal 92.38 and TIME 15.34. External GD used H=3 and AdamW (Table 6).
Q4. How do α, τ and ε affect performance?
On 16 Reacher test episodes at H=8 and τ=0.25, α=0, 0.25, 0.5, 1 and 2 gave 20.31, 14.00, 13.81, 15.19 and 16.38 mean actions. On 16 Cube episodes the same weights gave 38.94, 39.25, 39.19, 39.44 and 39.63 actions, a nonmonotone response. Each weight solved 4 of the 10 initially unsolved episodes. We also varied τ and ε one at a time on those same Cube episodes at H=8.
Q1’s 64-episode test used τ=0.068 and ε=0.01. Proposition 1 holds the predicted trajectory fixed. Here the planner reoptimizes its actions.