Hierarchical planning over multi-scale latent world models enables 70% success on real robotic pick-and-place with goal-only input where flat models achieve 0%, while cutting planning compute up to 4x in simulations.
The cross-entropy method: a unified approach to combinatorial optimization, Monte-Carlo simulation and machine learning
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
verdicts
UNVERDICTED 2representative citing papers
AGMCTS augments MCTS with action-score gradients for particle beliefs, a Multiple Importance Sampling tree for reuse, and Area Formula gradients for smooth models, outperforming prior sample-based solvers on continuous benchmarks.
citing papers explorer
-
Hierarchical Planning with Latent World Models
Hierarchical planning over multi-scale latent world models enables 70% success on real robotic pick-and-place with goal-only input where flat models achieve 0%, while cutting planning compute up to 4x in simulations.
-
Action-Gradient Monte Carlo Tree Search for Non-Parametric Continuous (PO)MDPs
AGMCTS augments MCTS with action-score gradients for particle beliefs, a Multiple Importance Sampling tree for reuse, and Area Formula gradients for smooth models, outperforming prior sample-based solvers on continuous benchmarks.