Hugging Face Trending Papers

Decision-Metric Alignment in Latent World Models: Diagnostics and Action-Conditioned Objectives for MPC Planning

The paper investigates how latent world models (specifically JEPA-style models) use Euclidean distance to a goal latent as a cost for model‑predictive control (MPC). It introduces two metrics—Plan‑Real Spearman and CEM‑stage Spearman—to evaluate how well latent‑space distances align with real‑task progress, a property termed decision‑metric alignment. By identifying encoder distortion, terminal rollout error, and candidate margins as key factors, the authors propose DA‑LeWM, which augments the base model with inverse‑dynamics and demonstration‑conditioned goal‑action heads, leading to faster convergence and higher online success while maintaining similar probe scores.

arXiv Machine Learning
Aug 20

Decision-Metric Alignment in Latent World Models: Diagnostics and Action-Conditioned Objectives for MPC Planning

The paper introduces the concept of decision‑metric alignment, which ensures that Euclidean distance to a goal latent in JEPA‑style latent world models correctly ranks action sequences for model‑predictive control. It proposes two metrics—Plan‑Real Spearman and CEM‑stage Spearman—to evaluate latent–real rank agreement, and identifies encoder distortion, terminal rollout error, and candidate margins as key factors affecting alignment. Building on these insights, the authors present DA‑LeWM, an enhanced latent world model that incorporates inverse‑dynamics and demonstration‑conditioned goal‑action heads, leading to faster convergence and higher online success rates compared to the baseline LeWM while maintaining similar probe scores.

By Jiawei Wang, Ke Rui, Yushen Zuo, Yichun Feng, Minglei Li
arXiv AI
Aug 17

Traj-LeWM: Path-Aware World-Model Planning via Latent Trajectory Cost

arXiv:2608. 14125v1 Announce Type: new Abstract: LeWM is a lightweight visual world model that learns latent dynamics end-to-end from pixels and ranks candidate action sequences by the distance between their predicted endpoints and the goal.

By Xiaodi Huang, Ziyi Ding, Jingtian Wan, Yuchen Liu, Yuan Zhang, Xiao-Ping Zhang, Jiayu Chen, Zhang Zhang, Tao Huang
arXiv Machine Learning
Sep 22

D-JEPA: A Decision-Aligned Latent World Model

arXiv:2609.24749v1 Announce Type: cross Abstract: Latent world models predict the consequences of actions, but accurate prediction does not guarantee that latent distance reflects which candidate wil...

By Shuaijun Liu, Chengyu Wu, Qifu Wen, Feiyang You, Chenglong Zhang, Shuyang Hao, Xi Lin, Ningxin Su
arXiv Machine Learning
Oct 9

How Long, Not How Close: A Learned Temporal Metric for Planning in Latent World Models

The paper introduces TEMPO, a temporal-distance planning objective that augments latent world models by learning a map of the frozen latent space where distances correspond to the number of environment steps between states. TEMPO blends this learned temporal distance into the planner’s cost, requiring no additional rewards or policies, and adds negligible computational overhead. Experiments on eleven simulated environments show that TEMPO consistently improves planner performance across all goal distances, notably raising LeWM’s success rate from 36% to 99% on the TwoRoom task.

By Lama Moukheiber, Haotian Xue, Yongxin Chen
Hugging Face Trending Papers
Sep 3

Latent Energy Action Planning with World Models

Latent Energy Action Planning (LEAP) improves model predictive control by treating the entire action horizon as a differentiable variable and optimizing it using a frozen LeWorldModel (LeWM). LEAP couples terminal latent goal matching with a terminal-window state energy, ensuring both the predicted terminal latent and the decoder-predicted terminal descriptor align with the goal. In four control domains, LEAP raises mean success from 77.5% (LeWM+CEM) to 94.8%, a 17.3‑percentage‑point improvement while keeping the frozen LeWM representation.

arXiv AI
Sep 30

Beyond a single latent space: a dual-latent world model for long-horizon planning

The paper introduces the Dual-Latent World Model (Dual-WM), which separates local execution and long-range planning into distinct latent spaces and dynamics models. A new learning method, Long-Horizon Representation Learning with Weighted Rollout (LoRe), supervises predictions at both levels using exponential horizon weights. Experiments on five goal-conditioned visual control tasks show that Dual-WM improves success rates over strong baselines, especially at longer horizons.

By Delin Zhao, Zhengrong Yue, Shaobin Zhuang, Junlin He, Xiaoyu Chen, Zikang Wang, Yuxin Liu, Limin Wang, Yali Wang
arXiv AI
Sep 4

Toward Physically Grounded JEPA World Models for Goal-Conditioned Robotic Planning

The paper presents an end‑to‑end JEPA world model that enhances latent prediction with inverse dynamics and state alignment to improve goal‑conditioned robotic planning. By preventing latent collapse and grounding representations in physical configuration, the model achieves top success rates on tasks such as TwoRoom, PushT, and OGBench‑Cube, outperforming the baseline LeWorldModel. Ablation studies confirm that state alignment consistently boosts planning success over inverse dynamics alone across all four benchmark tasks.

By Muyuan Liu (GENISOM AI, Beijing, China), Yue Huang (GENISOM AI, Beijing, China), Zheng Liang (GENISOM AI, Beijing, China), Xiang Gao (GENISOM AI, Beijing, China)
arXiv Machine Learning
Sep 4

Latent Energy Action Planning with World Models

Latent Energy Action Planning (LEAP) is a new method that treats the entire action horizon as a differentiable variable and optimizes it using a frozen LeWorldModel (LeWM). LEAP couples terminal latent goal matching with a terminal‑window state energy, ensuring that the predicted terminal latent and decoder‑predicted terminal descriptor align with the goal. Using a frozen goal‑conditioned proposal, a quasi‑Newton solver, and post‑optimization projection, LEAP improves mean success from 77.5% to 94.8% across four control domains while keeping the LeWM representation frozen.

By Phu Pham, Aniket Bera
arXiv Machine Learning
Oct 7

Reperesentation Geometry Matters for Planning with JEPA World Models

The paper introduces SCALE (State-CAlibrated Latent Embeddings), a technique that aligns pairwise latent distances with task-relevant state-space distances in joint-embedding predictive world models. By adding SCALE to the LeWorldModel (LeWM) objective, the authors preserve LeWM’s architecture while ensuring that latent geometry reflects meaningful task outcomes. Experiments demonstrate that SCALE improves planning success across manipulation and navigation tasks with various solvers, and the authors analyze how the method reshapes representation geometry to support planning.

By Jiaming Hu, Yan Zheng, Shi Bo, Tian Wang, Florian Dubost, Alejandro Mottini, Junze Liu, Arvind Srinivasan, Kai Zhong, Kun Qian, Sharon Gao, Qingjun Cui