mlsanityData to 14 Oct 2026

Catch Me If You Can: Improving Adversaries in Cyber-Security With Q-Learning Algorithms

arXiv 2302.03768 ↗First posted 7 Feb 2023cs.AI cs.MAcited by 0

Not on the map. Why?

Abstract (arXiv)

The ongoing rise in cyberattacks and the lack of skilled professionals in the cybersecurity domain to combat these attacks show the need for automated tools capable of detecting an attack with good performance. Attackers disguise their actions and launch attacks that consist of multiple actions, which are difficult to detect. Therefore, improving defensive tools requires their calibration against a well-trained attacker. In this work, we propose a model of an attacking agent and environment and evaluate its performance using basic Q-Learning, Naive Q-learning, and DoubleQ-Learning, all of which are variants of Q-Learning. The attacking agent is trained with the goal of exfiltrating data whereby all the hosts in the network have a non-zero detection probability. Results show that the DoubleQ-Learning agent has the best overall performance rate by successfully achieving the goal in 70% of the interactions.

Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 3 of its 22 references that are in the map. First posted on arXiv 7 Feb 2023.

Builds on

3 of 22 references.

References · 3

  1. 2020Finding Effective Security Strategies through Reinforcement Learning and Self-Playcited by 32
  2. 2021Practical Fixed-Parameter Algorithms for Defending Active Directory Style Attack Graphscited by 6
  3. 2022ProAPT: Projection of APT Threats with Deep Reinforcement Learningcited by 1

Built on by

Not cited yet.