Candidate Comparability Before Promotion: Conditional Validation in Adaptive Network Intrusion Detection
Not on the map. Why?
Abstract (arXiv)
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.
Key facts. No citing papers in the map yet (data through 13 Oct 2026). Builds on 36 of its 92 references that are in the map. First posted on arXiv 3 Sep 2026.
Builds on
36 of 92 references.
References · 36
- 2016Overcoming catastrophic forgetting in neural networkscited by 4,753
- 2018Supervised learning with quantum enhanced feature spacescited by 660
- 2020Learning under Concept Drift: A Reviewcited by 474
- 2020Power of data in quantum machine learningcited by 338
- 2018Failing Loudly: An Empirical Study of Methods for Detecting Dataset Shiftcited by 241
- 2018Time-uniform, nonparametric, nonasymptotic confidence sequencescited by 224
- 2020Estimating means of bounded random variables by bettingcited by 166
- 2022Leveraging Unlabeled Data to Predict Out-of-Distribution Performancecited by 142
- 2022Machine Learning Operations (MLOps): Overview, Definition, and Architecturecited by 127
- 2020A Survey on Negative Transfercited by 121
- 2021Assessing Generalization of SGD via Disagreementcited by 116
- 2021Predicting with Confidence on Unseen Distributionscited by 116
24 more
- 2018TESSERACT: Eliminating Experimental Bias in Malware Classification across Space and Timecited by 108
- 2020Are Labels Always Necessary for Classifier Accuracy Evaluation?cited by 104
- 2020Dos and Don'ts of Machine Learning in Computer Securitycited by 102
- 2022Agreement-on-the-Line: Predicting the Performance of Neural Networks under Distribution Shiftcited by 94
- 2022Exponential concentration in quantum kernel methodscited by 90
- 2022From Concept Drift to Model Degradation: An Overview on Performance-Aware Drift Detectorscited by 83
- 2021Active Testing: Sample-Efficient Model Evaluationcited by 82
- 2020Transcending Transcend: Revisiting Malware Classification in the Presence of Concept Driftcited by 53
- 2020Reactive Soft Prototype Computing for Concept Drift Streamscited by 40
- 2023Continuous Learning for Android Malware Detectioncited by 33
- 2023Active learning for data streams: a surveycited by 29
- 2024Quantum Kernel Methods under Scrutiny: A Benchmarking Studycited by 22
- 2020Online Active Model Selection for Pre-trained Classifierscited by 19
- 2023(Almost) Provable Error Bounds Under Distribution Shift via Disagreement Discrepancycited by 16
- 2023SoK: Pragmatic Assessment of Machine Learning for Network Intrusion Detectioncited by 13
- 2024Model Assessment and Selection under Temporal Distribution Shiftcited by 11
- 2023A comprehensive analysis of concept drift locality in data streamscited by 10
- 2024All models are wrong, some are useful: Model Selection with Limited Labelscited by 8
- 2025When to retrain a machine learning modelcited by 8
- 2021UNSW-NB15 Computer Security Dataset: Analysis through Visualizationcited by 7
- 2024Continual Learning with Strategic Selection and Forgetting for Network Intrusion Detectioncited by 5
- 2021A Novel Online Incremental Learning Intrusion Prevention Systemcited by 3
- 2025Evaluating the Potential of Quantum Machine Learning in Cybersecurity: A Case-Study on PCA-based Intrusion Detection Systemscited by 3
- 2018Automated Adaptation Strategies for Stream Learningcited by 2
Built on by
Not cited yet.