cs.LGMay 3, 2026

Robust and Explainable Divide-and-Conquer Learning for Intrusion Detection

Authors: Yan ZhouKevin HamlenMichael De LuciaMurat KantarciogluLatifur KhanSharad MehrotraAnanthram SwamiBhavani Thuraisingham

Organizations: University of Texas at Dallas, Richardson, TX · DEVCOM, Army Research Laboratory, Adelphi, MD · Department of Computer Science, Virginia Tech, Blacksburg, VA · University of California, Irvine

Abstract

Machine learning-based intrusion detection requires complex models to capture patterns in high-dimensional, noisy, and class-imbalanced raw network traffic, yet deploying such models remains impractical on resource-constrained devices with limited processing power and memory. In this paper, we present a correlation-aware divide-and-conquer learning technique that decomposes a complex learning problem into smaller, more manageable subproblems. This enables lightweight models as simple as decision trees to be trained on focused subtasks, yielding up to 43.3% higher local accuracy and up to 257 times reduction in model size on real-world network intrusion detection datasets, while also improving adversarial robustness and explainability.

Explore similar work

CardsList
  1. Dueling Deep Q-Learning for Intrusion Detection

    Aug 11, 2026Logan Luna, Matthew P. Berkowitz, Laxima Niure Kandel +1Intrusion DetectionDeep Q-Networks