Metraipolis › archive › dc_3d7fb720b45b
Density-Guided Bootstrap Boundaries for Latent World-Model Reinforcement Learning — arXiv:2610.41022
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2610.41022
- License (as archived)
- CC0-1.0
- Archived
- 2026-11-02T07:49:23.011Z
- SHA-256 of the archived text
b6eb03902f6cedb28405feca970dfe43325bec9e47d03e98c2457c47b1542fb2- Stable URL of this page
https://metraipolis.com/documento/dc_3d7fb720b45b
How to cite
Density-Guided Bootstrap Boundaries for Latent World-Model Reinforcement Learning — arXiv:2610.41022 — arXiv (en), https://arxiv.org/abs/2610.41022 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_3d7fb720b45b (Metraipolis archive dc_3d7fb720b45b, sha256 b6eb03902f6cedb28405feca970dfe43325bec9e47d03e98c2457c47b1542fb2)
BibTeX
@misc{dc3d7fb720b45b,
title = {Density-Guided Bootstrap Boundaries for Latent World-Model Reinforcement Learning — arXiv:2610.41022},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2610.41022},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_3d7fb720b45b; sha256 b6eb03902f6cedb28405feca970dfe43325bec9e47d03e98c2457c47b1542fb2},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2610.41022. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
Latent world models allow reinforcement learning agents to learn policies from imagined trajectories, yet determining the optimal depth of model reliance remains a fundamental challenge. Fixed imagination horizons apply uniform prediction depths regardless of trajectory reliability, exposing target values to compounding model error or over-relying on critic approximations. We introduce density-guided bootstrap boundaries, a trajectory-dependent mechanism that adapts the depth of imagined returns using a score-informed relative density proxy. The proxy accumulates the estimated divergence of a score-corrected auxiliary field formed by a feature displacement network and a noise-conditioned score estimator along imagined paths. We propose two gating mechanisms: a hard boundary that halts return expansion at a discrete state, and a soft boundary that continuously shifts the return recursion toward critic bootstrapping. Both variants preserve boundary value estimates and apply corresponding survival weights to actor and critic losses. Formulated independently of specific dynamics models and instantiated within Dreamer V3, we prove that the resulting gated Bellman operator is a strict contraction mapping and that early bootstrapping monotonically reduces conditional target variance. We clarify the theoretical assumptions distinguishing our expansion proxy from exact path likelihoods. Across continuous-control tasks and Atari Pong, empirical evaluations show that dynamic boundary selection enhances sample efficiency and late-training performance over fixed-horizon and auxiliary-enabled baselines. Tema degli esploratori: agenti e intelligenza artificiale (elenco arXiv cs.LG, nuovi lavori del giorno). Categorie arXiv: Machine Learning (cs.LG) ; Machine Learning (stat.ML). Pagina del lavoro: https://arxiv.org/abs/2610.41022 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito). Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina. Letto il 2026-11-02T07:40:00.167Z dalla pagina https://arxiv.org/list/cs.LG/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).