Reducing Exploitability with Population Based Training

Pavel Czempin, Adam Gleave
8/10/2022
cs.LGcs.AIcs.CR

No official code found. Best implementation: HumanCompatibleAI/reducing-exploitability (3 stars, MIT, last commit 2022-08-11).

Abstract

Self-play reinforcement learning has achieved state-of-the-art, and often superhuman, performance in a variety of zero-sum games. Yet prior work has found that policies that are highly capable against regular opponents can fail catastrophically against adversarial policies: an opponent trained explicitly against the victim. Prior defenses using adversarial training were able to make the victim robust to a specific adversary, but the victim remained vulnerable to new ones. We conjecture this limitation was due to insufficient diversity of adversaries seen during training. We analyze a defense using population based training to pit the victim against a diverse set of opponents. We evaluate this defense's robustness against new adversaries in two low-dimensional environments. This defense increases robustness against adversaries, as measured by the number of attacker training timesteps to exploit the victim. Furthermore, we show that robustness is correlated with the size of the opponent population.

View on arXivView PDF

Code Implementations(1)

MIT
31TeX, ShellAug 1, 20214 years agoMIT

Similar Papers

Cite this paper

@article{czempin2022reducing,
  title  = {Reducing Exploitability with Population Based Training},
  author = {Pavel Czempin and Adam Gleave},
  year   = {2022},
  eprint = {2208.05083},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2208.05083v3}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2208.05083.svg)](https://codeofpaper.com/paper/2208.05083)

Discussion