- Rating
- 2
- Confidence
- 2(−1)
- Informativeness
- 1
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
- The paper applies SMC to latent-space planning of a pretrained world model, refining candidate action sequences through stochastic updates, importance weighting, and resampling.
- It also constructs a latent graph from offline data and derives a new cost function.
- Experiments show that the proposed planner achieves higher average goal-reaching success rates than gradient descent, CEM, and GRASP, using the same proposed cost function.
Critical strengths
- The motivation and approach for combining exploration over multiple candidate action sequences with gradient-based optimization through SMC are clear.
- The method’s effectiveness is demonstrated with two different pretrained world models.
Critical weaknesses
- Unclear algorithmic contribution of the SMC planner. Existing work [1] already combines gradient-guided proposals with particle weighting and resampling. The paper should clarify which aspects of its SMC planner are new beyond applying these components to action-sequence planning.
- Incomplete experimental analysis. The cost ablation covers only the proposed planner. It remains unclear whether SMC retains its advantage under the standard L2 cost and whether the proposed cost similarly improves competing planners.
[1] Raghav Singhal et al. “A General Framework for Inference-time Scaling and Steering of Diffusion Models.” ICML, 2025.
Questions for authors
- Could the authors clarify how the proposed SMC planner builds on existing gradient-guided SMC methods and which algorithmic aspects are new?
- Does SMC retain its relative advantage under the L2 cost? Does the proposed cost also improve GD, CEM, and GRASP?
- Minor clarification (not counted in the assessment): Table 2 reduces N from 3 to 2 for DINO-WM at H=15, making resampling impossible with τ=0.5 since ESS≥1. Is resampling intentionally disabled in this setting, or is a different resampling rule used?
6 comments
Does SMC retain its relative advantage under the L2 cost? Does the proposed cost also improve GD, CEM, and GRASP?
We address this point in Section 4.4 and Figure 6, where every environment and horizon is run under both cost structures. Under the cost our planner averages 72.6% over the twelve settings, ahead of GD by 21.7 points, CEM by 27.3 and GRASP by 42.7, and level with MPPI at 72.3%. The PDE cost adds 7.2 points on average and takes the planner to 79.8%.
On whether the cost helps the baselines, Appendix G.3 and Figure 8 report GD, CEM and MPPI under the same roadmap cost on nine paired cells of 100 seeds each. The only significant change is GD on Reacher at , from 15% to 55% (), and the other eight cells stay within 9 points with . GRASP cannot take the cost, since its objective never evaluates a goal term and its terminal state is pinned at the goal, so a cost-to-go there is zero by construction. We are happy to elaborate further if specific aspects are unclear to the Reviewer.
Minor clarification — resampling at
Resampling is not disabled, but is done when with , the standard rule. At , this rule can never fire since . We thank the reviewer for the catch. We also note that in the revision, every planner holds 12 particles in every environment and horizon, so this configuration no longer appears.
We sincerely appreciate the time and effort the reviewers have devoted to reading and evaluating our paper and rebuttals. We hope our responses and additional experiments have addressed their concerns, and we would be happy to provide further clarifications or answer any additional questions the reviewers may have.
W1/Q1 — algorithmic contribution of the SMC planner
We thank the Reviewer for their detailed assessment and take this opportunity to firstly clarify that SMC is not the planner, but a key component within a stochastic optimization framework that forms the planner. As the reviewer correctly points out, the reweighting and resampling paradigm has been used for inference-time steering and distribution tilting in generative models, and more recently extended to optimization problems. This literature spans three lines.
(1). Inference-time steering and reward alignment in generative models [1, 2], with related work on diffusion-based sampling [3, 4] and on training latent diffusion models [5].
(2). SMC as a component of stochastic optimization, which is the line we build on [6, 7, 8], resting on the SMC samplers of [9], annealed flow transport [10] and sequential controlled Langevin diffusions [11].
(3). SMC in planning, control and reinforcement learning [12, 13, 14].
A key challenge with applying SMC over action spaces is that robots may have different action spaces (e.g., a 2D/3D navigation robot vs. a 7-DoF manipulator), requiring the kernels to be re-defined, thus affecting their generalizability. Reformulating SMC within the JEPA latent space instead achieves zero-shot generalizability to different environments. We show that neither the cost function nor the SMC planner needs to be redefined under new environments, making this a fully generalizable form of SMC optimization.
We therefore reformulate the Expectation-Maximization paradigm to optimize (latent) action sequences. The SMC sits as a key component within this framework. Our modeling paradigm defines the kernel by treating an entire action sequence as a single particle, thus operating in a higher-dimensional space where the environment and robot intrinsics do not require redefining the kernel, enabling zero-shot generalizability. Our objective is not just inference-time tilting, but stochastic optimization using the weights proposed by SMC.
References
[1] Ψ-Sampler: Initial Particle Sampling for SMC-Based Inference-Time Reward Alignment in Score Models. Taehoon Yoon, Yunhong Min, Kyeongmin Yeo, Minhyuk Sung. Advances in Neural Information Processing Systems, 2026.
[2] Inference-Time Scaling of Discrete Diffusion Models via Importance Weighting and Optimal Proposal Design. Zijing Ou, Chinmay Pani, Yingzhen Li. arXiv:2505.22524, 2026.
[3] Reverse Diffusion Sequential Monte Carlo Samplers. Luhuan Wu, Yi Han, Christian Andersson Naesseth, John Cunningham. Advances in Neural Information Processing Systems, 2026.
[4] Diffusion Path Samplers via Sequential Monte Carlo. James Matthew Young, Paula Cordero-Encinar, Sebastian Reich, Andrew Duncan, O. Deniz Akyildiz. arXiv:2601.21951, 2026.
[5] Training Latent Diffusion Models with Interacting Particle Algorithms. Tim Y. J. Wang, Juan Kuntz, O. Deniz Akyildiz. arXiv:2505.12412, 2026.
[6] Learning Latent Variable Models via Jarzynski-adjusted Langevin Algorithm. James Cuin, Davide Carbone, O. Deniz Akyildiz. Advances in Neural Information Processing Systems, 2025.
[7] Efficient Stochastic Optimisation via Sequential Monte Carlo. James Cuin, Davide Carbone, Yanbo Tang, O. Deniz Akyildiz. arXiv:2601.22003, 2026.
[8] Utilising Gradient-Based Proposals within Sequential Monte Carlo Samplers for Training of Partial Bayesian Neural Networks. Andrew Millard, Joshua Murphy, Zheng Zhao, Simon Maskell. ICASSP, 2026.
[9] Sequential Monte Carlo Samplers. Pierre Del Moral, Arnaud Doucet, Ajay Jasra. Journal of the Royal Statistical Society Series B, 2006.
[10] Annealed Flow Transport Monte Carlo. Michael Arbel, Alexander G. D. G. Matthews, Arnaud Doucet. arXiv:2102.07501, 2021.
[11] Sequential Controlled Langevin Diffusions. Junhua Chen, Lorenz Richter, Julius Berner, Denis Blessing, Gerhard Neumann, Anima Anandkumar. arXiv:2412.07081, 2025.
[12] Probabilistic Planning with Sequential Monte Carlo Methods. Alexandre Piché, Valentin Thomas, Cyril Ibrahim, Yoshua Bengio, Chris Pal. International Conference on Learning Representations, 2018.
[13] Sequential Monte Carlo for Policy Optimization in Continuous POMDPs. Hany Abdulsamad, Sahel Mohammad Iqbal, Simo Sarkka. Advances in Neural Information Processing Systems, 2026.
[14] Tempered Sequential Monte Carlo for Trajectory and Policy Optimization with Differentiable Dynamics. Heng Yang. arXiv:2604.21456, 2026.