# Co-Evolutionary Defence of Active Directory Attack Graphs via GNN-Approximated Dynamic Programming

arXiv: https://arxiv.org/abs/2505.11710 · HTML: https://mlsanity.com/paper/2505.11710/

## Key facts

- Cited by 6 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 16 May 2025.

## Built on by (most cited first, 6 of 6)

- [Australian Bushfire Intelligence with AI-Driven Environmental Analytics](https://mlsanity.com/paper/2601.06105/) (2026)
- [Explainable Autonomous Cyber Defense using Adversarial Multi-Agent Reinforcement Learning](https://mlsanity.com/paper/2604.04442/) (2026)
- [AgenticVM: Agentic AI for Adaptive Software Vulnerability Management](https://mlsanity.com/paper/2605.01739/) (2026)
- [Comparative Analysis of Large Language Models in Healthcare](https://mlsanity.com/paper/2604.10316/) (2026)
- [CausalNav: Reliability-Certified Causal World Models for Control under Physical-Parameter Shift](https://mlsanity.com/paper/2608.07809/) (2026)
- [VACS: Value-Aligned Compositional Shielding for Multi-Agent Reasoning](https://mlsanity.com/paper/2609.26135/) (2026)

## Abstract (arXiv)

Modern enterprise networks increasingly rely on Active Directory (AD) for identity and access management. However, this centralization exposes a single point of failure, allowing adversaries to compromise high-value assets. Existing AD defense approaches often assume static attacker behavior, but real-world adversaries adapt dynamically, rendering such methods brittle. To address this, we model attacker-defender interactions in AD as a Stackelberg game between an adaptive attacker and a proactive defender. We propose a co-evolutionary defense framework that combines Graph Neural Network Approximated Dynamic Programming (GNNDP) to model attacker strategies, with Evolutionary Diversity Optimization (EDO) to generate resilient blocking strategies. To ensure scalability, we introduce a Fixed-Parameter Tractable (FPT) graph reduction method that reduces complexity while preserving strategic structure. Our framework jointly refines attacker and defender policies to improve generalization and prevent premature convergence. Experiments on synthetic AD graphs show near-optimal results (within 0.1 percent of optimality on r500) and improved performance on larger graphs (r1000 and r2000), demonstrating the framework's scalability and effectiveness.