中文
相关论文

相关论文: KEA: Keeping Exploration Alive by Proactively Coor…

200 篇论文

Model-free deep reinforcement learning (RL) algorithms have been successfully applied to a range of challenging sequential decision making and control tasks. However, these methods typically suffer from two major challenges: high sample…

We propose a new policy iteration theory as an important extension of soft policy iteration and Soft Actor-Critic (SAC), one of the most efficient model free algorithms for deep reinforcement learning. Supported by the new theory, arbitrary…

机器学习 · 计算机科学 2019-02-18 Gang Chen , Yiming Peng

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

Exploration in sparse reward reinforcement learning remains an open challenge. Many state-of-the-art methods use intrinsic motivation to complement the sparse extrinsic reward signal, giving the agent more opportunities to receive feedback…

机器学习 · 计算机科学 2019-06-24 Jingwei Zhang , Niklas Wetzel , Nicolai Dorka , Joschka Boedecker , Wolfram Burgard

In recent years Landmark Complexes have been successfully employed for localization-free and metric-free autonomous exploration using a group of sensing-limited and communication-limited robots in a GPS-denied environment. To ensure rapid…

机器人学 · 计算机科学 2022-09-27 Xiatao Sun , Yuwei Wu , Subhrajit Bhattacharya , Vijay Kumar

Deep learning has achieved remarkable successes in solving challenging reinforcement learning (RL) problems when dense reward function is provided. However, in sparse reward environment it still often suffers from the need to carefully…

机器学习 · 计算机科学 2019-02-19 Hao Liu , Alexander Trott , Richard Socher , Caiming Xiong

We propose Scheduled Auxiliary Control (SAC-X), a new learning paradigm in the context of Reinforcement Learning (RL). SAC-X enables learning of complex behaviors - from scratch - in the presence of multiple sparse reward signals. To this…

Efficient exploration is critical in cooperative deep Multi-Agent Reinforcement Learning (MARL). In this work, we propose an exploration method that effectively encourages cooperative exploration based on the idea of sequential…

机器学习 · 计算机科学 2023-07-17 Xutong Zhao , Yangchen Pan , Chenjun Xiao , Sarath Chandar , Janarthanan Rajendran

Deep Reinforcement Learning (DRL) algorithms for continuous action spaces are known to be brittle toward hyperparameters as well as \cut{being}sample inefficient. Soft Actor Critic (SAC) proposes an off-policy deep actor critic algorithm…

机器学习 · 计算机科学 2019-06-10 Patrick Nadeem Ward , Ariella Smofsky , Avishek Joey Bose

Autonomous experiments (AEs) are transforming how scientific research is conducted by integrating artificial intelligence with automated experimental platforms. Current AEs primarily focus on the optimization of a predefined target; while…

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

The performance of deep reinforcement learning methods prone to degenerate when applied to environments with non-stationary dynamics. In this paper, we utilize the latent context recurrent encoders motivated by recent Meta-RL materials, and…

机器学习 · 计算机科学 2021-05-11 Yuan Pu , Shaochen Wang , Xin Yao , Bin Li

Evolutionary Computation (EC) has been shown to be able to quickly train Deep Artificial Neural Networks (DNNs) to solve Reinforcement Learning (RL) problems. While a Genetic Algorithm (GA) is well-suited for exploiting reward functions…

神经与进化计算 · 计算机科学 2022-09-09 Eyal Segal , Moshe Sipper

With expansive state-action spaces, efficient multi-agent exploration remains a longstanding challenge in reinforcement learning. Although pursuing novelty, diversity, or uncertainty attracts increasing attention, redundant efforts brought…

人工智能 · 计算机科学 2024-10-04 Yun Qu , Boyuan Wang , Yuhang Jiang , Jianzhun Shao , Yixiu Mao , Cheems Wang , Chang Liu , Xiangyang Ji

The {\it straight-through estimator} (STE) is commonly used to optimize quantized neural networks, yet its contexts of effective performance are still unclear despite empirical successes.To make a step forward in this comprehension, we…

机器学习 · 计算机科学 2024-06-26 Mimoun Mohamed , François Malgouyres , Valentin Emiya , Caroline Chaux

Reinforcement learning can solve decision-making problems and train an agent to behave in an environment according to a predesigned reward function. However, such an approach becomes very problematic if the reward is too sparse and so the…

人工智能 · 计算机科学 2024-06-12 Matej Pecháč , Michal Chovanec , Igor Farkaš

Efficient exploration in deep cooperative multi-agent reinforcement learning (MARL) still remains challenging in complex coordination problems. In this paper, we introduce a novel Episodic Multi-agent reinforcement learning with…

机器学习 · 计算机科学 2021-11-23 Lulu Zheng , Jiarui Chen , Jianhao Wang , Jiamin He , Yujing Hu , Yingfeng Chen , Changjie Fan , Yang Gao , Chongjie Zhang

While Soft Actor-Critic (SAC) is highly effective in continuous control, its discrete counterpart (DSAC) performs poorly on challenging discrete-action domains such as Atari. Consequently, starting from DSAC, we revisit the design of…

机器学习 · 计算机科学 2026-05-13 Reza Asad , Reza Babanezhad , Sharan Vaswani

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

This paper proposes the Cooperative Soft Actor Critic (CSAC) method of enabling consecutive reinforcement learning agents to cooperatively solve a long time horizon multi-stage task. This method is achieved by modifying the policy of each…

机器学习 · 计算机科学 2020-07-02 Jordan Erskine , Chris Lehnert