arXiv (All)
open access
Laplacian Representations for Decision-Time Planning
Planning with a learned model remains a key challenge in model-based reinforcement learning (RL). In decision-time planning, state representations are critical as they must support local cost computation while preserving long-horizon structure. In this paper, we show that the Laplacian representatio
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Bilinear World Models: Learning Representations with Structured Dynamics for Efficient Control#1131147
- Continuous attractor circuits for decision making with Laplace-domain neural representations#663839
- MoWAM: Explicit Future Motion Prediction for Efficient World Action Models#1034507
- Persistent Robot World Models: Stabilizing Multi-Step Rollouts via Reinforcement Learning#971778
- Characterizing Replay Retention Under Dynamics Shift in Model-Based Reinforcement Learning#1011862
Record · ID 1130168
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive