Optimal Defender Strategies for CAGE-2 using Causal Modeling and Tree Search
The CAGE-2 challenge is considered a standard benchmark to compare methods for autonomous cyber defense. Current state-of-the-art methods evaluated against this benchmark are based on model-free (offline) reinforcement learning, which does not provide provably optimal defender strategies. We address this limitation and present a formal (causal) model of CAGE-2 together with a method that produces a provably optimal defender strategy, which we call Causal Partially Observable Monte-Carlo Planning (C-POMCP). It has two key properties. First, it incorporates the causal structure of the target system, i.e., the causal relationships among the system variables. This structure allows for a significant reduction of the search space of defender strategies. Second, it is an online method that updates the defender strategy at each time step via tree search. Evaluations against the CAGE-2 benchmark show that C-POMCP achieves state-of-the-art performance with respect to effectiveness and is two orders of magnitude more efficient in computing time than the closest competitor method.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
Learning Optimal Defender Strategies for CAGE-2 using a POMDP Model
CAGE-2 is an accepted benchmark for learning and evaluating defender strategies against cyberattacks. It reflects a scenario where a defender agent protects an IT infrastructure against various attacks. Many defender met…
Learning Near-Optimal Intrusion Responses Against Dynamic Attackers
We study automated intrusion response and formulate the interaction between an attacker and a defender as an optimal stopping game where attack and defense strategies evolve through reinforcement learning and self-play. …
Learning Security Strategies through Game Play and Optimal Stopping
We study automated intrusion prevention using reinforcement learning. Following a novel approach, we formulate the interaction between an attacker and a defender as an optimal stopping game and let attack and defense str…
reinforcement-learningReinforcement LearningReinforcement Learning (RL)Causality-aware Graph Aggregation Weight Estimator for Popularity Debiasing in Top-K Recommendation
Graph-based recommender systems leverage neighborhood aggregation to generate node representations, which is highly sensitive to popularity bias, resulting in an echo effect during information propagation. Existing graph…
Causal InferenceCAGE: Probing Causal Relationships in Deep Generative Models
Deep generative models excel at generating complex, high-dimensional data, often exhibiting impressive generalization beyond the training distribution. The learning principle for these models is however purely based on s…
Robust classificationSynthetic Data Generation