Safe adaptation in multiagent competition
Not on the map. Why?
Abstract (arXiv)
Achieving the capability of adapting to ever-changing environments is a critical step towards building fully autonomous robots that operate safely in complicated scenarios. In multiagent competitive scenarios, agents may have to adapt to new opponents with previously unseen behaviors by learning from the interaction experiences between the ego-agent and the opponent. However, this adaptation is susceptible to opponent exploitation. As the ego-agent updates its own behavior to exploit the opponent, its own behavior could become more exploitable as a result of overfitting to this specific opponent's behavior. To overcome this difficulty, we developed a safe adaptation approach in which the ego-agent is trained against a regularized opponent model, which effectively avoids overfitting and consequently improves the robustness of the ego-agent's policy. We evaluated our approach in the Mujoco domain with two competing agents. The experiment results suggest that our approach effectively achieves both adaptation to the specific opponent that the ego-agent is interacting with and maintaining low exploitability to other possible opponent exploitation.
Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Builds on 28 of its 40 references that are in the map. First posted on arXiv 14 Mar 2022.
Builds on
28 of 40 references.
References · 28
- 2017Proximal Policy Optimization Algorithmscited by 14,441
- 2022Generative Adversarial Networkscited by 5,603
- 2017Model-Agnostic Meta-Learning for Fast Adaptation of Deep Networkscited by 4,861
- 2018Soft Actor-Critic: Off-Policy Maximum Entropy Deep Reinforcement Learning with a Stochastic Actorcited by 4,635
- 2016Generative Adversarial Imitation Learningcited by 1,576
- 2017Multi-Agent Actor-Critic for Mixed Cooperative-Competitive Environmentscited by 1,519
- 2016RL2: Fast Reinforcement Learning via Slow Reinforcement Learningcited by 490
- 2018Learning to Adapt in Dynamic, Real-World Environments Through Meta-Reinforcement Learningcited by 270
- 2020Towards Continual Reinforcement Learning: A Review and Perspectivescited by 268
- 2017A Unified Game-Theoretic Approach to Multiagent Reinforcement Learningcited by 265
- 2018Human-level performance in first-person multiplayer games with population-based deep reinforcement learningcited by 260
- 2017Learning with Opponent-Learning Awarenesscited by 218
16 more
- 2019Adversarial Policies: Attacking Deep Reinforcement Learningcited by 209
- 2020FACMAC: Factored Multi-Agent Centralised Policy Gradientscited by 178
- 2017Emergent Complexity via Multi-Agent Competitioncited by 117
- 2017Continuous Adaptation via Meta-Learning in Nonstationary and Competitive Environmentscited by 106
- 2016Opponent Modeling in Deep Reinforcement Learningcited by 94
- 2018Deep Online Learning via Meta-Learning: Continual Adaptation for Model-Based RLcited by 80
- 2020Real World Games Look Like Spinning Topscited by 66
- 2018Modeling Others using Oneself in Multi-Agent Reinforcement Learningcited by 64
- 2020Robust Reinforcement Learning using Adversarial Populationscited by 64
- 2018Learning Policy Representations in Multiagent Systemscited by 48
- 2020A Policy Gradient Algorithm for Learning to Learn in Multiagent Reinforcement Learningcited by 40
- 2017Safe and Nested Subgame Solving for Imperfect-Information Gamescited by 39
- 2021Generalized Proximal Policy Optimization with Sample Reusecited by 39
- 2019Diversity-Inducing Policy Gradient: Using Maximum Mean Discrepancy to Find a Set of Diverse Policiescited by 34
- 2020Variational Autoencoders for Opponent Modeling in Multi-Agent Systemscited by 18
- 2019Policy Search by Target Distribution Learning for Continuous Controlcited by 3
Built on by
Citing papers per year: 2025: 1.
1 paper.