English
Related papers

Related papers: Empowerment-driven Exploration using Mutual Inform…

200 papers

Sparse reward environments are known to be challenging for reinforcement learning agents. In such environments, efficient and scalable exploration is crucial. Exploration is a means by which an agent gains information about the environment.…

Machine Learning · Computer Science 2023-10-11 Jacob Chmura , Hasham Burhani , Xiao Qi Shi

Reinforcement learning systems are often concerned with balancing exploration of untested actions against exploitation of actions that are known to be good. The benefit of exploration can be estimated using the classical notion of Value of…

Artificial Intelligence · Computer Science 2013-01-30 Richard Dearden , Nir Friedman , David Andre

Reinforcement Learning (RL) is known to be often unsuccessful in environments with sparse extrinsic rewards. A possible countermeasure is to endow RL agents with an intrinsic reward function, or 'intrinsic motivation', which rewards the…

Artificial Intelligence · Computer Science 2021-07-16 Francesco Massari , Martin Biehl , Lisa Meeden , Ryota Kanai

Intrinsically motivated reinforcement learning aims to address the exploration challenge for sparse-reward tasks. However, the study of exploration methods in transition-dependent multi-agent settings is largely absent from the literature.…

Machine Learning · Computer Science 2019-12-30 Tonghan Wang , Jianhao Wang , Yi Wu , Chongjie Zhang

Empowerment quantifies the influence an agent has on its environment. This is formally achieved by the maximum of the expected KL-divergence between the distribution of the successor state conditioned on a specific action and a distribution…

Machine Learning · Statistics 2015-09-29 Maximilian Karl , Justin Bayer , Patrick van der Smagt

Mutual Information between agent Actions and environment States (MIAS) quantifies the influence of agent on its environment. Recently, it was found that the maximization of MIAS can be used as an intrinsic motivation for artificial agents.…

Machine Learning · Computer Science 2020-08-04 Ruihan Zhao , Stas Tiomkin , Pieter Abbeel

Exploration algorithms for reinforcement learning typically replace or augment the reward function with an additional ``intrinsic'' reward that trains the agent to seek previously unseen states of the environment. Here, we consider an…

Machine Learning · Computer Science 2025-09-30 Kevin McKee , Eric Alt , Andrew Grebenisan , Mick van Gelderen , Gary Miguel

In this study, we address the problem of efficient exploration in reinforcement learning. Most common exploration approaches depend on random action selection, however these approaches do not work well in environments with sparse or no…

Machine Learning · Computer Science 2022-06-30 Doğay Kamar , Nazım Kemal Üre , Gözde Ünal

Empowerment is an information-theoretic method that can be used to intrinsically motivate learning agents. It attempts to maximize an agent's control over the environment by encouraging visiting states with a large number of reachable next…

Machine Learning · Computer Science 2020-01-09 Felix Leibfried , Sergio Pascual-Diaz , Jordi Grau-Moya

In reinforcement learning, an agent learns to reach a set of goals by means of an external reward signal. In the natural world, intelligent organisms learn from internal drives, bypassing the need for external signals, which is beneficial…

Machine Learning · Computer Science 2020-06-16 Rui Zhao , Yang Gao , Pieter Abbeel , Volker Tresp , Wei Xu

We introduce exploration potential, a quantity that measures how much a reinforcement learning agent has explored its environment class. In contrast to information gain, exploration potential takes the problem's reward structure into…

Machine Learning · Computer Science 2016-11-21 Jan Leike

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…

Machine Learning · Computer Science 2019-12-30 Qisheng Wang , Qichao Wang

We introduce an exploration bonus for deep reinforcement learning methods that is easy to implement and adds minimal overhead to the computation performed. The bonus is the error of a neural network predicting features of the observations…

Machine Learning · Computer Science 2018-10-31 Yuri Burda , Harrison Edwards , Amos Storkey , Oleg Klimov

Reinforcement Learning is a powerful tool to model decision-making processes. However, it relies on an exploration-exploitation trade-off that remains an open challenge for many tasks. In this work, we study neighboring state-based,…

Machine Learning · Computer Science 2025-11-04 Yu-Teng Li , Justin Lin , Jeffery Cheng , Pedro Pachuca

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…

Machine Learning · Computer Science 2021-05-25 Shariq Iqbal , Fei Sha

Reinforcement learning algorithms struggle when the reward signal is very sparse. In these cases, naive random exploration methods essentially rely on a random walk to stumble onto a rewarding state. Recent works utilize intrinsic…

Machine Learning · Computer Science 2019-06-14 Hyoungseok Kim , Jaekyeom Kim , Yeonwoo Jeong , Sergey Levine , Hyun Oh Song

An effective approach to exploration in reinforcement learning is to rely on an agent's uncertainty over the optimal policy, which can yield near-optimal exploration strategies in tabular settings. However, in non-tabular settings that…

All reinforcement learning algorithms must handle the trade-off between exploration and exploitation. Many state-of-the-art deep reinforcement learning methods use noise in the action selection, such as Gaussian noise in policy gradient…

Machine Learning · Computer Science 2018-04-05 Trevor Barron , Oliver Obst , Heni Ben Amor

Exploration in multi-task reinforcement learning is critical in training agents to deduce the underlying MDP. Many of the existing exploration frameworks such as $E^3$, $R_{max}$, Thompson sampling assume a single stationary MDP and are not…

Artificial Intelligence · Computer Science 2016-12-04 Sai Praveen Bangaru , JS Suhas , Balaraman Ravindran

Exploration is a key problem in reinforcement learning. Recently bonus-based methods have achieved considerable successes in environments where exploration is difficult such as Montezuma's Revenge, which assign additional bonuses (e.g.,…

Artificial Intelligence · Computer Science 2020-09-02 Yan Song , Yingfeng Chen , Yujing Hu , Changjie Fan
‹ Prev 1 2 3 10 Next ›