Safe adaptation in multiagent competition
Macheng Shen, Jonathan P. How

TL;DR
This paper introduces a safe adaptation method for multiagent competition that trains ego-agents against regularized opponent models, enhancing robustness and reducing exploitability in dynamic environments.
Contribution
The paper proposes a novel safe adaptation approach using regularized opponent models to prevent overfitting and improve robustness in multiagent competitive scenarios.
Findings
Effective adaptation to specific opponents
Maintains low exploitability to other opponents
Improves robustness of ego-agent policies
Abstract
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…
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.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsReinforcement Learning in Robotics · Artificial Intelligence in Games · Evolutionary Game Theory and Cooperation
