中文
相关论文

相关论文: Conditionally Optimistic Exploration for Cooperati…

200 篇论文

Intrinsic rewards have been increasingly used to mitigate the sparse reward problem in single-agent reinforcement learning. These intrinsic rewards encourage the agent to look for novel experiences, guiding the agent to explore the…

人工智能 · 计算机科学 2022-11-01 Roben Delos Reyes , Kyunghwan Son , Jinhwan Jung , Wan Ju Kang , Yung Yi

Many reinforcement learning exploration techniques are overly optimistic and try to explore every state. Such exploration is impossible in environments with the unlimited number of states. I propose to use simulated exploration with an…

机器学习 · 计算机科学 2009-05-20 Ivo Danihelka

Value-based methods of multi-agent reinforcement learning (MARL), especially the value decomposition methods, have been demonstrated on a range of challenging cooperative tasks. However, current methods pay little attention to the…

机器学习 · 计算机科学 2021-02-12 Xiaoteng Ma , Yiqin Yang , Chenghao Li , Yiwen Lu , Qianchuan Zhao , Yang Jun

Learning complex robot behaviors through interaction requires structured exploration. Planning should target interactions with the potential to optimize long-term performance, while only reducing uncertainty where conducive to this…

机器学习 · 计算机科学 2021-12-14 Tim Seyde , Wilko Schwarting , Sertac Karaman , Daniela Rus

Policy optimization methods are popular reinforcement learning algorithms, because their incremental and on-policy nature makes them more stable than the value-based counterparts. However, the same properties also make them slow to converge…

机器学习 · 计算机科学 2021-07-01 Andrea Zanette , Ching-An Cheng , Alekh Agarwal

Multi-agent reinforcement learning (MARL) methods have achieved state-of-the-art results on a range of multi-agent tasks. Yet, MARL algorithms typically require significantly more environment interactions than their single-agent…

系统与控制 · 电气工程与系统科学 2026-03-17 Tom Danino , Nahum Shimkin

Large Language Models (LLMs) have become integral components in various autonomous agent systems. In this study, we present an exploration-based trajectory optimization approach, referred to as ETO. This learning method is designed to…

计算与语言 · 计算机科学 2024-07-11 Yifan Song , Da Yin , Xiang Yue , Jie Huang , Sujian Li , Bill Yuchen Lin

Existing approaches for improving generalization in deep reinforcement learning (RL) have mostly focused on representation learning, neglecting RL-specific aspects such as exploration. We hypothesize that the agent's exploration strategy…

机器学习 · 计算机科学 2023-06-12 Yiding Jiang , J. Zico Kolter , Roberta Raileanu

Exploration is fundamental to reinforcement learning (RL), as it determines how effectively an agent discovers and exploits the underlying structure of its environment to achieve optimal performance. Existing exploration methods generally…

人工智能 · 计算机科学 2025-10-30 Likun Wang , Xiangteng Zhang , Yinuo Wang , Guojian Zhan , Wenxuan Wang , Haoyu Gao , Jingliang Duan , Shengbo Eben Li

Efficient exploration is an unsolved problem in Reinforcement Learning which is usually addressed by reactively rewarding the agent for fortuitously encountering novel situations. This paper introduces an efficient active exploration…

机器学习 · 计算机科学 2019-06-17 Pranav Shyam , Wojciech Jaśkowski , Faustino Gomez

Neural Combinatorial Optimization (NCO) is an emerging domain where deep learning techniques are employed to address combinatorial optimization problems as a standalone solver. Despite their potential, existing NCO methods often suffer from…

神经与进化计算 · 计算机科学 2024-08-06 Andoni I. Garmendia , Quentin Cappart , Josu Ceberio , Alexander Mendiburu

Cooperative multi-agent reinforcement learning (MARL) aims to develop agents that can collaborate effectively. However, most cooperative MARL methods overfit training agents, making learned policies not generalize well to unseen…

人工智能 · 计算机科学 2025-01-13 Kanefumi Matsuyama , Kefan Su , Jiangxing Wang , Deheng Ye , Zongqing Lu

Numerous heuristics and advanced approaches have been proposed for exploration in different settings for deep reinforcement learning. Noise-based exploration generally fares well with dense-shaped rewards and bonus-based exploration with…

机器学习 · 计算机科学 2025-10-22 Sebastian Griesbach , Carlo D'Eramo

We study the problem of collective tree exploration (CTE) where a team of $k$ agents is tasked to traverse all the edges of an unknown tree as fast as possible, assuming complete communication between the agents. In this paper, we present…

数据结构与算法 · 计算机科学 2023-11-03 Romain Cosson , Laurent Massoulié

Designing protocols enhancing cooperation for multi-agent systems remains a grand challenge. Cheap talk, defined as costless, non-binding communication before formal action, serves as a pivotal solution. However, existing theoretical…

多智能体系统 · 计算机科学 2026-03-03 Zhao Song , Chen Shen , Zhen Wang , The Anh Han

Cooperation is fundamental in Multi-Agent Systems (MAS) and Multi-Agent Reinforcement Learning (MARL), often requiring agents to balance individual gains with collective rewards. In this regard, this paper aims to investigate strategies to…

计算机科学与博弈论 · 计算机科学 2024-05-06 Vaigarai Sathi , Sabahat Shaik , Jaswanth Nidamanuri

Multi-Agent Reinforcement Learning can lead to the development of collaborative agent behaviors that show similarities with organizational concepts. Pushing forward this perspective, we introduce a novel framework that explicitly…

人工智能 · 计算机科学 2025-04-01 Julien Soulé , Jean-Paul Jamont , Michel Occello , Louis-Marie Traonouez , Paul Théron

Optimistic initialisation is an effective strategy for efficient exploration in reinforcement learning (RL). In the tabular case, all provably efficient model-free algorithms rely on it. However, model-free deep RL algorithms do not use…

机器学习 · 计算机科学 2020-02-28 Tabish Rashid , Bei Peng , Wendelin Böhmer , Shimon Whiteson

The significant role of division of labor (DOL) in promoting cooperation is widely recognized in real-world applications.Many cooperative multi-agent reinforcement learning (MARL) methods have incorporated the concept of DOL to improve…

机器学习 · 计算机科学 2025-02-04 Yurui Li , Yuxuan Chen , Li Zhang , Shijian Li , Gang Pan

Despite the close connection between exploration and sample efficiency, most state of the art reinforcement learning algorithms include no considerations for exploration beyond maximizing the entropy of the policy. In this work we address…