- Rating
- 2
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
The paper proposes splitting the planning horizon into shorter segments and resampling promising trajectory prefixes using an approximate terminal value function. It derives lower bounds on the samples needed to approach a reference optimal action sequence and evaluates the approach on an LQR problem and five simulated robotics tasks.
Critical strengths
The proposed resampling scheme is simple and compatible with several existing sampling-based controllers. Its cost reductions on four of five simulated tasks, including approximately 19% on Walker, suggest practical value.
Critical weaknesses
-
The central claim of an exponential sample-complexity reduction is not established. Proposition 4.6 and Theorem 4.9 both provide necessary lower bounds; a smaller lower bound for the split method does not establish that it actually requires fewer samples. An achievable upper bound or a matching tightness argument is missing. The transition from inequalities in Eqs. (31)–(35) to the equality in Eq. (36) is also unjustified as written.
-
The theoretical success criterion does not directly characterize control performance. The analysis requires a sampled action sequence to lie near one particular optimal sequence under time-factorized sampling. This is stronger than achieving low cost, especially when many distinct trajectories perform well. Moreover, it does not directly cover controllers such as MPPI that execute a synthesized mean, limiting the implications of the exponential lower bound for the methods discussed.
-
The connection between the idealized analysis and the implemented algorithm remains incomplete. Theorem 4.9 assumes sampling from a true population conditional distribution, whereas Algorithm 2 resamples a finite particle set using an empirical minimum. The effects of finite-particle approximation and losing useful prefixes are not quantified. Furthermore, the required terminal function and known uniform error bound are insufficiently specified for the nonlinear robotics experiments.
-
The empirical validation does not convincingly establish the claimed scaling law. The LQR experiment fixes T=12 and , while the nonlinear experiment fits several parameters to observed costs. The latter also treats a one-sided Lipschitz bound as an approximate equality. Without reported held-out predictions or direct measurements of the sample budget needed to achieve a fixed success criterion across horizons, these fits provide limited evidence of tightness or exponential scaling.
-
The comparisons do not adequately establish the method’s distinct efficiency advantage. Only monolithic PS, MPPI, and CEM baselines are evaluated, leaving the benefit over sequential resampling or other horizon-decomposition methods unclear. Computational accounting also requires clarification: N is a per-segment sample count in Algorithm 2 but is summed across segments in the proof. Total dynamics evaluations and wall-clock measurements are needed to interpret the efficiency gains.
Questions for authors
-
Which result establishes an achievable sample-complexity improvement, beyond comparing necessary lower bounds, and how should the equality in Eq. (36) be justified or corrected?
-
Under what additional assumptions does the lower bound for approaching a particular optimal action sequence imply a lower bound for achieving low control cost, including for controllers that execute a synthesized mean?
-
How are and chosen in each nonlinear task, and what connects the finite-particle, empirical-threshold implementation to the population-conditional sampler analyzed in Theorem 4.9?
-
Were any combinations of T, N, and K held out from parameter fitting, and do the fitted relationships predict performance on those configurations without refitting?
-
How are total dynamics evaluations and runtime matched between the split and unsplit methods, and what evidence distinguishes the proposed selection rule’s benefit from that of standard sequential resampling or horizon decomposition?