MétaCan
Menu
Back to cohort
Record W7092599726 · doi:10.1002/aaai.70021

CAGE challenge 4: A scalable multi‐agent reinforcement learning gym for autonomous cyber defence

2025· article· en· W7092599726 on OpenAlex

Why this work is in the frame

A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.

affAt least one author lists a Canadian institution in the pinned OpenAlex snapshot.

Bibliographic record

VenueAI Magazine · 2025
Typearticle
Languageen
FieldComputer Science
TopicSoftware-Defined Networks and 5G
Canadian institutionsDefence Research and Development Canada
Fundersnot available
KeywordsReinforcement learningScalabilityMarlAdversarial systemAutonomyUsabilityEnterprise private network

Abstract

fetched live from OpenAlex

Abstract As cyber threats become increasingly automated and sophisticated, novel solutions must be introduced to improve defense of enterprise networks. Deep reinforcement learning (DRL) has demonstrated potential in mitigating these advanced threats. Single DRL agents have proven utility toward execution of autonomous cyber defense. Despite the success of employing single DRL agents, this approach presents significant limitations, especially regarding scalability within large enterprise networks. An attractive alternative to the single‐agent approach is the use of multi‐agent reinforcement learning (MARL). However, developing MARL agents is costly with few options for examining MARL cyber defense techniques against adversarial agents. This paper presents a MARL network security environment, the fourth iteration of the cyber autonomy gym for experimentation (CAGE) challenges. This challenge was specifically designed to test the efficacy of MARL algorithms in an enterprise network. Our work aims to evaluate the potential of MARL as a robust and scalable solution for autonomous network defense.

Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.

Full frame distilled prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.

metaresearch head score (Codex)0.000
metaresearch head score (Gemma)0.000
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: none
GenreCandidate signal: Methods · Consensus signal: none
Teacher disagreement score0.905
Threshold uncertainty score0.828

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0000.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.000
Science and technology studies0.0000.000
Scholarly communication0.0000.000
Open science0.0010.000
Research integrity0.0000.000
Insufficient payload (model declined to judge)0.0000.000

Machine scores (provisional)

The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.

Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.

Opus teacher head0.019
GPT teacher head0.267
Teacher spread0.248 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it