跳到正文
研踪PaperTrail
← 研踪 PaperTrail

arXiv:2610.26979 · v2

Latent Projection for Latent Planning

首次提交 2026-10-19 09:51
版本更新 2026-11-15 03:03
雷达观测 2026-11-17 12:06
arXiv ↗PDF ↗

摘要

Latent world models let an agent plan in latent space. The planner searches for an action sequence that minimizes a cost, and that cost is often the ℓ2\ell_2 distance between the predicted terminal latent and the goal latent. The latent, however, is partly noise: the regularizer that prevents collapse during world model training promotes variance in the directions carrying no signal. We show that the same regularizer also supplies the structure to prune that noise in the latent. SIGReg drives the latent marginal to a standard Gaussian at every step, and assuming further that the latent sequence is a Gauss-Markov process, the transition is linear with its covariance pinned by the map itself, z′∣z∼N(Az, I−AA⊤)z' \mid z \sim N(Az,\, I - AA^\top). Fitting the state dynamics AA therefore yields the covariance at no additional cost, and in its eigenbasis each latent direction carries its own uncertainty. Furthermore, constraining AA to be a normal matrix fixes that basis across timesteps, so one eigenbasis measures the uncertainty over an arbitrary number of steps and serves as a stable basis to compute the planning cost on. We then restrict the ℓ2\ell_2 cost to the kk-dimensional subspace the state dynamics carry forward with the least uncertainty. The correction is post hoc: the encoder, the predictor, the rollout, and the planner are all left untouched, and only a single constrained matrix, AA, is fit. We evaluate across six environments and show large gains on the 2D navigation tasks, TwoRoom and PointMaze, raising success rate over the plain ℓ2\ell_2 cost by up to +54.7+54.7 points under a harder planning setting. Code is available at https://github.com/yjang43/lp2.

作者备注:Accepted to the CoRL 2026 Workshop on Modeling Uncertainty in Robotic World Models

AI 论文解读

基于摘要 · 非全文审阅

此版本尚未生成 AI 解读。解读由后台任务生成并按论文版本保存,登录后共享已有结果。

版本差异

本站首次收录为 v2,暂无更早版本可对照。

观测到的版本

相邻记录可能跳过中间版本;首次发现 v2 及以上也会标为版本更新。

v2 · 2026-11-15 03:03 · 最新观测版本

Latent Projection for Latent Planning

Latent world models let an agent plan in latent space. The planner searches for an action sequence that minimizes a cost, and that cost is often the ℓ2\ell_2 distance between the predicted terminal latent and the goal latent. The latent, however, is partly noise: the regularizer that prevents collapse during world model training promotes variance in the directions carrying no signal. We show that the same regularizer also supplies the structure to prune that noise in the latent. SIGReg drives the latent marginal to a standard Gaussian at every step, and assuming further that the latent sequence is a Gauss-Markov process, the transition is linear with its covariance pinned by the map itself, z′∣z∼N(Az, I−AA⊤)z' \mid z \sim N(Az,\, I - AA^\top). Fitting the state dynamics AA therefore yields the covariance at no additional cost, and in its eigenbasis each latent direction carries its own uncertainty. Furthermore, constraining AA to be a normal matrix fixes that basis across timesteps, so one eigenbasis measures the uncertainty over an arbitrary number of steps and serves as a stable basis to compute the planning cost on. We then restrict the ℓ2\ell_2 cost to the kk-dimensional subspace the state dynamics carry forward with the least uncertainty. The correction is post hoc: the encoder, the predictor, the rollout, and the planner are all left untouched, and only a single constrained matrix, AA, is fit. We evaluate across six environments and show large gains on the 2D navigation tasks, TwoRoom and PointMaze, raising success rate over the plain ℓ2\ell_2 cost by up to +54.7+54.7 points under a harder planning setting. Code is available at https://github.com/yjang43/lp2.

查看此版本解读 →查看此版本原文 ↗