中文
相关论文

相关论文: Multimodal Reward Shaping for Efficient Exploratio…

200 篇论文

Efficient exploration in reinforcement learning is a challenging problem commonly addressed through intrinsic rewards. Recent prominent approaches are based on state novelty or variants of artificial curiosity. However, directly applying…

机器学习 · 计算机科学 2022-11-21 Aditya Ramesh , Louis Kirsch , Sjoerd van Steenkiste , Jürgen Schmidhuber

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…

机器学习 · 计算机科学 2018-04-05 Trevor Barron , Oliver Obst , Heni Ben Amor

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…

Efficient exploration is a long-standing problem in reinforcement learning since extrinsic rewards are usually sparse or missing. A popular solution to this issue is to feed an agent with novelty signals as intrinsic rewards. In this work,…

机器学习 · 计算机科学 2022-05-20 Jianren Wang , Ziwen Zhuang , Hang Zhao

Reinforcement learning has enabled agents to solve challenging tasks in unknown environments. However, manually crafting reward functions can be time consuming, expensive, and error prone to human error. Competing objectives have been…

机器学习 · 计算机科学 2021-02-11 Brendon Matusch , Jimmy Ba , Danijar Hafner

Reinforcement learning, which acquires a policy maximizing long-term rewards, has been actively studied. Unfortunately, this learning type is too slow and difficult to use in practical situations because the state-action space becomes huge…

机器学习 · 计算机科学 2024-10-28 Takato Okudo , Seiji Yamada

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…

Tasks with large state space and sparse rewards present a longstanding challenge to reinforcement learning. In these tasks, an agent needs to explore the state space efficiently until it finds a reward. To deal with this problem, the…

机器学习 · 计算机科学 2023-10-16 Jiaheng Hu , Zizhao Wang , Peter Stone , Roberto Martin-Martin

Sufficient exploration is paramount for the success of a reinforcement learning agent. Yet, exploration is rarely assessed in an algorithm-independent way. We compare the behavior of three data-based, offline exploration metrics described…

机器学习 · 计算机科学 2020-10-30 Jakob J. Hollenstein , Sayantan Auddy , Matteo Saveriano , Erwan Renaudo , Justus Piater

Recently there has been a proliferation of intrinsic motivation (IM) reward-shaping methods to learn in complex and sparse-reward environments. These methods can often inadvertently change the set of optimal policies in an environment,…

机器学习 · 计算机科学 2024-10-17 Grant C. Forbes , Leonardo Villalobos-Arias , Jianxun Wang , Arnav Jhala , David L. Roberts

Reward engineering and designing an incentive reward function are non-trivial tasks to train agents in complex environments. Furthermore, an inaccurate reward function may lead to a biased behaviour which is far from an efficient and…

机器人学 · 计算机科学 2021-05-04 Saeed Tafazzol , Erfan Fathi , Mahdi Rezaei , Ehsan Asali

Recently there has been a proliferation of intrinsic motivation (IM) reward-shaping methods to learn in complex and sparse-reward environments. These methods can often inadvertently change the set of optimal policies in an environment,…

State-of-the-art reinforcement learning (RL) algorithms typically use random sampling (e.g., $\epsilon$-greedy) for exploration, but this method fails on hard exploration tasks like Montezuma's Revenge. To address the challenge of…

机器学习 · 计算机科学 2022-11-21 Eric Chen , Zhang-Wei Hong , Joni Pajarinen , Pulkit Agrawal

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

Exploration is an extremely challenging problem in reinforcement learning, especially in high dimensional state and action spaces and when only sparse rewards are available. Effective representations can indicate which components of the…

机器学习 · 计算机科学 2019-05-31 Giulia Vezzani , Abhishek Gupta , Lorenzo Natale , Pieter Abbeel

One of the central challenges faced by a reinforcement learning (RL) agent is to effectively learn a (near-)optimal policy in environments with large state spaces having sparse and noisy feedback signals. In real-world applications, an…

机器学习 · 计算机科学 2020-06-24 Parameswaran Kamalaruban , Rati Devidze , Volkan Cevher , Adish Singla

The development of autonomous agents for complex, long-horizon tasks is a central goal in AI. However, dominant training paradigms face a critical limitation: reinforcement learning (RL) methods that optimize solely for final task success…

机器学习 · 计算机科学 2025-07-31 Zijing Zhang , Ziyang Chen , Mingxiao Li , Zhaopeng Tu , Xiaolong Li

Exploration is essential for solving complex Reinforcement Learning (RL) tasks. Maximum State-Visitation Entropy (MSVE) formulates the exploration problem as a well-defined policy optimization problem whose solution aims at visiting all…

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.…

机器学习 · 计算机科学 2023-10-11 Jacob Chmura , Hasham Burhani , Xiao Qi Shi

Reinforcement learning methods require careful design involving a reward function to obtain the desired action policy for a given task. In the absence of hand-crafted reward functions, prior work on the topic has proposed several methods…

机器学习 · 计算机科学 2018-10-16 Daiki Kimura , Subhajit Chaudhury , Ryuki Tachibana , Sakyasingha Dasgupta