中文
相关论文

相关论文: Exploration via Elliptical Episodic Bonuses

200 篇论文

We describe a method to use discrete human feedback to enhance the performance of deep learning agents in virtual three-dimensional environments by extending deep-reinforcement learning to model the confidence and consistency of human…

人工智能 · 计算机科学 2021-06-24 Zhiyu Lin , Brent Harrison , Aaron Keech , Mark O. Riedl

Learning complex robot behavior through interactions with the environment necessitates principled exploration. Effective strategies should prioritize exploring regions of the state-action space that maximize rewards, with optimistic…

机器学习 · 计算机科学 2025-03-12 Jasmine Bayrooti , Carl Henrik Ek , Amanda Prorok

Extrinsic rewards can effectively guide reinforcement learning (RL) agents in specific tasks. However, extrinsic rewards frequently fall short in complex environments due to the significant human effort needed for their design and…

机器学习 · 计算机科学 2025-04-28 Mingqi Yuan , Roger Creus Castanyer , Bo Li , Xin Jin , Wenjun Zeng , Glen Berseth

We propose an optimistic model-based algorithm, dubbed SMRL, for finite-horizon episodic reinforcement learning (RL) when the transition model is specified by exponential family distributions with $d$ parameters and the reward is bounded…

机器学习 · 计算机科学 2023-01-10 Gene Li , Junbo Li , Anmol Kabra , Nathan Srebro , Zhaoran Wang , Zhuoran Yang

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

Autonomous 3D environment exploration is a fundamental task for various applications such as navigation. The goal of exploration is to investigate a new environment and build its occupancy map efficiently. In this paper, we propose a new…

人工智能 · 计算机科学 2021-11-03 Liu Juncheng , McCane Brendan , Mills Steven

One major limitation to the applicability of Reinforcement Learning (RL) to many practical domains is the large number of samples required to learn an optimal policy. To address this problem and improve learning efficiency, we consider a…

机器学习 · 计算机科学 2023-08-07 Roberto Cipollone , Giuseppe De Giacomo , Marco Favorito , Luca Iocchi , Fabio Patrizi

Sparse rewards and long time horizons remain challenging for reinforcement learning algorithms. Exploration bonuses can help in sparse reward settings by encouraging agents to explore the state space, while hierarchical approaches can…

人工智能 · 计算机科学 2021-08-13 Willie McClinton , Andrew Levy , George Konidaris

The explore{exploit dilemma is one of the central challenges in Reinforcement Learning (RL). Bayesian RL solves the dilemma by providing the agent with information in the form of a prior distribution over environments; however, full…

机器学习 · 计算机科学 2012-03-19 Jonathan Sorg , Satinder Singh , Richard L. Lewis

Exploration in high-dimensional, continuous spaces with sparse rewards is an open problem in reinforcement learning. Artificial curiosity algorithms address this by creating rewards that lead to exploration. Given a reinforcement learning…

机器学习 · 计算机科学 2023-11-08 Alexander Nedergaard , Matthew Cook

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

Reinforcement learning has become the central approach for language models (LMs) to learn from environmental reward or feedback. In practice, the environmental feedback is usually sparse and delayed. Learning from such signals is…

机器学习 · 计算机科学 2026-02-17 Taiwei Shi , Sihao Chen , Bowen Jiang , Linxin Song , Longqi Yang , Jieyu Zhao

We study the problem of episodic reinforcement learning in continuous state-action spaces with unknown rewards and transitions. Specifically, we consider the setting where the rewards and transitions are modeled using parametric bilinear…

机器学习 · 计算机科学 2022-10-06 Reda Ouhamma , Debabrota Basu , Odalric-Ambrym Maillard

Exploration in complex domains is a key challenge in reinforcement learning, especially for tasks with very sparse rewards. Recent successes in deep reinforcement learning have been achieved mostly using simple heuristic exploration…

机器学习 · 计算机科学 2017-03-07 Joshua Achiam , Shankar Sastry

We tackle a common scenario in imitation learning (IL), where agents try to recover the optimal policy from expert demonstrations without further access to the expert or environment reward signals. Except the simple Behavior Cloning (BC)…

机器学习 · 计算机科学 2021-04-16 Minghuan Liu , Tairan He , Minkai Xu , Weinan Zhang

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

Model-based reinforcement learning (MBRL) offers an intuitive way to increase the sample efficiency of model-free RL methods by simultaneously training a world model that learns to predict the future. These models constitute the large…

人工智能 · 计算机科学 2025-12-19 Ashish Sundar , Chunbo Luo , Xiaoyang Wang

In this work, we address the challenge of data-efficient exploration in reinforcement learning by examining existing principled, information-theoretic approaches to intrinsic motivation. Specifically, we focus on a class of exploration…

机器学习 · 计算机科学 2025-07-04 Alberto Caron , Chris Hicks , Vasilios Mavroudis

Current advancements in reinforcement learning (RL) have predominantly focused on learning step-based policies that generate actions for each perceived state. While these methods efficiently leverage step information from environmental…

机器学习 · 计算机科学 2024-01-23 Ge Li , Hongyi Zhou , Dominik Roth , Serge Thilges , Fabian Otto , Rudolf Lioutikov , Gerhard Neumann

One of the main challenges in reinforcement learning is solving tasks with sparse reward. We show that the difficulty of discovering a distant rewarding state in an MDP is bounded by the expected cover time of a random walk over the graph…

人工智能 · 计算机科学 2019-03-19 Yuu Jinnai , Jee Won Park , David Abel , George Konidaris