Skip to content

Candidate Comparability Before Promotion: Conditional Validation in Adaptive Network Intrusion Detection

Sep 2026 · 1 citation · 92 references
Computer Science

TL;DR

Challenger construction and evidence should be controlled, reported and interpreted explicitly when promotion is evaluated, and policy ordering changed with candidate comparability, no policy globally dominated, and earlier compatibility statements for a label-free estimator and a calibrated ensemble narrowed.

Abstract

Adaptive network intrusion detection systems retrain classifiers after drift alarms, but an alarm detects change; it does not establish that a challenger should replace the deployed incumbent. Promotion is security-relevant because it changes the model responsible for subsequent attack detection, and evaluating it has a methodological problem: promotion conclusions may depend on how the challenger was constructed and on how much evidence supports it. We test that dependence on CICIDS2017, UNSW-NB15 and ToN-IoT with self-contained challenger pipelines, nested candidate-size controls, a common-harness comparison of nine update policies, and a final sensitivity confining every exact feature vector to one evaluation, training or probe role. Incumbent-owned frozen preprocessing amplified apparent promotion harm; with self-contained challenger pipelines the mean full-drift harm did not persist. Raising nominal candidate evidence from 512 to 2,000 samples per class improved promotion under pool-constructed progressive drift by +0.53, +1.67 and +0.38 balanced-accuracy points: positive and statistically resolved in all three benchmarks, but materially benchmark-dependent rather than homogeneous, and driven mainly by fewer false positives. Policy conclusions were partially robust: policy ordering changed with candidate comparability, no policy globally dominated, and earlier compatibility statements for a label-free estimator and a calibrated ensemble narrowed. Validation helped evidence-disadvantaged challengers but added no average benefit at parity. Thirteen replays on real, time-ordered traffic showed no net harm from always deploying. Challenger construction and evidence should be controlled, reported and interpreted explicitly when promotion is evaluated.

View source

Similar papers

Review Open access Sep 2026

Explainable and Analyst-Driven Random Forest for Intrusion Detection

Random Forest and other tree-ensemble classifiers achieve high accuracy in network intrusion detection; however, their aggregate decision logic prevents analysts from auditing or deploying individual predictions as operational rules. Post hoc explanation methods introduce latencies incompatible with security operation...

Saloua Bellouch, Mostapha Zbakh, S. Aouad et al. · 0 citations
Open access Aug 2026

Benchmark-Shift-Aware Intrusion Detection for Evolving Network Traffic: Cross-Dataset Generalization, Calibrated Alerting, and Score-Orientation Diagnostics

The study provides a reproducible diagnostic framework for evaluating IDS robustness under evolving benchmark conditions through harmonized cross-dataset evaluation of HIKARI-2021, CICIDS2017, and a CICIoT2023 sample subset.

Hyejin Jin, Hongchul Lee · 0 citations
Open access Aug 2026

A Label-Efficient Adaptive Retraining Framework for Network Intrusion Detection Under Streaming Arrival Bias

Network intrusion detectors degrade when operational traffic diverges from their training domain, yet unconditional retraining wastes scarce labeling effort. Using CIC-IDS2017 and CSE-CIC-IDS2018 as source and target domains, with the target replayed chronologically, we report two findings. First, degradation is hetero...

Sanghoon Jeon, Aram Kim · 0 citations
Open access Aug 2026

Reliability auditing of explanations for machine-learning-based intrusion detection systems

Among the high-performing models, XGBoost provided the strongest balance on IoT-ToN, while Random Forest provided the strongest balance on UNSW-NB15, and the reliability results show that high predictive performance does not automatically imply trustworthy explanations.

Elijah M. Maseno, Yan-Xia Sun, Zeng-Hui Wang · 0 citations
Review Open access Sep 2026

DEEP LEARNING-BASED INTRUSION DETECTION SYSTEMS: ARCHITECTURES, IMPLEMENTATIONS, AND CHALLENGES IN MODERN NETWORK ANOMALY DETECTION

The revised framework extends this four-layer pipeline by explicitly integrating Explainable AI (XAI) and edge-oriented deployment as cross-cutting operational requirements by explicitly integrating Explainable AI (XAI) and edge-oriented deployment as cross-cutting operational requirements.

A. Havy, Muhammad Faishol Amrulloh · 0 citations
Open access 2026

Bias and False Positive Challenges in AI-Based Intrusion Detection Systems under Extreme Class Imbalance

: Artificial intelligence (AI)-based intrusion detection systems (IDS) have evolved to be fundamental in detecting cyberattacks in contemporary networks. Unfortunately, the significant class imbalance present in cyberse-curity datasets may introduce unfair biases during model learning, producing unpredictable predictio...

John Ojo Ajayi, Grace Egenti · 0 citations

Related blog posts

GPT-Lab Oct 30, 2026

Black October? The Week AI Changed the Cybersecurity Conversation

Critical flaws, compromised release channels and agentic AI threats landed within days of each other in mid-October 2026. Why “Black October” may say more about how well we now find weaknesses than about the attacks themselves. The post Black October? The Week AI Changed the Cybersecurity Conversation appeared first on GPT-Lab.

MIT News · Artificial Intelligence Oct 28, 2026

Making machines that can listen

Professor Paris Smaragdis develops computers with superhuman hearing for applications like speech recognition, music understanding, and environmental monitoring.

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.