Contact
Algeria - National academic platform
...
Prepare your scientific stay

Host laboratory · Invitation letter · Application guidance

Learn more

AI & Research · arXiv Machine Learning · publications

Latent Projection for Latent Planning

Source excerpt

This page presents AI and research content to help researchers, students and AI tools read, cite and verify the information.

arXiv:2610.26979v1 Announce Type: new Abstract: 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 $\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' \mid z \sim \mathcal{N}(Az,\, I - AA^\top)$. Fitting the state dynamics $A$ therefore yields the covariance at no additional cost, and in its eigenbasis each latent direction carries its own uncertainty. Furthermore, constraining $A$ 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 $\ell_2$ cost to the $k$-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, $A$, 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 $\ell_2$ cost by up to $+54.7$ points under a harder planning setting. Code is available at https://github.com/yjang43/lp2.

Your DzCademia workshop

Check a publication method or promise

A video or journal-finding tool can shortlist titles, not guarantee acceptance. Check identity, scope, author instructions and possible fees at official sources. Do not choose solely on speed promises or one indicator.

A practical exercise

Compare two journals against your research question: fit, article types, instructions and verified terms. Keep unknowns as questions rather than assumptions.

Record reference points
Topic
Latent Projection for Latent Planning
Source website
arxiv.org
Publication date at source
2026-10-21
Collection date on DzCademia
2026-10-21
My preparation plan

An indicative personal list, separate from official documents or requirements. Checkmarks stay on this device; no account needed.

0 / 5 steps checked

Read the source

DzCademia advice and exercises are separate from the source summary and requirements. This structured aid uses automated assistance and is neither scientific validation nor a selection promise. Source consulted on 2026-10-28.

intelligence artificielle projet recherche
View the original source

Official or original source: arXiv Machine Learning. Always check the details against the primary source.

Back to AI & Research
369
Listed events
1410149
Total visits
34296
Visits today