中文
相关论文

相关论文: Combining Experience Replay with Exploration by Ra…

200 篇论文

Autonomous artificial agents must be able to learn behaviors in complex environments without humans to design tasks and rewards. Designing these functions for each environment is not feasible, thus, motivating the development of intrinsic…

机器学习 · 计算机科学 2025-02-20 Alana Santana , Paula P. Costa , Esther L. Colombini

Traditional exploration methods in RL require agents to perform random actions to find rewards. But these approaches struggle on sparse-reward domains like Montezuma's Revenge where the probability that any random action sequence leads to…

人工智能 · 计算机科学 2018-11-27 Christopher Stanton , Jeff Clune

One of the most critical challenges in deep reinforcement learning is to maintain the long-term exploration capability of the agent. To tackle this problem, it has been recently proposed to provide intrinsic rewards for the agent to…

机器学习 · 计算机科学 2022-06-02 Mingqi Yuan , Man-on Pun , Dong Wang

In reinforcement learning, experience replay stores past samples for further reuse. Prioritized sampling is a promising technique to better utilize these samples. Previous criteria of prioritization include TD error, recentness and…

机器学习 · 计算机科学 2021-11-10 Xu-Hui Liu , Zhenghai Xue , Jing-Cheng Pang , Shengyi Jiang , Feng Xu , Yang Yu

Experience replay (ER) improves the data efficiency of off-policy reinforcement learning (RL) algorithms by allowing an agent to store and reuse its past experiences in a replay buffer. While many techniques have been proposed to enhance ER…

机器学习 · 计算机科学 2021-04-06 Yunshu Du , Garrett Warnell , Assefaw Gebremedhin , Peter Stone , Matthew E. Taylor

Replaying data is a principal mechanism underlying the stability and data efficiency of off-policy reinforcement learning (RL). We present an effective yet simple framework to extend the use of replays across multiple experiments, minimally…

Efficient exploration in complex environments remains a major challenge for reinforcement learning. We propose bootstrapped DQN, a simple algorithm that explores in a computationally and statistically efficient manner through use of…

机器学习 · 计算机科学 2016-07-05 Ian Osband , Charles Blundell , Alexander Pritzel , Benjamin Van Roy

We present a unifying framework for designing and analysing distributional reinforcement learning (DRL) algorithms in terms of recursively estimating statistics of the return distribution. Our key insight is that DRL algorithms can be…

机器学习 · 统计学 2019-02-22 Mark Rowland , Robert Dadashi , Saurabh Kumar , Rémi Munos , Marc G. Bellemare , Will Dabney

The infamous exploration-exploitation dilemma is one of the oldest and most important problems in reinforcement learning (RL). Deliberate and effective exploration is necessary for RL agents to succeed in most environments. However, until…

人工智能 · 计算机科学 2017-10-09 Suraj Narayanan Sasikumar

In reinforcement learning an agent interacts with the environment by taking actions and observing the next state and reward. When sampled probabilistically, these state transitions, rewards, and actions can all induce randomness in the…

人工智能 · 计算机科学 2017-10-30 Will Dabney , Mark Rowland , Marc G. Bellemare , Rémi Munos

Despite the success of Random Network Distillation (RND) in various domains, it was shown as not discriminative enough to be used as an uncertainty estimator for penalizing out-of-distribution actions in offline reinforcement learning. In…

机器学习 · 计算机科学 2023-05-18 Alexander Nikulin , Vladislav Kurenkov , Denis Tarasov , Sergey Kolesnikov

Exploration in sparse reward environments remains one of the key challenges of model-free reinforcement learning. Instead of solely relying on extrinsic rewards provided by the environment, many state-of-the-art methods use intrinsic…

机器学习 · 计算机科学 2020-03-03 Roberta Raileanu , Tim Rocktäschel

It is well known that quantifying uncertainty in the action-value estimates is crucial for efficient exploration in reinforcement learning. Ensemble sampling offers a relatively computationally tractable way of doing this using randomized…

机器学习 · 计算机科学 2020-03-23 Tian Tan , Zhihan Xiong , Vikranth R. Dwaracherla

Exploration efficiency is a challenging problem in multi-agent reinforcement learning (MARL), as the policy learned by confederate MARL depends on the collaborative approach among multiple agents. Another important problem is the less…

机器学习 · 计算机科学 2019-12-30 Qisheng Wang , Qichao Wang

Developing agents for complex and underspecified tasks, where no clear objective exists, remains challenging but offers many opportunities. This is especially true in video games, where simulated players (bots) need to play realistically,…

机器学习 · 计算机科学 2025-04-15 Emilien Biré , Anthony Kobanda , Ludovic Denoyer , Rémy Portelas

Deep reinforcement learning achieves superhuman performance in a range of video game environments, but requires that a designer manually specify a reward function. It is often easier to provide demonstrations of a target behavior than to…

机器学习 · 计算机科学 2018-10-26 Aaron Tucker , Adam Gleave , Stuart Russell

This paper reviews exploration techniques in deep reinforcement learning. Exploration techniques are of primary importance when solving sparse reward problems. In sparse reward problems, the reward is rare, which means that the agent will…

机器学习 · 计算机科学 2022-05-03 Pawel Ladosz , Lilian Weng , Minwoo Kim , Hyondong Oh

Learning about many things can provide numerous benefits to a reinforcement learning system. For example, learning many auxiliary value functions, in addition to optimizing the environmental reward, appears to improve both exploration and…

机器学习 · 计算机科学 2020-08-25 Cam Linke , Nadia M. Ady , Martha White , Thomas Degris , Adam White

We study the use of randomized value functions to guide deep exploration in reinforcement learning. This offers an elegant means for synthesizing statistically and computationally efficient exploration with common practical approaches to…

机器学习 · 统计学 2019-09-25 Ian Osband , Benjamin Van Roy , Daniel Russo , Zheng Wen

Balancing exploration and exploitation remains a key challenge in reinforcement learning (RL). State-of-the-art RL algorithms suffer from high sample complexity, particularly in the sparse reward case, where they can do no better than to…

机器学习 · 计算机科学 2020-01-22 Philippe Morere , Gilad Francis , Tom Blau , Fabio Ramos