TL;DR
This paper enhances adversarial quality diversity algorithms by introducing tournament-informed task selection, improving the quality and diversity of solutions in adversarial environments.
Contribution
It proposes two tournament-informed task selection methods and a set comparison approach, advancing the effectiveness of adversarial quality diversity algorithms.
Findings
Tournament-informed task selection improves quality and diversity.
Set comparison using inter-variants tournament ensures fair evaluation.
Methods tested on Pong, Cat-and-mouse, and Pursuers-and-evaders games.
Abstract
Quality diversity (QD) is a branch of evolutionary computation that seeks high-quality and behaviorally diverse solutions to a problem. While adversarial problems are common, classical QD cannot be easily applied to them, as both the fitness and the behavior depend on the opposing solutions. Recently, Generational Adversarial MAP-Elites (GAME) has been proposed to coevolve both sides of an adversarial problem by alternating the execution of a multi-task QD algorithm against previous elites, called tasks. The original algorithm selects new tasks based on a behavioral criterion, which may lead to undesired dynamics due to inter-side dependencies. In addition, comparing sets of solutions cannot be done directly using classical QD measures due to side dependencies. In this paper, we (1) use an inter-variants tournament to compare the sets of solutions, ensuring a fair comparison, with 6…
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
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsArtificial Intelligence in Games · Generative Adversarial Networks and Image Synthesis · Adversarial Robustness in Machine Learning
