paper-with-me

홈 › Papers

Look Before Leap: Look-Ahead Planning with Uncertainty in Reinforcement Learning

2025-03-26 · Yongshuai Liu, Xin Liu

Model-based reinforcement learning (MBRL) has demonstrated superior sample efficiency compared to model-free reinforcement learning (MFRL). However, the presence of inaccurate models can introduce biases during policy learning, resulting in misleading trajectories. The challenge lies in obtaining accurate models due to limited diverse training data, particularly in regions with limited visits (uncertain regions). Existing approaches passively quantify uncertainty after sample generation, failing to actively collect uncertain samples that could enhance state coverage and improve model accuracy. Moreover, MBRL often faces difficulties in making accurate multi-step predictions, thereby impacting overall performance. To address these limitations, we propose a novel framework for uncertainty-aware policy optimization with model-based exploratory planning. In the model-based planning phase, we introduce an uncertainty-aware k-step lookahead planning approach to guide action selection at each step. This process involves a trade-off analysis between model uncertainty and value function approximation error, effectively enhancing policy performance. In the policy optimization phase, we leverage an uncertainty-driven exploratory policy to actively collect diverse training samples, resulting in improved model accuracy and overall performance of the RL agent. Our approach offers flexibility and applicability to tasks with varying state/action spaces and reward structures. We validate its effectiveness through experiments on challenging robotic manipulation tasks and Atari games, surpassing state-of-the-art methods with fewer interactions, thereby leading to significant performance improvements.

📄 PDF Abstract BibTeX arXiv:2503.20139

Code (0)

등록된 구현이 없습니다.

Tasks

Atari GamesModel-based Reinforcement Learning

Similar Papers 제목 키워드 기반

On the Hardness of Reinforcement Learning with Transition Look-Ahead

2025-10-22 · Corentin Pla, Hugo Richard, Marc Abeille, Nadav Merlis 외 arxiv

We study reinforcement learning (RL) with transition look-ahead, where the agent may observe which states would be visited upon playing any sequence of $\ell$ actions before deciding its course of action. While such pred…

Reinforcement Learning

Look Before You Leap: Bridging Model-Free and Model-Based Reinforcement Learning for Planned-Ahead Vision-and-Language Navigation

2018-03-21 · ECCV 2018 9 · Xin Wang, Wenhan Xiong, Hongmin Wang, William Yang Wang

Existing research studies on vision and language grounding for robot navigation focus on improving model-free deep reinforcement learning (DRL) models in synthetic environments. However, model-free DRL models do not cons…

Deep Reinforcement LearningmodelModel-based Reinforcement Learningreinforcement-learning+5

Reinforcement Learning with Lookahead Information

2024-06-04 · Nadav Merlis

We study reinforcement learning (RL) problems in which agents observe the reward or transition realizations at their current state before deciding which action to take. Such observations are available in many application…

reinforcement-learningReinforcement LearningReinforcement Learning (RL)

Thinking into the Future: Latent Lookahead Training for Transformers

2026-03-03 · Lorenzo Noci, Gregor Bachmann, Seyed-Mohsen Moosavi-Dezfooli, Moin Nabi arxiv

Autoregressive language models trained with next-token prediction generate text by sampling one discrete token at a time. Although very scalable, this objective forces the model to commit at every step, preventing it fro…

Automating lookahead planning using site appearance and space utilization

2023-11-30 · Eyob Mengiste, Borja Garcia de Soto, Timo Hartmann

This study proposes a method to automate the development of lookahead planning. The proposed method uses construction material conditions (i.e., appearances) and site space utilization to predict task completion rates. A…

Scheduling