Proximal Learning With Opponent-Learning Awareness
Stephen Zhao, Chris Lu, Roger Baker Grosse, Jakob Nicolaus Foerster

TL;DR
This paper introduces proximal LOLA (POLA), a new multi-agent reinforcement learning algorithm that improves upon LOLA by being parameterization invariant, leading to more reliable reciprocity-based cooperation in complex environments.
Contribution
The paper reinterprets LOLA as a proximal operator and develops POLA, a parameterization-invariant algorithm that enhances cooperation in multi-agent settings.
Findings
POLA achieves more reliable reciprocity-based cooperation than LOLA.
POLA's updates are parameterization invariant, ensuring behaviorally equivalent policies lead to similar updates.
Empirical results show POLA outperforms LOLA in complex partially competitive environments.
Abstract
Learning With Opponent-Learning Awareness (LOLA) (Foerster et al. [2018a]) is a multi-agent reinforcement learning algorithm that typically learns reciprocity-based cooperation in partially competitive environments. However, LOLA often fails to learn such behaviour on more complex policy spaces parameterized by neural networks, partly because the update rule is sensitive to the policy parameterization. This problem is especially pronounced in the opponent modeling setting, where the opponent's policy is unknown and must be inferred from observations; in such settings, LOLA is ill-specified because behaviorally equivalent opponent policies can result in non-equivalent updates. To address this shortcoming, we reinterpret LOLA as approximating a proximal operator, and then derive a new algorithm, proximal LOLA (POLA), which uses the proximal formulation directly. Unlike LOLA, the POLA…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
Taxonomy
TopicsReinforcement Learning in Robotics
