中文
相关论文

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

200 篇论文

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

Episodic count has been widely used to design a simple yet effective intrinsic motivation for reinforcement learning with a sparse reward. However, the use of episodic count in a high-dimensional state space as well as over a long episode…

机器学习 · 计算机科学 2022-10-12 Daejin Jo , Sungwoong Kim , Daniel Wontae Nam , Taehwan Kwon , Seungeun Rho , Jongmin Kim , Donghoon Lee

One of the bottlenecks preventing Deep Reinforcement Learning algorithms (DRL) from real-world applications is how to explore the environment and collect informative transitions efficiently. The present paper describes bounded exploration,…

机器学习 · 计算机科学 2024-12-10 Ting Qiao , Henry Williams , David Valencia , Bruce MacDonald

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

Contextual bandit problems are a natural fit for many information retrieval tasks, such as learning to rank, text classification, recommendation, etc. However, existing learning methods for contextual bandit problems have one of two…

信息检索 · 计算机科学 2020-02-06 Rolf Jagerman , Ilya Markov , Maarten de Rijke

Learning from diverse offline datasets is a promising path towards learning general purpose robotic agents. However, a core challenge in this paradigm lies in collecting large amounts of meaningful data, while not depending on a human in…

机器人学 · 计算机科学 2021-04-27 Annie S. Chen , HyunJi Nam , Suraj Nair , Chelsea Finn

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

Efficient exploration is critical for multiagent systems to discover coordinated strategies, particularly in open-ended domains such as search and rescue or planetary surveying. However, when exploration is encouraged only at the individual…

多智能体系统 · 计算机科学 2026-02-13 Ayhan Alp Aydeniz , Robert Loftin , Kagan Tumer

Uncertainty quantification has been extensively used as a means to achieve efficient directed exploration in Reinforcement Learning (RL). However, state-of-the-art methods for continuous actions still suffer from high sample complexity…

机器学习 · 计算机科学 2023-03-07 Amarildo Likmeta , Matteo Sacco , Alberto Maria Metelli , Marcello Restelli

Sparse reward environments pose significant challenges in reinforcement learning, especially within multi-agent systems (MAS) where feedback is delayed and shared across agents, leading to suboptimal learning. We propose Collaborative…

人工智能 · 计算机科学 2025-05-14 Yufei Lin , Chengwei Ye , Huanzhen Zhang , Kangsheng Wang , Linuo Xu , Shuyan Liu , Zeyu Zhang

Black-box textual adversarial attacks are challenging due to the lack of model information and the discrete, non-differentiable nature of text. Existing methods often lack versatility for attacking different models, suffer from limited…

计算与语言 · 计算机科学 2025-01-22 Mingze Ni , Yongshun Gong , Wei Liu

Robots in many real-world settings have access to force/torque sensors in their gripper and tactile sensing is often necessary in tasks that involve contact-rich motion. In this work, we leverage surprise from mismatches in touch feedback…

Exploration is one of the core challenges in reinforcement learning. A common formulation of curiosity-driven exploration uses the difference between the real future and the future predicted by a learned model. However, predicting the…

机器学习 · 计算机科学 2021-01-19 Victoria Dean , Shubham Tulsiani , Abhinav Gupta

Reinforcement learning agents need exploratory behaviors to escape from local optima. These behaviors may include both immediate dithering perturbation and temporally consistent exploration. To achieve these, a stochastic policy model that…

机器学习 · 计算机科学 2018-12-27 Sirui Xie , Junning Huang , Lanxin Lei , Chunxiao Liu , Zheng Ma , Wei Zhang , Liang Lin

Exploration remains a key challenge in deep reinforcement learning (RL). Optimism in the face of uncertainty is a well-known heuristic with theoretical guarantees in the tabular setting, but how best to translate the principle to deep…

机器学习 · 计算机科学 2023-06-06 Brendan O'Donoghue

We describe ACE0, a lightweight platform for evaluating the suitability and viability of AI methods for behaviour discovery in multiagent simulations. Specifically, ACE0 was designed to explore AI methods for multi-agent simulations used in…

多智能体系统 · 计算机科学 2021-08-31 Michael Papasimeon , Lyndon Benke

Adopting reasonable strategies is challenging but crucial for an intelligent agent with limited resources working in hazardous, unstructured, and dynamic environments to improve the system's utility, decrease the overall cost, and increase…

人工智能 · 计算机科学 2023-03-09 Qin Yang , Ramviyas Parasuraman

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

The human intrinsic desire to pursue knowledge, also known as curiosity, is considered essential in the process of skill acquisition. With the aid of artificial curiosity, we could equip current techniques for control, such as Reinforcement…

机器学习 · 计算机科学 2022-02-24 Pietro Mazzaglia , Ozan Catal , Tim Verbelen , Bart Dhoedt

One of the main problems of evolutionary algorithms is the convergence of the population to local minima. In this paper, we explore techniques that can avoid this problem by encouraging a diverse behavior of the agents through a shared…

神经与进化计算 · 计算机科学 2022-08-04 David Herel , Dominika Zogatova , Matej Kripner , Tomas Mikolov