activity
20062026
most citedLearning to Communicate with Deep Multi-Agent Reinforcement Learning

1.1k citations · 5k across the 117 of their papers we have counts for

collaborators
Showing 2020Show all

22 papers · 1 filter

cs.AI2020★ 185 cited

Is Independent Learning All You Need in the StarCraft Multi-Agent Challenge?

Christian Schroeder de Witt, Tarun Gupta, Denys Makoviichuk +4

Most recently developed approaches to cooperative multi-agent reinforcement learning in the \emph{centralized training with decentralized execution} setting involve estimating a ce…

cs.LG2020★ 62 cited

RODE: Learning Roles to Decompose Multi-Agent Tasks

Tonghan Wang, Tarun Gupta, Anuj Mahajan +3

Role-based learning holds the promise of achieving scalable multi-agent learning by decomposing complex tasks using roles. However, it is largely unclear how to efficiently discove…

cs.LG2020★ 7 cited

UneVEn: Universal Value Exploration for Multi-Agent Reinforcement Learning

Tarun Gupta, Anuj Mahajan, Bei Peng +2

VDN and QMIX are two popular value-based algorithms for cooperative MARL that learn a centralized action value function as a monotonic mixing of per-agent utilities. While this ena…

cs.LG2020★ 3 cited

My Body is a Cage: the Role of Morphology in Graph-Based Incompatible Control

Vitaly Kurin, Maximilian Igl, Tim Rocktäschel +2

Multitask Reinforcement Learning is a promising way to obtain models with better performance, generalisation, data efficiency, and robustness. Most existing work is limited to comp…

cs.LG2020★ 5 cited

A Deeper Look at Discounting Mismatch in Actor-Critic Algorithms

Shangtong Zhang, Romain Laroche, Harm van Seijen +2

We investigate the discounting mismatch in actor-critic algorithm implementations from a representation learning perspective. Theoretically, actor-critic algorithms usually have di…

cs.LG2020★ 3 cited

Exploration in Approximate Hyper-State Space for Meta Reinforcement Learning

Luisa Zintgraf, Leo Feng, Cong Lu +4

To rapidly learn a new task, it is often essential for agents to explore efficiently -- especially when performance matters from the first timestep. One way to learn such behaviour…

cs.CV2020★ 2 cited

Real-Time Resource Allocation for Tracking Systems

Yash Satsangi, Shimon Whiteson, Frans A. Oliehoek +1

Automated tracking is key to many computer vision applications. However, many tracking systems struggle to perform in real-time due to the high computational cost of detecting peop…

cs.AI2020★ 22 cited

Exploiting Submodular Value Functions For Scaling Up Active Perception

Yash Satsangi, Shimon Whiteson, Frans A. Oliehoek +1

In active perception tasks, an agent aims to select sensory actions that reduce its uncertainty about one or more hidden variables. While partially observable Markov decision proce…

cs.AI2020★ 10 cited

WordCraft: An Environment for Benchmarking Commonsense Agents

Minqi Jiang, Jelena Luketina, Nantas Nardelli +4

The ability to quickly solve a wide range of real-world tasks requires a commonsense understanding of the world. Yet, how to best extract such knowledge from natural language corpo…

cs.LG2020★ 3 cited

Learning Retrospective Knowledge with Reverse Reinforcement Learning

Shangtong Zhang, Vivek Veeriah, Shimon Whiteson

We present a Reverse Reinforcement Learning (Reverse RL) approach for representing retrospective knowledge. General Value Functions (GVFs) have enjoyed great success in representin…

cs.LG2020★ 37 cited

Weighted QMIX: Expanding Monotonic Value Function Factorisation for Deep Multi-Agent Reinforcement Learning

Tabish Rashid, Gregory Farquhar, Bei Peng +1

QMIX is a popular -learning algorithm for cooperative MARL in the centralised training and decentralised execution paradigm. In order to enable easy decentralisation, QMIX restr…

cs.LG2020★ 10 cited

Transient Non-Stationarity and Generalisation in Deep Reinforcement Learning

Maximilian Igl, Gregory Farquhar, Jelena Luketina +2

Non-stationarity can arise in Reinforcement Learning (RL) even in stationary environments. For example, most RL algorithms collect new data throughout training, using a non-station…

cs.LG2020★ 15 cited

Randomized Entity-wise Factorization for Multi-Agent Reinforcement Learning

Shariq Iqbal, Christian A. Schroeder de Witt, Bei Peng +3

Multi-agent settings in the real world often involve tasks with varying types and quantities of agents and non-agent entities; however, common patterns of behavior often emerge amo…

cs.LG2020★ 7 cited

Privileged Information Dropout in Reinforcement Learning

Pierre-Alexandre Kamienny, Kai Arulkumaran, Feryal Behbahani +2

Using privileged information during training can improve the sample efficiency and performance of machine learning systems. This paradigm has been applied to reinforcement learning…

cs.AI2020★ 4 cited

Maximizing Information Gain in Partially Observable Environments via Prediction Reward

Yash Satsangi, Sungsu Lim, Shimon Whiteson +2

Information gathering in a partially observable environment can be formulated as a reinforcement learning (RL), problem where the reward depends on the agent's uncertainty. For exa…

cs.LG2020★ 5 cited

Mean-Variance Policy Iteration for Risk-Averse Reinforcement Learning

Shangtong Zhang, Bo Liu, Shimon Whiteson

We present a mean-variance policy iteration (MVPI) framework for risk-averse control in a discounted infinite horizon MDP optimizing the variance of a per-step reward random variab…

cs.LG2020★ 428 cited

Monotonic Value Function Factorisation for Deep Multi-Agent Reinforcement Learning

Tabish Rashid, Mikayel Samvelyan, Christian Schroeder de Witt +3

In many real-world settings, a team of agents must coordinate its behaviour while acting in a decentralised fashion. At the same time, it is often possible to train the agents in a…

cs.LG2020★ 106 cited

FACMAC: Factored Multi-Agent Centralised Policy Gradients

Bei Peng, Tabish Rashid, Christian A. Schroeder de Witt +4

We propose FACtored Multi-Agent Centralised policy gradients (FACMAC), a new method for cooperative multi-agent reinforcement learning in both discrete and continuous action spaces…

cs.LG2020★ 13 cited

Optimistic Exploration even with a Pessimistic Initialisation

Tabish Rashid, Bei Peng, Wendelin Böhmer +1

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

cs.LG2020★ 4 cited

Reinforcement Learning Enhanced Quantum-inspired Algorithm for Combinatorial Optimization

Dmitrii Beloborodov, A. E. Ulanov, Jakob N. Foerster +2

Quantum hardware and quantum-inspired algorithms are becoming increasingly popular for combinatorial optimization. However, these algorithms may require careful hyperparameter tuni…

cs.HC2020★ 1 cited

Facial Feedback for Reinforcement Learning: A Case Study and Offline Analysis Using the TAMER Framework

Guangliang Li, Hamdi Dibeklioğlu, Shimon Whiteson +1

Interactive reinforcement learning provides a way for agents to learn to solve tasks from evaluative feedback provided by a human user. Previous research showed that humans give co…

cs.LG2020★ 11 cited

GradientDICE: Rethinking Generalized Offline Estimation of Stationary Values

Shangtong Zhang, Bo Liu, Shimon Whiteson

We present GradientDICE for estimating the density ratio between the state distribution of the target policy and the sampling distribution in off-policy reinforcement learning. Gra…