Title: Generalizable Graph-based Reinforcement Learning Agents for Automated Cyber Defense
Primary area: reinforcement learning
Keywords: Reinforcement learning, graph neural networks, security, generalizable RL

Abstract: Deep reinforcement learning (RL) is emerging as a viable strategy for automated cyber defense (ACD). 
The traditional RL approach represents networks as a list of computers in various states of safety or threat. 
Unfortunately, these models are forced to overfit to specific network topologies, rendering them ineffective when faced with even small environmental perturbations. 
In this work, we frame ACD as a two-player context-based partially observable Markov decision problem with observations represented as attributed graphs.
This approach allows our agents to reason through the lens of relational inductive bias. 
Agents learn how to reason about hosts interacting with other system entities in a more general manner, and their actions are understood as edits to the graph representing the environment. 
By introducing this bias, we will show that our agents can better reason about the states of networks and zero-shot adapt to new ones. 
We show that this approach outperforms the state-of-the-art by a wide margin, and makes our agents capable of defending never-before-seen networks against a wide range of adversaries in a variety of complex, and multi-agent environments.

TL;DR: By representing networks of computers as graphs, RL agents built from inductive GNNs can be trained on one topology, and defend never before seen networks