Lenient Multi-Agent Deep Reinforcement Learning

2017-07-14 · Gregory Palmer, Karl Tuyls, Daan Bloembergen, Rahul Savani

Much of the success of single agent deep reinforcement learning (DRL) in recent years can be attributed to the use of experience replay memories (ERM), which allow Deep Q-Networks (DQNs) to be trained efficiently through sampling stored state transitions. However, care is required when using ERMs for multi-agent deep reinforcement learning (MA-DRL), as stored transitions can become outdated because agents update their policies in parallel [11]. In this work we apply leniency [23] to MA-DRL. Lenient agents map state-action pairs to decaying temperature values that control the amount of leniency applied towards negative policy updates that are sampled from the ERM. This introduces optimism in the value-function update, and has been shown to facilitate cooperation in tabular fully-cooperative multi-agent reinforcement learning problems. We evaluate our Lenient-DQN (LDQN) empirically against the related Hysteretic-DQN (HDQN) algorithm [22] as well as a modified version we call scheduled-HDQN, that uses average reward learning near terminal states. Evaluations take place in extended variations of the Coordinated Multi-Agent Object Transportation Problem (CMOTP) [8] which include fully-cooperative sub-tasks and stochastic rewards. We find that LDQN agents are more likely to converge to the optimal policy in a stochastic reward CMOTP compared to standard and scheduled-HDQN agents.

📄 PDF Abstract BibTeX arXiv:1707.04402

Code (1)

gjp1203/nui_in_madrl

Tasks

Deep Reinforcement LearningMulti-agent Reinforcement Learning reinforcement-learning Reinforcement Learning Reinforcement Learning (RL)

Methods 이 논문이 사용한 방법론

Experience Replay Experience Replay is a replay memory technique used in reinforcement learning where we store the agent’s experiences at each time-step, $e\_{t} = \left(s\_{t}, a\_{t}, r\_{t},…

Weighted Double Deep Multiagent Reinforcement Learning in Stochastic Cooperative Environments

2018-02-23 · Yan Zheng, Jianye Hao, Zongzhang Zhang

Recently, multiagent deep reinforcement learning (DRL) has received increasingly wide attention. Existing multiagent DRL algorithms are inefficient when facing with the non-stationarity due to agents update their policie…

Deep Reinforcement Learning Q-Learning reinforcement-learning Reinforcement Learning+1

Independent Reinforcement Learning for Weakly Cooperative Multiagent Traffic Control Problem

2021-04-22 · Chengwei Zhang, Shan Jin, Wanli Xue, Xiaofei Xie 외

The adaptive traffic signal control (ATSC) problem can be modeled as a multiagent cooperative game among urban intersections, where intersections cooperate to optimize their common goal. Recently, reinforcement learning …

Decision Making reinforcement-learning Reinforcement Learning Reinforcement Learning (RL)+2

Lenient Regret for Multi-Armed Bandits

2020-08-10 · Nadav Merlis, Shie Mannor

We consider the Multi-Armed Bandit (MAB) problem, where an agent sequentially chooses actions and observes rewards for the actions it took. While the majority of algorithms try to minimize the regret, i.e., the cumulativ…

Multi-Armed Bandits Thompson Sampling

Grading the Grader: Lessons from Evaluating an Agentic Data Analysis System

2026-06-23 · Tian Zheng, Kai-Tai Hsu arxiv

Agentic data analysis systems produce rich outputs, including code, numerical results, and verbal diagnostics. This makes them more challenging to evaluate than single-turn LLM responses. It is therefore necessary to dis…

Negative Update Intervals in Deep Multi-Agent Reinforcement Learning

2018-09-13 · Gregory Palmer, Rahul Savani, Karl Tuyls

In Multi-Agent Reinforcement Learning (MA-RL), independent cooperative learners must overcome a number of pathologies to learn optimal joint policies. Addressing one pathology often leaves approaches vulnerable towards o…

Multi-agent Reinforcement Learning Q-Learning reinforcement-learning Reinforcement Learning+1