Learning intrusion-detection rules directly from benign traffic made the same rules both the detector and its explanation, cutting F1 error by 5.7 to 47 times at 7.8 Gbps inside Suricata
AspireAI community · arXiv
IDSForge is an anomaly-based network intrusion detection system that learns explicit, executable behavioural rules from benign traffic instead of relying on implicit decision boundaries, and uses the same rule set for detection and for explanation, so the explanation is faithful by construction rather than post-hoc. A distributional autoencoder trained only on benign samples learns axis-aligned regions of benign traffic, a rule compiler consolidates them into feature-level interval constraints that run directly in popular NIDS engines, and a self-distillation co-evolver updates the model and rules when false positives exceed a threshold. The authors report reducing F1 error by 5.7x to 47x relative to state-of-the-art anomaly-based baselines, sustaining 7.8 Gbps throughput in Suricata with a median per-packet latency overhead of 3.1 microseconds. The baseline comparison covers anomaly-based detectors only, not signature-based engines.
Read the story and explore more from the AspireAI community.
Two sparse-autoencoder analyses have resisted scaling: matching semantically similar features across layers, and compressing large feature circuits into interpretable supernodes. This paper argues both are the same underlying problem, estimating semantic distances between SAE features that sit on different activation manifolds. Its representation treats each feature not as a single decoder vector but as an activation-weighted distribution over the hidden states expressing it, projects those distributions into a shared reference space, and compares them with Wasserstein distance. The representation is proved invariant to activation rescaling and stable under perturbation, and recovers true matches under finite-sample margin conditions. Empirically it outperformed decoder-vector and LLM-based baselines and captured subtle functional distinctions between related features, and it compressed large feature circuits into interpretable supernodes automatically. The limitation is that this is interpretability tooling: the paper demonstrates better feature matching and circuit compression, not that downstream interpretability claims become more accurate.