mlsanityData to 13 Oct 2026

Network Defense is Not a Game

arXiv 2104.10262 ↗First posted 20 Apr 2021cs.CR cs.AI cs.GTcited by 6

Not on the map. Why?

Abstract (arXiv)

Research seeks to apply Artificial Intelligence (AI) to scale and extend the capabilities of human operators to defend networks. A fundamental problem that hinders the generalization of successful AI approaches -- i.e., beating humans at playing games -- is that network defense cannot be defined as a single game with a fixed set of rules. Our position is that network defense is better characterized as a collection of games with uncertain and possibly drifting rules. Hence, we propose to define network defense tasks as distributions of network environments, to: (i) enable research to apply modern AI techniques, such as unsupervised curriculum learning and reinforcement learning for network defense; and, (ii) facilitate the design of well-defined challenges that can be used to compare approaches for autonomous cyberdefense. To demonstrate that an approach for autonomous network defense is practical it is important to be able to reason about the boundaries of its applicability. Hence, we need to be able to define network defense tasks that capture sets of adversarial tactics, techniques, and procedures (TTPs); quality of service (QoS) requirements; and TTPs available to defenders. Furthermore, the abstractions to define these tasks must be extensible; must be backed by well-defined semantics that allow us to reason about distributions of environments; and should enable the generation of data and experiences from which an agent can learn. Our approach named Network Environment Design for Autonomous Cyberdefense inspired the architecture of FARLAND, a Framework for Advanced Reinforcement Learning for Autonomous Network Defense, which we use at MITRE to develop RL network defenders that perform blue actions from the MITRE Shield matrix against attackers with TTPs that drift from MITRE ATT&CK TTPs.

Key facts. Cited by 6 papers in the map (data through 13 Oct 2026). Builds on 18 of its 24 references that are in the map. First posted on arXiv 20 Apr 2021.

Builds on

18 of 24 references.

References · 18

  1. 2017Proximal Policy Optimization Algorithmscited by 14,592
  2. 2016Asynchronous Methods for Deep Reinforcement Learningcited by 2,223
  3. 2016OpenAI Gymcited by 1,694
  4. 2019Solving Rubik's Cube with a Robot Handcited by 702
  5. 2020Emergent Complexity and Zero-shot Transfer via Unsupervised Environment Designcited by 263
  6. 2018Distributed Prioritized Experience Replaycited by 260
  7. 2019Adversarial Policies: Attacking Deep Reinforcement Learningcited by 212
  8. 2017Tactics of Adversarial Attack on Deep Reinforcement Learning Agentscited by 165
  9. 2017Delving into adversarial attacks on deep policiescited by 104
  10. 2019Deep Reinforcement Learning for Cyber Securitycited by 92
  11. 2016Learning to Perform Physics Experiments via Deep Reinforcement Learningcited by 47
  12. 2019Characterizing Attacks on Deep Reinforcement Learningcited by 31
6 more
  1. 2021Network Environment Design for Autonomous Cyberdefensecited by 30
  2. 2018Reinforcement Learning for Autonomous Defence in Software-Defined Networkingcited by 17
  3. 2020CybORG: An Autonomous Cyber Operations Research Gymcited by 16
  4. 2018The Faults in Our Pi Stars: Security Issues and Open Challenges in Deep Reinforcement Learningcited by 5
  5. 2020SoK: A Survey of Open-Source Threat Emulatorscited by 4
  6. 2019Adversarial Reinforcement Learning under Partial Observability in Autonomous Computer Network Defencecited by 1

Built on by

Cited by year

Citing papers per year: 2021: 1; 2022: 0; 2023: 1; 2024: 1; 2025: 3.

6 papers.