Cited by 8Network Security and Intrusion DetectionInformation and Cyber SecurityAdversarial Robustness in Machine Learning

A Novel Framework for Enhancing Decision-Making in Autonomous Cyber Defense Through Graph Embedding

Open access
Wang, Zhen, Wang, Yongjie, Xiong, Xinli, Ren, Qiankun, Huang, Jun·2025·Entropy

Abstract

Faced with challenges posed by sophisticated cyber attacks and dynamic characteristics of cyberspace, the autonomous cyber defense (ACD) technology has shown its effectiveness. However, traditional decision-making methods for ACD are unable to effectively characterize the network topology and internode dependencies, which makes it difficult for defenders to identify key nodes and critical attack paths. Therefore, this paper proposes an enhanced decision-making method combining graph embedding with reinforcement learning algorithms. By constructing a game model for cyber confrontations, this paper models important elements of the network topology for decision-making, which guide the defender to dynamically optimize its strategy based on topology awareness. We improve the reinforcement learning with the Node2vec algorithm to characterize information for the defender from the network. And, node attributes and network structural features are embedded into low-dimensional vectors instead of using traditional one-hot encoding, which can address the perceptual bottleneck in high-dimensional sparse environments. Meanwhile, the algorithm training environment Cyberwheel is extended by adding new fine-grained defense mechanisms to enhance the utility and portability of ACD. In experiments, our decision-making method based on graph embedding is compared and analyzed with traditional perception methods. The results show and verify the superior performance of our approach in the strategy selection of defensive decision-making. Also, diverse parameters of the graph representation model Node2vec are analyzed and compared to find the impact on the enhancement of the embedding effectiveness for the decision-making of ACD.

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.3390/e27060622

Cites

28 of 28 references verified0 citation errors · 0 not checkable

Statistics

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

  • Cyber-defense tasks increasingly involve multi-hop reasoning in communication with operational sources of data.

    “This scope accords with new studies suggesting that cyber-defense tasks increasingly involve multi-hop reasoning in communication with operational sources of data [7], [8].”

    From The Evolution of Agentic AI in Cybersecurity: From Single LLM Reasoners to Multi-Agent Systems and Autonomous Pipelines (2026) · cites this paper as [8]

    Section 3.2 says the defense method can explore multi-hop attack paths, and Section 3.1 describes network-state information and detection results from security devices. The paper does not establish that cyber-defense tasks are increasingly conducted through communication with operational data sources; its method is tested in a simulated environment (Section 5.1). (LLM, conf=0.82)

    Experimental — accuracy not yet measured

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Cites

Flagged first, then by citations

Research works printed but not linked: 5

  1. [8]Sengupta S. Kambhampati S. Multi-agent Reinforcement Learning in Bayesian Stackelberg Markov Games for Adaptive Moving Target Defense arXiv 2020 cs.GT/2007.10457
  2. [22]Brockman G. Cheung V. Pettersson L. Schneider J. Schulman J. Tang J. Zaremba W. OpenAI Gym arXiv 2016 1606.01540
  3. [24]Janisch J. Pevný T. Lisý V. NASimEmu: Network Attack Simulator & Emulator for Training Agents Generalizing to Novel Scenarios Proceedings of the Computer Security. ESORICS 2023 International Workshops Hague, The Netherlands 25–29 September 2023 Katsikas S. Abie H. Ranise S. Verderame L. Cambiaso E. Ugarelli R. Praça I. Li W. Meng W. Furnell S. Springer Cham, Switzerland 2024 589 608
  4. [31]Vyas S. Hannay J. Bolton A. Burnap P.P. Automated Cyber Defence: A Review arXiv 2023 cs.CR/2303.04926
  5. [34]Schulman J. Wolski F. Dhariwal P. Radford A. Klimov O. Proximal Policy Optimization Algorithms arXiv 2017 1707.06347

Cited by

Sorted by citations

Authors
Wang, Z., Wang, Y., Xiong, X., Ren, Q., & Huang, J.
Affiliations
National University of Defense Technology (CN)
Corresponding author
Wang, Yongjie
Venue
Entropy
Publisher
MDPI AG
Published
2025-06-11
Volume
27
Issue
6
Pages
622
ISSN
1099-4300 (ISSN-L)
OpenAlex
W4411208483
Cited by
7
References
23
Citations by year
2026: 4 · 2025: 3
FWCI
2.94
Type
journal article
Language
en
Open access
Locations
  • Entropy (publishedVersion, cc-by)
  • PubMed Central (publishedVersion, cc-by)
  • PubMed (publishedVersion)
  • DOAJ (DOAJ: Directory of Open Access Journals) (submittedVersion, cc-by-sa)
Topics
  • Physical Sciences › Computer Science › Computer Networks and Communications › Network Security and Intrusion Detection
  • Physical Sciences › Computer Science › Information Systems › Information and Cyber Security
  • Physical Sciences › Computer Science › Artificial Intelligence › Adversarial Robustness in Machine Learning
Keywords
autonomous cyber defense, decision-making, graph embedding, node2vec, reinforcement learning, network topology, attack path identification, critical nodes, high-dimensional sparse data

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review