Papers
Topics
Authors
Recent
Search
2000 character limit reached

Adversarial Co-Evolution

Updated 10 July 2026
  • Adversarial co-evolution is a dynamic process where opposing agents continuously adapt, reshaping each other’s strategy space.
  • It is applied in diverse fields such as malware defense, multi-population GAN training, and adaptive policy–environment synthesis to counter evolving challenges.
  • This approach enhances system robustness by iteratively updating defenses and attack strategies, effectively overcoming static robustness limitations.

Adversarial co-evolution denotes a class of learning, optimization, and evaluation processes in which opposing agents, models, populations, or environment generators repeatedly adapt to one another, so that each side changes the other’s objective landscape, training distribution, or feasible strategy set. In recent work, the term covers bilevel malware attack–defense loops, co-evolutionary illumination in adversarial games, learned world generation for MARL, program-level policy–environment synthesis, attacker–defender safety games for LLMs, adaptive webshell defense, and multi-population GAN training. Across these settings, the defining feature is not mere adversariality, but dynamic mutual adaptation in place of evaluation against a fixed adversary or a static task distribution (Jurečková et al., 24 Apr 2026, Anne et al., 10 May 2025, Hill, 3 Sep 2025, Ding, 28 Jan 2026, Wen et al., 2 Feb 2026, Sygkounas et al., 30 Mar 2026).

1. Definitional core and scope

Adversarial co-evolution is best understood as a response to the failure of static robustness assumptions. In malware detection, the central claim is that defense is fundamentally dynamic: the defender trains on past samples, the attacker learns to evade the current detector, the defender retrains on those evasions, and the attacker adapts again. That repeated loop is precisely why the malware paper argues that standard “one-shot” adversarial training is structurally insufficient against a reinforcement-learning attacker that can keep discovering new evasion paths (Jurečková et al., 24 Apr 2026).

A second defining property is that co-evolution need not take a single formal shape. Some systems are explicit attacker–defender games with equilibrium notions, such as sequential SPNE in MAGIC or zero-sum empirical games with mixed-strategy Nash equilibria in COvolve; others are

Topic to Video (Beta)

No one has generated a video about this topic yet.

Whiteboard

No one has generated a whiteboard explanation for this topic yet.

Follow Topic

Get notified by email when new papers are published related to Adversarial Co-Evolution.