中文
相关论文

相关论文: Never Explore Repeatedly in Multi-Agent Reinforcem…

200 篇论文

Effective exploration in reinforcement learning requires not only tracking where an agent has been, but also understanding how the agent perceives and represents the world. To learn powerful representations, an agent should actively explore…

机器学习 · 计算机科学 2026-04-21 Faisal Mohamed , Catherine Ji , Benjamin Eysenbach , Glen Berseth

Exploration in environments with sparse feedback remains a challenging research problem in reinforcement learning (RL). When the RL agent explores the environment randomly, it results in low exploration efficiency, especially in robotic…

机器人学 · 计算机科学 2020-11-19 Boyao Li , Tao Lu , Jiayi Li , Ning Lu , Yinghao Cai , Shuo Wang

Designing effective reward functions remains a central challenge in reinforcement learning, especially in multi-objective environments. In this work, we propose Multi-Objective Reward Shaping with Exploration (MORSE), a general framework…

机器学习 · 计算机科学 2025-12-18 Yuqing Xie , Jiayu Chen , Wenhao Tang , Ya Zhang , Chao Yu , Yu Wang

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

Reinforcement learning (RL) with sparse and deceptive rewards is challenging because non-zero rewards are rarely obtained. Hence, the gradient calculated by the agent can be stochastic and without valid information. Recent studies that…

机器学习 · 计算机科学 2024-02-08 Guojian Wang , Faguo Wu , Xiao Zhang , Jianxiang Liu

We study incentivized exploration for the multi-armed bandit (MAB) problem with non-stationary reward distributions, where players receive compensation for exploring arms other than the greedy choice and may provide biased feedback on the…

机器学习 · 计算机科学 2024-03-19 Sourav Chakraborty , Lijun Chen

This work re-examines the commonly held assumption that the frequency of rewards is a reliable measure of task difficulty in reinforcement learning. We identify and formalize a structural challenge that undermines the effectiveness of…

机器学习 · 计算机科学 2025-07-03 Yannick Molinghen , Tom Lenaerts

This paper studies reward-agnostic exploration in reinforcement learning (RL) -- a scenario where the learner is unware of the reward functions during the exploration stage -- and designs an algorithm that improves over the state of the…

机器学习 · 计算机科学 2024-05-24 Gen Li , Yuling Yan , Yuxin Chen , Jianqing Fan

Reinforcement learning usually uses the feedback rewards of environmental to train agents. But the rewards in the actual environment are sparse, and even some environments will not rewards. Most of the current methods are difficult to get…

机器学习 · 计算机科学 2020-01-13 Kai Jiang , XiaoLong Qin

A default assumption in the design of reinforcement-learning algorithms is that a decision-making agent always explores to learn optimal behavior. In sufficiently complex environments that approach the vastness and scale of the real world,…

机器学习 · 计算机科学 2024-07-23 Dilip Arumugam , Saurabh Kumar , Ramki Gummadi , Benjamin Van Roy

The main challenge of multiagent reinforcement learning is the difficulty of learning useful policies in the presence of other simultaneously learning agents whose changing behaviors jointly affect the environment's transition and reward…

One of the challenges in applying reinforcement learning in a complex real-world environment lies in providing the agent with a sufficiently detailed reward function. Any misalignment between the reward and the desired behavior can result…

机器学习 · 计算机科学 2025-10-24 Neta Glazer , Aviv Navon , Aviv Shamsian , Ethan Fetaya

Discovering successful coordinated behaviors is a central challenge in Multi-Agent Reinforcement Learning (MARL) since it requires exploring a joint action space that grows exponentially with the number of agents. In this paper, we propose…

机器学习 · 计算机科学 2021-10-14 Ammar Fayad , Majd Ibrahim

Deep reinforcement learning methods exhibit impressive performance on a range of tasks but still struggle on hard exploration tasks in large environments with sparse rewards. To address this, intrinsic rewards can be generated using forward…

人工智能 · 计算机科学 2023-10-27 Jaedong Hwang , Zhang-Wei Hong , Eric Chen , Akhilan Boopathy , Pulkit Agrawal , Ila Fiete

Unambiguous identification of the rewards driving behaviours of entities operating in complex open-ended real-world environments is difficult, partly because goals and associated behaviours emerge endogenously and are dynamically updated as…

机器学习 · 计算机科学 2024-05-03 Richard M. Bailey

The promise of reinforcement learning is to solve complex sequential decision problems autonomously by specifying a high-level reward function only. However, reinforcement learning algorithms struggle when, as is often the case, simple and…

人工智能 · 计算机科学 2021-09-17 Adrien Ecoffet , Joost Huizinga , Joel Lehman , Kenneth O. Stanley , Jeff Clune

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

Deep reinforcement learning in partially observable environments is a difficult task in itself, and can be further complicated by a sparse reward signal. Most tasks involving navigation in three-dimensional environments provide the agent…

机器学习 · 计算机科学 2023-10-17 Matvey Gerasyov , Ilya Makarov

We study the policy evaluation problem in an online multi-reward multi-policy discounted setting, where multiple reward functions must be evaluated simultaneously for different policies. We adopt an $(\epsilon,\delta)$-PAC perspective to…

机器学习 · 计算机科学 2025-08-19 Alessio Russo , Aldo Pacchiano

In online reinforcement learning (RL), efficient exploration remains particularly challenging in high-dimensional environments with sparse rewards. In low-dimensional environments, where tabular parameterization is possible, count-based…

机器学习 · 计算机科学 2021-06-21 Tianjun Zhang , Paria Rashidinejad , Jiantao Jiao , Yuandong Tian , Joseph Gonzalez , Stuart Russell