中文
相关论文

相关论文: Reward Prediction Error as an Exploration Objectiv…

200 篇论文

Solving tasks with sparse rewards is one of the most important challenges in reinforcement learning. In the single-agent setting, this challenge is addressed by introducing intrinsic rewards that motivate agents to explore unseen regions of…

机器学习 · 计算机科学 2021-05-25 Shariq Iqbal , Fei Sha

Unsupervised Reinforcement Learning (RL) provides a promising paradigm for learning useful behaviors via reward-free per-training. Existing methods for unsupervised RL mainly conduct empowerment-driven skill discovery or entropy-based…

机器学习 · 计算机科学 2024-05-28 Chenjia Bai , Rushuai Yang , Qiaosheng Zhang , Kang Xu , Yi Chen , Ting Xiao , Xuelong Li

This paper examines the exploration-exploitation trade-off in reinforcement learning with verifiable rewards (RLVR), a framework for improving the reasoning of Large Language Models (LLMs). Recent studies suggest that RLVR can elicit strong…

机器学习 · 计算机科学 2026-01-27 Peter Chen , Xiaopeng Li , Ziniu Li , Wotao Yin , Xi Chen , Tianyi Lin

Not having access to compact and meaningful representations is known to significantly increase the complexity of reinforcement learning (RL). For this reason, it can be useful to perform state representation learning (SRL) before tackling…

机器学习 · 计算机科学 2022-02-16 Astrid Merckling , Nicolas Perrin-Gilbert , Alex Coninx , Stéphane Doncieux

Effective exploration is critical for reinforcement learning agents in environments with sparse rewards or high-dimensional state-action spaces. Recent works based on state-visitation counts, curiosity and entropy-maximization generate…

机器学习 · 计算机科学 2022-09-13 Bang You , Jingming Xie , Youping Chen , Jan Peters , Oleg Arenz

This paper investigates the use of intrinsic reward to guide exploration in multi-agent reinforcement learning. We discuss the challenges in applying intrinsic reward to multiple collaborative agents and demonstrate how unreliable reward…

人工智能 · 计算机科学 2019-06-06 Wendelin Böhmer , Tabish Rashid , Shimon Whiteson

We study the challenging exploration incentive problem in both bandit and reinforcement learning, where the rewards are scale-free and potentially unbounded, driven by real-world scenarios and differing from existing work. Past works in…

机器学习 · 计算机科学 2024-05-07 Mengfan Xu , Diego Klabjan

Sparse reward is one of the biggest challenges in reinforcement learning (RL). In this paper, we propose a novel method called Generative Exploration and Exploitation (GENE) to overcome sparse reward. GENE automatically generates start…

机器学习 · 计算机科学 2019-11-21 Jiechuan Jiang , Zongqing Lu

One of the bottlenecks preventing Deep Reinforcement Learning algorithms (DRL) from real-world applications is how to explore the environment and collect informative transitions efficiently. The present paper describes bounded exploration,…

机器学习 · 计算机科学 2024-12-10 Ting Qiao , Henry Williams , David Valencia , Bruce MacDonald

Efficient exploration remains a challenging problem in reinforcement learning, especially for tasks where extrinsic rewards from environments are sparse or even totally disregarded. Significant advances based on intrinsic motivation show…

机器学习 · 计算机科学 2024-04-03 Chenjia Bai , Peng Liu , Kaiyu Liu , Lingxiao Wang , Yingnan Zhao , Lei Han

Existing exploration strategies in reinforcement learning (RL) often either ignore the history or feedback of search, or are complicated to implement. There is also a very limited literature showing their effectiveness over diverse domains.…

人工智能 · 计算机科学 2020-10-01 Xing Wang , Alexander Vinel

Deep Research agents tackle knowledge-intensive tasks through multi-round retrieval and decision-oriented generation. While reinforcement learning (RL) has been shown to improve performance in this paradigm, its contributions remain…

计算与语言 · 计算机科学 2026-02-24 Yinuo Xu , Shuo Lu , Jianjie Cheng , Meng Wang , Qianlong Xie , Xingxing Wang , Ran He , Jian Liang

Deep learning has achieved remarkable successes in solving challenging reinforcement learning (RL) problems when dense reward function is provided. However, in sparse reward environment it still often suffers from the need to carefully…

机器学习 · 计算机科学 2019-02-19 Hao Liu , Alexander Trott , Richard Socher , Caiming Xiong

Intrinsic rewards can improve exploration in reinforcement learning, but the exploration process may suffer from instability caused by non-stationary reward shaping and strong dependency on hyperparameters. In this work, we introduce…

机器学习 · 计算机科学 2022-02-10 Lukas Schäfer , Filippos Christianos , Josiah P. Hanna , Stefano V. Albrecht

Efficient exploration remains a central challenge in reinforcement learning, serving as a useful pretraining objective for data collection, particularly when an external reward function is unavailable. A principled formulation of the…

机器学习 · 计算机科学 2026-03-16 Jacob Adamczyk , Adam Kamoski , Rahul V. Kulkarni

Efficient exploration remains one of the longstanding problems of deep reinforcement learning. Instead of depending solely on extrinsic rewards from the environments, existing methods use intrinsic rewards to enhance exploration. However,…

机器学习 · 计算机科学 2024-12-09 SuMin Oh , WanSoo Kim , HyunJin Kim

This paper provides a theoretical study of deep neural function approximation in reinforcement learning (RL) with the $\epsilon$-greedy exploration under the online setting. This problem setting is motivated by the successful deep…

机器学习 · 计算机科学 2022-10-18 Fanghui Liu , Luca Viano , Volkan Cevher

Although exploration in reinforcement learning is well understood from a theoretical point of view, provably correct methods remain impractical. In this paper we study the interplay between exploration and approximation, what we call…

机器学习 · 计算机科学 2019-01-25 Adrien Ali Taïga , Aaron Courville , Marc G. Bellemare

Realistic environments often provide agents with very limited feedback. When the environment is initially unknown, the feedback, in the beginning, can be completely absent, and the agents may first choose to devote all their effort on…

Reward-free reinforcement learning (RL) considers the setting where the agent does not have access to a reward function during exploration, but must propose a near-optimal policy for an arbitrary reward function revealed only after…

机器学习 · 计算机科学 2022-06-22 Andrew Wagenmaker , Yifang Chen , Max Simchowitz , Simon S. Du , Kevin Jamieson