中文
相关论文

相关论文: GAN-based Intrinsic Exploration For Sample Efficie…

200 篇论文

We present an adversarial active exploration for inverse dynamics model learning, a simple yet effective learning scheme that incentivizes exploration in an environment without any human intervention. Our framework consists of a deep…

机器学习 · 计算机科学 2020-03-18 Zhang-Wei Hong , Tsu-Jui Fu , Tzu-Yun Shann , Yi-Hsiang Chang , Chun-Yi Lee

A grand challenge in reinforcement learning is intelligent exploration, especially when rewards are sparse or deceptive. Two Atari games serve as benchmarks for such hard-exploration domains: Montezuma's Revenge and Pitfall. On both games,…

机器学习 · 计算机科学 2021-03-02 Adrien Ecoffet , Joost Huizinga , Joel Lehman , Kenneth O. Stanley , Jeff Clune

We present a new approach for efficient exploration which leverages a low-dimensional encoding of the environment learned with a combination of model-based and model-free objectives. Our approach uses intrinsic rewards that are based on the…

机器学习 · 计算机科学 2022-04-18 Ruo Yu Tao , Vincent François-Lavet , Joelle Pineau

Reward design is a critical part of the application of reinforcement learning, the performance of which strongly depends on how well the reward signal frames the goal of the designer and how well the signal assesses progress in reaching…

机器学习 · 计算机科学 2022-08-01 Yixiang Wang , Yujing Hu , Feng Wu , Yingfeng Chen

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…

人工智能 · 计算机科学 2016-12-04 Sai Praveen Bangaru , JS Suhas , Balaraman Ravindran

Exploration in environments with sparse rewards has been a persistent problem in reinforcement learning (RL). Many tasks are natural to specify with a sparse reward, and manually shaping a reward function can result in suboptimal…

机器学习 · 计算机科学 2018-02-27 Ashvin Nair , Bob McGrew , Marcin Andrychowicz , Wojciech Zaremba , Pieter Abbeel

Achieving efficient and scalable exploration in complex domains poses a major challenge in reinforcement learning. While Bayesian and PAC-MDP approaches to the exploration problem offer strong formal guarantees, they are often impractical…

人工智能 · 计算机科学 2015-11-23 Bradly C. Stadie , Sergey Levine , Pieter Abbeel

Episodic rewards present a significant challenge in reinforcement learning. While intrinsic reward methods have demonstrated effectiveness in single-agent rein-forcement learning scenarios, their application to multi-agent reinforcement…

人工智能 · 计算机科学 2025-11-24 Kesheng Chen , Wenjian Luo , Bang Zhang , Zeping Yin , Zipeng Ye

Efficient exploration is important for reinforcement learners to achieve high rewards. In multi-agent systems, coordinated exploration and behaviour is critical for agents to jointly achieve optimal outcomes. In this paper, we introduce a…

Intrinsic motivation enables reinforcement learning (RL) agents to explore when rewards are very sparse, where traditional exploration heuristics such as Boltzmann or e-greedy would typically fail. However, intrinsic exploration is…

机器学习 · 计算机科学 2020-04-07 Philippe Morere , Fabio Ramos

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…

机器学习 · 计算机科学 2019-06-14 Hyoungseok Kim , Jaekyeom Kim , Yeonwoo Jeong , Sergey Levine , Hyun Oh Song

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

Autonomous navigation in crowded environments is an open problem with many applications, essential for the coexistence of robots and humans in the smart cities of the future. In recent years, deep reinforcement learning approaches have…

机器人学 · 计算机科学 2025-03-25 Diego Martinez-Baselga , Luis Riazuelo , Luis Montano

Exploration is widely regarded as one of the most challenging aspects of reinforcement learning (RL), with many naive approaches succumbing to exponential sample complexity. To isolate the challenges of exploration, we propose a new…

机器学习 · 计算机科学 2020-02-10 Chi Jin , Akshay Krishnamurthy , Max Simchowitz , Tiancheng Yu

High sample complexity remains a barrier to the application of reinforcement learning (RL), particularly in multi-agent systems. A large body of work has demonstrated that exploration mechanisms based on the principle of optimism under…

机器学习 · 计算机科学 2021-08-02 Robert Loftin , Aadirupa Saha , Sam Devlin , Katja Hofmann

Motivated by the prevailing paradigm of using unsupervised learning for efficient exploration in reinforcement learning (RL) problems [tang2017exploration,bellemare2016unifying], we investigate when this paradigm is provably efficient. We…

机器学习 · 计算机科学 2020-12-02 Fei Feng , Ruosong Wang , Wotao Yin , Simon S. Du , Lin F. Yang

Hierarchical Reinforcement Learning (HRL) exploits temporally extended actions, or options, to make decisions from a higher-dimensional perspective to alleviate the sparse reward problem, one of the most challenging problems in…

机器学习 · 计算机科学 2019-05-15 Libo Xing

Exploration is a fundamental aspect of reinforcement learning (RL), and its effectiveness is a deciding factor in the performance of RL algorithms, especially when facing sparse extrinsic rewards. Recent studies have shown the effectiveness…

机器学习 · 计算机科学 2023-05-19 Shanchuan Wan , Yujin Tang , Yingtao Tian , Tomoyuki Kaneko

Bugs in popular distributed protocol implementations have been the source of many downtimes in popular internet services. We describe a randomized testing approach for distributed protocol implementations based on reinforcement learning.…

软件工程 · 计算机科学 2024-09-05 Andrea Borgarelli , Constantin Enea , Rupak Majumdar , Srinidhi Nagendra

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…