中文
相关论文

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

200 篇论文

We study reward-free and reward-agnostic exploration in episodic finite-horizon Markov decision processes (MDPs), where an agent explores an unknown environment without observing external rewards. Reward-free exploration aims to enable…

机器学习 · 计算机科学 2026-05-18 Oran Ridel , Alon Cohen

Reinforcement Learning (RL) agents often struggle with inefficient exploration, particularly in environments with sparse rewards. Traditional exploration strategies can lead to slow learning and suboptimal performance because agents fail to…

机器学习 · 计算机科学 2026-03-31 Gaurav Chaudhary , Laxmidhar Behera , Washim Uddin Mondal

Efficient exploration remains a challenging problem in reinforcement learning, especially for those tasks where rewards from environments are sparse. A commonly used approach for exploring such environments is to introduce some "intrinsic"…

机器学习 · 计算机科学 2020-07-16 Neale Ratzlaff , Qinxun Bai , Li Fuxin , Wei Xu

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

Evolution strategies (ES) are a family of black-box optimization algorithms able to train deep neural networks roughly as well as Q-learning and policy gradient methods on challenging deep reinforcement learning (RL) problems, but are much…

人工智能 · 计算机科学 2018-10-31 Edoardo Conti , Vashisht Madhavan , Felipe Petroski Such , Joel Lehman , Kenneth O. Stanley , Jeff Clune

A major challenge in reinforcement learning is the design of exploration strategies, especially for environments with sparse reward structures and continuous state and action spaces. Intuitively, if the reinforcement signal is very scarce,…

机器学习 · 计算机科学 2021-06-15 Susan Amin , Maziar Gomrokchi , Hossein Aboutalebi , Harsh Satija , Doina Precup

We consider the problem of reinforcement learning under safety requirements, in which an agent is trained to complete a given task, typically formalized as the maximization of a reward signal over time, while concurrently avoiding…

Reinforcement learning (RL) has emerged as a powerful method for improving the reasoning abilities of large language models (LLMs). Outcome-based RL, which rewards policies solely for the correctness of the final answer, yields substantial…

机器学习 · 计算机科学 2025-09-09 Yuda Song , Julia Kempe , Remi Munos

Exploration remains a critical challenge in online reinforcement learning, as an agent must effectively explore unknown environments to achieve high returns. Currently, the main exploration algorithms are primarily count-based methods and…

机器学习 · 计算机科学 2025-05-19 Zhirui Fang , Kai Yang , Jian Tao , Jiafei Lyu , Lusong Li , Li Shen , Xiu Li

Autonomous exploration has many important applications. However, classic information gain-based or frontier-based exploration only relies on the robot current state to determine the immediate exploration goal, which lacks the capability of…

机器人学 · 计算机科学 2023-05-26 Yafei Hu , Junyi Geng , Chen Wang , John Keller , Sebastian Scherer

Proximal Policy Optimization with Adaptive Exploration (axPPO) is introduced as a novel learning algorithm. This paper investigates the exploration-exploitation tradeoff within the context of reinforcement learning and aims to contribute…

机器学习 · 计算机科学 2024-05-09 Andrei Lixandru

We propose Deep Q-Networks (DQN) with model-based exploration, an algorithm combining both model-free and model-based approaches that explores better and learns environments with sparse rewards more efficiently. DQN is a general-purpose,…

机器学习 · 计算机科学 2019-03-25 Stephen Zhen Gou , Yuyang Liu

How to best explore in domains with sparse, delayed, and deceptive rewards is an important open problem for reinforcement learning (RL). This paper considers one such domain, the recently-proposed multi-agent benchmark of Pommerman. This…

机器学习 · 计算机科学 2019-07-30 Chao Gao , Bilal Kartal , Pablo Hernandez-Leal , Matthew E. Taylor

Exploration in environments with sparse rewards remains a fundamental challenge in reinforcement learning (RL). Existing approaches such as curriculum learning and Go-Explore often rely on hand-crafted heuristics, while curiosity-driven…

机器学习 · 计算机科学 2026-02-03 Georgios Sotirchos , Zlatan Ajanović , Jens Kober

In distributional reinforcement learning (RL), the estimated distribution of value function models both the parametric and intrinsic uncertainties. We propose a novel and efficient exploration method for deep RL that has two components. The…

机器学习 · 计算机科学 2019-05-16 Borislav Mavrin , Shangtong Zhang , Hengshuai Yao , Linglong Kong , Kaiwen Wu , Yaoliang Yu

Model-based reinforcement learning (RL) is appealing because (i) it enables planning and thus more strategic exploration, and (ii) by decoupling dynamics from rewards, it enables fast transfer to new reward functions. However, learning an…

Maintaining the long-term exploration capability of the agent remains one of the critical challenges in deep reinforcement learning. A representative solution is to leverage reward shaping to provide intrinsic rewards for the agent to…

机器学习 · 计算机科学 2021-09-21 Mingqi Yuan , Mon-on Pun , Dong Wang , Yi Chen , Haojun Li

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

Exploration is a fundamental challenge in reinforcement learning (RL). Many of the current exploration methods for deep RL use task-agnostic objectives, such as information gain or bonuses based on state visitation. However, many practical…

机器学习 · 计算机科学 2018-02-21 Abhishek Gupta , Russell Mendonca , YuXuan Liu , Pieter Abbeel , Sergey Levine

Exploration in reinforcement learning is a challenging problem: in the worst case, the agent must search for high-reward states that could be hidden anywhere in the state space. Can we define a more tractable class of RL problems, where the…

机器学习 · 计算机科学 2021-07-20 Kevin Li , Abhishek Gupta , Ashwin Reddy , Vitchyr Pong , Aurick Zhou , Justin Yu , Sergey Levine