中文
相关论文

相关论文: R\'enyi State Entropy for Exploration Acceleration…

200 篇论文

Reinforcement learning (RL) is one of the three basic paradigms of machine learning. It has demonstrated impressive performance in many complex tasks like Go and StarCraft, which is increasingly involved in smart manufacturing and…

机器学习 · 计算机科学 2022-06-03 Mingqi Yuan

Exploration is essential for reinforcement learning (RL). To face the challenges of exploration, we consider a reward-free RL framework that completely separates exploration from exploitation and brings new challenges for exploration…

机器学习 · 计算机科学 2020-12-11 Chuheng Zhang , Yuanying Cai , Longbo Huang , Jian Li

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

Recent exploration methods have proven to be a recipe for improving sample-efficiency in deep reinforcement learning (RL). However, efficient exploration in high-dimensional observation spaces still remains a challenge. This paper presents…

机器学习 · 计算机科学 2021-06-22 Younggyo Seo , Lili Chen , Jinwoo Shin , Honglak Lee , Pieter Abbeel , Kimin Lee

A promising technique for exploration is to maximize the entropy of visited state distribution, i.e., state entropy, by encouraging uniform coverage of visited state space. While it has been effective for an unsupervised setup, it tends to…

机器学习 · 计算机科学 2024-08-12 Dongyoung Kim , Jinwoo Shin , Pieter Abbeel , Younggyo Seo

Maximum entropy reinforcement learning motivates agents to explore states and actions to maximize the entropy of some distribution, typically by providing additional intrinsic rewards proportional to that entropy function. In this paper, we…

机器学习 · 计算机科学 2026-03-20 Adrien Bolland , Gaspard Lambrechts , Damien Ernst

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

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

Exploration is critical for deep reinforcement learning in complex environments with high-dimensional observations and sparse rewards. To address this problem, recent approaches proposed to leverage intrinsic rewards to improve exploration,…

机器学习 · 计算机科学 2022-11-11 Mingqi Yuan , Bo Li , Xin Jin , Wenjun Zeng

Maximum entropy reinforcement learning integrates exploration into policy learning by providing additional intrinsic rewards proportional to the entropy of some distribution. In this paper, we propose a novel approach in which the intrinsic…

机器学习 · 计算机科学 2025-09-30 Adrien Bolland , Gaspard Lambrechts , Damien Ernst

One of the open challenges in Reinforcement Learning is the hard exploration problem in sparse reward environments. Various types of intrinsic rewards have been proposed to address this challenge by pushing towards diversity. This diversity…

人工智能 · 计算机科学 2025-01-22 Aya Kayal , Eduardo Pignatelli , Laura Toni

Balancing exploration and exploitation is a fundamental part of reinforcement learning, yet most state-of-the-art algorithms use a naive exploration protocol like $\epsilon$-greedy. This contributes to the problem of high sample complexity,…

机器学习 · 计算机科学 2019-11-21 Tom Blau , Lionel Ott , Fabio Ramos

Reinforcement Learning has emerged as a strong alternative to solve optimization tasks efficiently. The use of these algorithms highly depends on the feedback signals provided by the environment in charge of informing about how good (or…

机器学习 · 计算机科学 2022-12-01 Alain Andres , Esther Villar-Rodriguez , Javier Del Ser

Exploration is essential in reinforcement learning, particularly in environments where external rewards are sparse. Here we focus on exploration with intrinsic rewards, where the agent transiently augments the external rewards with…

机器学习 · 计算机科学 2024-01-26 Changmin Yu , Neil Burgess , Maneesh Sahani , Samuel J. Gershman

A major challenge in reinforcement learning is exploration, when local dithering methods such as epsilon-greedy sampling are insufficient to solve a given task. Many recent methods have proposed to intrinsically motivate an agent to seek…

机器学习 · 计算机科学 2021-01-15 Riley Simmons-Edler , Ben Eisner , Daniel Yang , Anthony Bisulco , Eric Mitchell , Sebastian Seung , Daniel Lee

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

Exploration of indoor environments has recently experienced a significant interest, also thanks to the introduction of deep neural agents built in a hierarchical fashion and trained with Deep Reinforcement Learning (DRL) on simulated…

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

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…

机器学习 · 计算机科学 2021-05-25 Shariq Iqbal , Fei Sha

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
‹ 上一页 1 2 3 10 下一页 ›