Learning to Plan from Random Exploration
Read the original on arXiv Statistics ML →The Flow has not summarised this story yet — read it at arXiv Statistics ML.
The Flow has not summarised this story yet — read it at arXiv Statistics ML.
HorizonFlow is a hierarchical planner for offline goal-conditioned reinforcement learning that treats the planning horizon as an output rather than a fixed input. It uses a subgoal route planner and an action-prefix controller, both employing insertion-based generation and flow matching, to jointly generate continuous plan content and its length. The method leverages the partially generated plan to guide token insertion and to steer generation toward shorter plans, achieving superior performance on Maze2D, Multi2D, and OGBench benchmarks.
The paper introduces Hamiltonian Temporal Contrastive Curiosity (HTC²), a method that combines multi‑horizon temporal representation learning with Hamiltonian phase‑space structure to guide exploration in physical control environments. HTC² uses a horizon‑conditioned contrastive critic to learn relationships between future state pairs within an episode, and the resulting representation distance serves as an intrinsic reward. The reward is further modulated by bounded multi‑step Hamiltonian variation, and the framework is integrated with Soft Actor‑Critic and Proximal Policy Optimization, evaluated on six DeepMind Control Suite tasks against several baseline curiosity methods.
Exploration in physical control environments requires agents to identify actions whose consequences reveal previously unexplored aspects of the underlying dynamics. However, many intrinsic motivation...
Recent advances in generative planning have made trajectory inpainting a promising approach to offline goal-conditioned reinforcement learning. However, these methods typically specify the planning ho...
The paper introduces Planning Under Noise (PUN), a neural operator that learns noise‑aware value fields for planning in unseen geometries. By imposing reflecting Neumann conditions on obstacles and a Dirichlet condition at the goal, PUN allows sampled paths to explore free space until reaching the target. It extends the Monte Carlo solver Walk on Stars to higher dimensions, learns geometry‑to‑field mappings from noisy labels, and achieves high success rates and low runtimes on 4‑D replanning benchmarks across multiple noise levels.
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.