10h ago

New GAME Algorithm Illuminates Both Sides Of Adversarial Problems

0
Original post

We're excited to announce GAME: Adversarial Coevolutionary Illumination with Generational Adversarial MAP-Elites ⚔️ Game is a new coevolutionary QD algorithm that illuminates both sides of an adversarial problem by alternating the evolution of solutions on one side that maximize the adversarial fitness against fixed opponents from the other side. If you have any tasks requiring adversarial training, check it out! Blog: https://game-approach.github.io/ Paper: https://arxiv.org/pdf/2505.06617v3

2:00 AM · May 20, 2026 View on X

We applied it to a variety of tasks, such as Parabellum, our battle game research environment. This video shows 2D PCA of the VEM behavior space after running GAME in Parabellum for 2M evaluations over 20 generations.

Sebastian RisiSebastian Risi@risi1979

We're excited to announce GAME: Adversarial Coevolutionary Illumination with Generational Adversarial MAP-Elites ⚔️ Game is a new coevolutionary QD algorithm that illuminates both sides of an adversarial problem by alternating the evolution of solutions on one side that maximize the adversarial fitness against fixed opponents from the other side. If you have any tasks requiring adversarial training, check it out! Blog: https://game-approach.github.io/ Paper: https://arxiv.org/pdf/2505.06617v3

9:00 AM · May 20, 2026 · 2.1K Views
9:00 AM · May 20, 2026 · 151 Views

Or wrestling, which is implemented as a custom EvoGym environment, in which two 2D soft robots fight to be the closest to the center of the arena.

Sebastian RisiSebastian Risi@risi1979

We applied it to a variety of tasks, such as Parabellum, our battle game research environment. This video shows 2D PCA of the VEM behavior space after running GAME in Parabellum for 2M evaluations over 20 generations.

9:00 AM · May 20, 2026 · 151 Views
9:00 AM · May 20, 2026 · 261 Views