Learning with Opponent-Learning AwarenessConference: Proc. of the 17th International Conference on Autonomous Agents and Multiagent Systems (AAMAS 2018); July 10–15, 2018; Stockholm, SwedenThanks: †equal contribution, ‡Work done at OpenAI, correspondence: jakob.foerster@cs.ox.ac.uk
Jakob Foerster†,‡ Affiliation: University of Oxford , Richard Y. Chen† Affiliation: OpenAI , Maruan Al-Shedivat‡ Affiliation: Carnegie Mellon University , Shimon Whiteson Affiliation: Affiliation: University of Oxford , Pieter Abbeel‡ Affiliation: Affiliation: UC Berkeley and Igor Mordatch Affiliation: Affiliation: OpenAI
Abstract
Multi-agent settings are quickly gathering importance in machine learning. This includes a plethora of recent work on deep multi-agent reinforcement learning, but also can be extended to hierarchical reinforcement learning, generative adversarial networks and decentralised optimization. In all these settings the presence of multiple learning agents renders the training problem non-stationary and often leads to unstable training or undesired final results. We present Learning with Opponent-Learning Awareness (LOLA), a method in which each agent shapes the anticipated learning of the other agents in the environment. The LOLA learning rule includes an additional term that accounts for the impact of one agent’s policy on the anticipated parameter update of the other agents. Preliminary results show that the encounter of two LOLA agents leads to the emergence of tit-for-tat and therefore cooperation in the iterated prisoners’ dilemma (IPD), while independent learning does not. In this domain, LOLA also receives higher payouts compared to a naive learner, and is robust against exploitation by higher order gradient-based methods. Applied to infinitely repeated matching pennies, LOLA agent
原文 arXiv:1709.04326;中英对照 + 大白话阅读 https://aha.fim.ai/paper/1709.04326v4