arXiv Machine Learning

Sparse Planning in Visual World Models via Cost Gradients

The paper introduces COSTGRAD, a training‑free, goal‑conditioned selector that ranks spatial tokens by the gradient norm of the planning cost, enabling sparse token usage in token‑based world models. On AdaLN‑conditioned predictors at 50% sparsity, COSTGRAD matches or surpasses full‑token planning on three of four continuous‑control benchmarks while delivering a 2.6× wall‑clock speedup per planning step. Combining token sparsity with reduced CEM search yields an overall ~5× speedup, though the method’s effectiveness depends on the underlying architecture, as shown by a failure mode with concat‑based models.

arXiv Machine Learning
Oct 3

JEPA-Bisim: Learning Robust Visual Representations for Planning with Joint-Embedding Predictive World Models

JEPA-Bisim introduces a bisimulation encoder to joint-embedding predictive world models, ensuring that states with similar transition dynamics are mapped to nearby latent representations while suppressing irrelevant slow features such as background changes and distractors. The approach improves robustness on navigation (PointMaze) and manipulation (PushT) tasks under varied test-time visual conditions, achieving up to tenfold smaller latent spaces than DINO-WM. It remains effective across different pre-trained visual encoders, including DINOv2, SimDINOv2, and iBOT.

By Leonardo F. Toso, Davit Shadunts, Yunyang Lu, Gloria Geng, Nihal Sharma, Donglin Zhan, Nam H. Nguyen, James Anderson
arXiv AI
Oct 19

Beyond Action Prediction: Learning Search-Free Planning in Latent Space

The paper introduces Hindsight Inverse JEPA Planning (HIJP), a search‑free framework that replaces costly online action sequence optimization with a goal‑conditioned inverse model. HIJP trains by relabeling future observations as goals, providing action supervision across multiple horizons and shaping visual representations. The method also aligns predicted actions with a latent predictor model to enforce action‑transition consistency, achieving high success rates and significant speedups on visual control tasks.

By Guanchen Du, Jinhao Du, Yanpeng Sun, Shan Zhang, Na Zhao, Zechao Li
arXiv Machine Learning
Oct 21

Planning under Noise with Neural Operators

The paper introduces Planning Under Noise (PUN), a neural operator that learns noise‑aware value fields for planning in unseen geometries. By imposing reflecting Neumann conditions on obstacles and a Dirichlet condition at the goal, PUN allows sampled paths to explore free space until reaching the target. It extends the Monte Carlo solver Walk on Stars to higher dimensions, learns geometry‑to‑field mappings from noisy labels, and achieves high success rates and low runtimes on 4‑D replanning benchmarks across multiple noise levels.

By Michael Chen, Hong Chul Nam, Xi Deng, Anima Anandkumar