Probabilistic Robustness-driven Universal Adversarial Perturbations with Explainability against Deep Reinforcement Learning-based Intrusion Detection System
Authors: Hongsen Zhang, Lu Zhang, Mingjing Xu, Yi Zhang, Gregory Epiphaniou, Carsten Maple
Organizations: WMG University of Warwick Coventry, CV4 7AL · Wolfson School of Mechanical, Electrical and Manufacturing Engineering Loughborough University Loughborough, LE11 3TU · Faculty of Science and Engineering Swansea university Swansea, SA2 8PP
Deep reinforcement learning (DRL) enables adaptive intrusion detection in dynamic network environments but also exposes intrusion detection systems (IDS) to adversarial threats such as universal adversarial perturbations (UAPs), which apply a single input-agnostic perturbation to degrade detection performance across traffic. Probabilistic Robustness (PR), as a post-hoc evaluation metric, provides a principled, population-level measure of adversarial impact that conceptually aligns with the universality objective of UAPs, i.e., PR quantifies the prevalence of misclassification in the input space, making it a natural signal for guiding UAP generation. Hence, we propose PR-based UAP, which represents the first integration of an explicit PR-driven objective into generating UAPs against DRL-based IDS. Building on this formulation, we introduce PX-UAP, which leverages explainable artificial intelligence (XAI) to guide perturbation shaping under realistic domain constraints, and provides a rigorous theoretical analysis of its design. Extensive experiments demonstrate that PX-UAP consistently outperforms state-of-the-art UAP methods in attack effectiveness.
Figures & tables
Figure 1: (a): Adversarial scenario for a network-flow-based IDS. (b): Comparison between worst-case robustness (i) and probabilistic robustness (ii), adapted from [ 15 ] .
Figure 2: (a) : Illustration of mapping between PR-based variable k and Misclassification-Guaranteed Region in the UAP setting. Two examples δ1 and δ2 are provided in (i) and (ii), respectively. UAP by δ1 (larger k) induces a larger size Misclassification-Guaranteed Region B(x+δ1,k1) , while smaller size B(x+δ2,k2) by δ2 . (b) : Main Procedures of the PR-based UAP: (1) Attack initialization. (2) AE candidate selection. (3) k -driven optimization.
−cossim(activationli(x+δ),activationli(x)) , where li=l3
(4)
COSSIM_L4_UAP [ 36 ]
−cossim(activationli(x+δ),activationli(x)) , where li=l4
(5)
PCC_UAP [ 10 ]
PCCsim(activationli(x+δ),activationli(δ)) , where li=l4
Table 1: UAP baseline with loss functions for comparison with PR-based UAP.
Figure 3: (a): False Negative Rate (FNR) and (b): Accuracy of the proposed PR-based UAP and other UAP baselines. (c): FNR and (d): ACC of PX-UAP with different Topn values. (e): FNR and (f): ACC for ablation study.
Appendix figures & tables10 assets
Supplementary material from the paper’s appendix.
Appendix
Feature Name
Description
Recalculate Formulation
Group
Tot Fwd Pkts
Total packets in the forward direction
–
Modified Features
Tot Bwd Pkts
Total packets in the backward direction
–
TotLen Fwd Pkts
Total size of packet in forward direction
–
TotLen Bwd Pkts
Total size of packet in backward direction
–
Flow Duration
Duration of the flow in Microsecond
–
Fwd Pkts/s
Number of forward packets per second
Tot Fwd Pkts×106/Flow Duration
Appendix
Table 2: Feature categorization, descriptions, and formulations
Feature Name
Feature Description
Feature Value
ϵ
Adversarial Budget
[0.04,0.15]
size
Seedset size
1×10−4
max_iter
Max Iteration Number
20
N
PGD Attack Number
10
nstep
PGD Iteration Step
50
α
PGD Step Size
ϵ/nstep
Appendix
Table 3: Hyperparameter Setting for algorithms
Index Name
AE Initia.
K-Sel.
Optz.
(1): FUAP
FGM(1)
×
×
(2): KFUAP
FGM(N)
√
×
(3): PUAP
PGD(1)
×
×
(4): KPUAP
PGD(N)
√
×
(5): PR-based UAP
PGD(N)
√
√
Appendix
Table 4: Deatils of PR-based UAP attack and ablation variants.
Figure 4: F1 score of the proposed PR-based UAP and other UAP baselines
Figure 5: F1 score of (a): PX-UAP with different Topn values. (b): The ablation study
Figure 6: FNR of proposed PR-based UAP on DRL-based IDS (DQN-4-64) on (a): NSL-KDD over ϵ∈[0,0.45] , (b) : UNSW-NB15 over ϵ∈[0,0.15] .
Figure 7: FNR of proposed PR-based UAP on different DRL-based IDS on CICIDS2018 dateset with the taget model of (a): DQN-6-128, (b): PPO-4-64, (c): A2C-4-64.
Figure 8: FNR for Cross-model Transferability of AE (PR-based UAP) among different DRL-based IDS model on CICIDS2018 at ϵ=0.15
Figure 9: FNR of (a): PR-based UAP (b): PCC_UAP (c): UAP with different stepsize on CICIDS2018 dateset. The applied stepsize are show in parentheses.
Figure 10: FNR of best-step-size comparison for PR-based UAP, PCC_UAP and UAP attack.
Building on a probabilistic perspective in which adversarial examples arise from the overlap between a distance-based distribution pdis and a victim-classifier-induced distribution pvic, we start from a simple intuition: adversarial examples become harder to generate when these two distributions are pushed apart, as their overlap becomes smaller, thereby increasing robustness. This intuition naturally motivates a KL-based robustness objective. We then prove that KL(pdis∥pvic)−logZvic is a lower bound on probabilistic robustness (PR), where Zvic denotes the normalizing constant of pvic. Since PR is generally intractable to compute directly, maximizing this KL-based lower bound provides a tractable surrogate objective for improving PR. We further show that this objective recovers a scaled form of adversarial training, offering a probabilistic interpretation of adversarial training and a principled route to robustness improvement. We call the resulting method probabilistic adversarial training. Experiments show that it consistently improves PR, and ablation studies demonstrate that the induced scaling factor can even enhance the PR of non-probabilistic adversarial training methods.
Significant progress has been made in safeguarding deep reinforcement learning (DRL) policies against input perturbations. Developing robust DRL involves three main stages: algorithm design, implementation, and evaluation. In this work, we identify and address a key limitation at each stage. First, we introduce Adversarial Importance Sampling (Advis), a method that uses importance sampling over trajectories from standard training to estimate and optimize verifiable worst-case returns. Advis satisfies three desirable criteria not jointly achieved by prior work: it requires no additional environment interactions, no auxiliary networks, and captures long-term robustness. Second, we introduce advrl, a modular PyTorch library that provides clean, single-file implementations of existing robustness methods and adversarial attacks, facilitating rapid prototyping and enabling reproducible and traceable evaluations. Third, we revisit evaluation under learned adversaries and show that optimal adversarial hyperparameters do not transfer across agents, which can lead to an overestimation of robustness when using a limited set of attacker configurations. Accordingly, we evaluate policies against a large and diverse set of attackers, using 6-14x more configurations than prior work. Finally, we evaluate our approach on continuous control environments, demonstrating its effectiveness relative to existing baselines. The code is available at: https://github.com/AmineAndam04/advrl
Amine Andam, Jamal Bentahar, Mustapha Hedabou
Mohammed VI Polytechnic University · Khalifa University · Concordia University
Advanced Persistent Threats (APTs) are stealthy, multi-stage attacks that require adaptive and timely defense. While deep reinforcement learning (DRL) enables autonomous cyber defense, its decisions are often opaque and difficult to trust in operational environments. This paper presents DeepXplain, an explainable DRL framework for stage-aware APT defense. Building on our prior DeepStage model, DeepXplain integrates provenance-based graph learning, temporal stage estimation, and a unified XAI pipeline that provides structural, temporal, and policy-level explanations. Unlike post-hoc methods, explanation signals are incorporated directly into policy optimization through evidence alignment and confidence-aware reward shaping. To the best of our knowledge, DeepXplain is the first framework to integrate explanation signals into reinforcement learning for APT defense. Experiments in a realistic enterprise testbed show improvements in stage-weighted F1-score (0.887 to 0.915) and success rate (84.7% to 89.6%), along with higher explanation confidence (0.86), improved fidelity (0.79), and more compact explanations (0.31). These results demonstrate enhanced effectiveness and trustworthiness of autonomous cyber defense.
Trung V. Phan, Thomas Bauschert
Chair of Communication Networks, Technische Universität Chemnitz, 09126 Chemnitz, Germany