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

1.1k citations · 3k across the 23 of their papers we have counts for

collaborators
Showing 2019Show all

11 papers · 1 filter

cs.AI2019

Improving Policies via Search in Cooperative Partially Observable Games

Adam Lerer, Hengyuan Hu, Jakob Foerster +1

Recent superhuman results in games have largely been achieved in a variety of zero-sum settings, such as Go and Poker, in which agents need to compete against others. However, just…

cs.AI2019★ 44 cited

Simplified Action Decoder for Deep Multi-Agent Reinforcement Learning

Hengyuan Hu, Jakob N Foerster

In recent years we have seen fast progress on a number of benchmark problems in AI, with modern methods achieving near or super human performance in Go, Poker and Dota. One common…

cs.CL2019

Capacity, Bandwidth, and Compositionality in Emergent Language Learning

Cinjon Resnick, Abhinav Gupta, Jakob Foerster +2

Many recent works have discussed the propensity, or lack thereof, for emergent languages to exhibit properties of natural languages. A favorite in the literature is learning compos…

cs.CL2019★ 36 cited

Can I Trust the Explainer? Verifying Post-hoc Explanatory Methods

Oana-Maria Camburu, Eleonora Giunchiglia, Jakob Foerster +2

For AI systems to garner widespread public acceptance, we must develop methods capable of explaining the decisions of black-box models such as neural networks. In this work, we ide…

cs.LG2019★ 4 cited

Loaded DiCE: Trading off Bias and Variance in Any-Order Score Function Estimators for Reinforcement Learning

Gregory Farquhar, Shimon Whiteson, Jakob Foerster

Gradient-based methods for optimisation of objectives in stochastic settings with unknown or intractable dynamics require estimators of derivatives. We derive an objective that, un…

cs.LG2019★ 21 cited

Exploratory Combinatorial Optimization with Reinforcement Learning

Thomas D. Barrett, William R. Clements, Jakob N. Foerster +1

Many real-world problems can be reduced to combinatorial optimization on a graph, where the subset or ordering of vertices that maximize some objective function must be found. With…

cs.LG2019

A Survey of Reinforcement Learning Informed by Natural Language

Jelena Luketina, Nantas Nardelli, Gregory Farquhar +5

To be successful in real-world tasks, Reinforcement Learning (RL) needs to exploit the compositional, relational, and hierarchical structure of the world, and learn to transfer it…

cs.LG2019★ 32 cited

Differentiable Game Mechanics

Alistair Letcher, David Balduzzi, Sebastien Racaniere +4

Deep learning is built on the foundational guarantee that gradient descent on an objective function converges to local minima. Unfortunately, this guarantee fails in settings, such…

cs.LG2019

On the Pitfalls of Measuring Emergent Communication

Ryan Lowe, Jakob Foerster, Y-Lan Boureau +2

How do we know if communication is emerging in a multi-agent system? The vast majority of recent papers on emergent communication show that adding a communication channel leads to…

cs.LG2019

The StarCraft Multi-Agent Challenge

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

In the last few years, deep multi-agent reinforcement learning (RL) has become a highly active area of research. A particularly challenging class of problems in this area is partia…

cs.LG2019★ 236 cited

The Hanabi Challenge: A New Frontier for AI Research

Nolan Bard, Jakob N. Foerster, Sarath Chandar +12

From the early days of computing, games have been important testbeds for studying how well machines can do sophisticated decision making. In recent years, machine learning has made…