The research, led by Hung-Cuong Nguyen of Hung Vuong University and colleagues at Le Quy Don Technical University and Thai Nguyen University of Information and Communication Technology, addresses what the authors call distribution shift in streaming intrusion detection. Their framework operates on two distinct timescales. At the fast timescale, every incoming network sample is scored using online statistical estimates of feature means and variances, updated through exponential moving averages after each prediction. At the slower timescale, two families of interpretable threshold states—feature-specific abnormality thresholds and a global abnormality gate—are updated only once per non-overlapping batch of 200 samples, using batch-averaged predictive uncertainty and a bounded drift-intensity signal.

The mechanics are deliberately simple. For each of four monitored numerical features, the system computes a Z-score against pre-update statistics, ensuring that a sample never normalizes itself before being judged. A feature is flagged as abnormal when its standardized score exceeds that feature’s current threshold, and the proportion of flagged features forms an abnormality ratio. If that ratio crosses the global gate threshold, the sample is diverted away from the classifier entirely and treated as suspicious. Everything else flows through a lightweight Random Forest that was trained during an initial warm-up phase and never touched again during streaming operation.

What makes the thresholds move is a feedback law with two opposing forces. Predictive uncertainty, measured as the normalized entropy of the classifier’s output, pushes thresholds upward: when the model is confused, the gate becomes less sensitive, preventing ambiguous traffic from triggering excessive alarms. Drift intensity, estimated by comparing a recent window of 100 abnormality ratios against a non-overlapping reference window of 300 through a Hoeffding-type tolerance, pushes thresholds downward: when the traffic distribution genuinely departs from its reference state, sensitivity increases. Both signals are clipped to the interval from zero to one, and the resulting threshold updates are themselves clipped to fixed bounds, so the maximum unconstrained one-batch change is 0.025 for a feature threshold and 0.006 for the global gate.

The authors are careful about what this boundedness does and does not prove. The mathematical analysis establishes that threshold states and their one-step changes remain finite, but it explicitly does not establish convergence to an optimal boundary, closed-loop stability in a formal control-theoretic sense, or robustness against an adversary who deliberately manipulates the feedback sequence. In fact, the paper identifies a genuine security limitation: sustained traffic that repeatedly produces high uncertainty without a strong distribution-change signal can drive the detector toward a less sensitive operating point until clipping intervenes. The team treats this desensitization risk as an honest caveat rather than glossing over it.

The experimental evaluation is unusually thorough for this class of work. The framework was tested on three public IoT intrusion-detection benchmarks—RT-IoT2022, IoTID20, and CICIoT2023—with 46,000 streaming observations per dataset processed as 230 batches, repeated across five random seeds for a total of fifteen paired runs per comparison. Against Adaptive Random Forest, the strongest baseline representing continuous model-level adaptation, the proposed method scored an overall F1 of 0.9387 versus 0.9407. That small accuracy gap of roughly 0.21 percentage points was statistically detectable, and the authors decline to claim equivalence. What the fixed-classifier approach bought instead was a lower false-positive rate of 0.0312 versus 0.0349, a 24.5 percent reduction in temporal F1 variance, and a total processing cost of 2.79 milliseconds per sample versus 4.15—a 32.7 percent reduction overall and a 64.7 percent reduction in update time.

Perhaps the most striking result comes from the leave-one-attack-family-out evaluation, where entire attack categories—grouped DDoS for RT-IoT2022, Mirai for IoTID20, and Spoofing for CICIoT2023—were withheld from training entirely. Here the adaptive abnormality gate achieved an F1 of 0.800 with a false-positive rate of 0.031, outperforming fixed statistical baselines such as rolling Z-score rules, median absolute deviation, and interquartile-range detectors. This matters because conventional closed-set classifiers can only assign labels they saw during training, whereas new IoT attack families emerge constantly. The gate reframes the problem: rather than forcing unknown traffic into predefined categories, it simply asks whether a sample deviates from learned statistical patterns, with sensitivity that adjusts as the stream evolves.

A controlled-stream analysis added a stress-test dimension, imposing a predefined distribution shift at batch 120 and tracking how each method responded. The proposed method’s threshold trajectories revealed smooth, bounded evolution driven by the uncertainty component of the feedback loop, and a criterion-based recovery measure quantified how many batches were needed for F1 to return to at least 95 percent of its pre-shift level. An ablation study disentangled the contributions of the adaptive gate, the adaptive feature thresholds, and the drift signal, showing that the full configuration achieved the best combination of F1, false-positive control, and temporal stability, while no single component dominated every metric. A sensitivity analysis over a grid of feedback coefficients confirmed that the nominal settings represent a stability-oriented operating point rather than a universally optimal choice.

The authors frame their contribution not as a replacement for model adaptation but as a distinct operating point in an accuracy–stability–efficiency trade-off. For resource-constrained edge devices, where GPU acceleration is unavailable and every millisecond counts, a detector that sacrifices a sliver of peak accuracy in exchange for fewer false alarms, smoother behavior over time, and dramatically lower update cost may be exactly the right bargain. The explicit threshold states also offer a form of operational transparency: an operator can inspect how gate sensitivity evolves and, when the drift detector remains silent, know that observed threshold movement is attributable to uncertainty alone. The team acknowledges the limits of this transparency—it is not causal feature explanation—and points toward future work on feature-specific feedback controllers, hybrid schemes that trigger selective model updating under sustained change, and explicit adversarial evaluation. For now, the study offers a compelling demonstration that sometimes the smartest way to adapt a defender is not to rebuild it, but to nudge the line it draws.

Subject of Research: Feedback-guided decision-boundary adaptation for stable streaming intrusion detection in Internet of Things networks under distribution shift

Article Title: Feedback guided decision boundary adaptation for stable IoT intrusion detection under distribution shift

Article References: Nguyen, H.-C., Ta, T. M., Dao, N.-T., Nguyen, Q.-H., & Phung, T.-N. (2026). Feedback guided decision boundary adaptation for stable IoT intrusion detection under distribution shift. Discover Artificial Intelligence, 6(1), Article 1394. https://doi.org/10.1007/s44163-026-02370-1

Image Credits: AI Generated

DOI: 10.1007/s44163-026-02370-1

Keywords: Internet of Things, intrusion detection, distribution shift, concept drift, adaptive thresholding, decision boundary, feedback control, machine learning, streaming data, anomaly detection, cybersecurity, edge computing

The method, called Equation Discovery for Classification, or EDC, was developed by Guus Toussaint and Arno Knobbe of Leiden University. It extends a research tradition that has long flourished in regression: symbolic regression, the automated search for analytical formulas that fit numerical data. Theauthors of the study point out that equation discovery has historically been applied almost exclusively to problems where the target is a continuous number, such as recovering physical laws like the relationship between the pressure, volume, and temperature of a gas. Their contribution is to redirect that machinery toward binary classification, where the goal is to separate two classes cleanly and explainably.

The core idea is elegantly simple in concept. Rather than learning an opaque scoring function, EDC searches for a concise mathematical expression f(x) and a threshold theta, such that a data point is assigned to the positive class whenever f(x) meets or exceeds theta. For a linear equation, this is essentially the geometry underlying logistic regression or a linear support vector machine: a hyperplane slicing the feature space into two halves. What sets EDC apart is that the search is not confined to straight lines. By allowing nonlinear building blocks such as products of features and exponential terms, the algorithm can trace curved, interaction-driven boundaries while still producing an expression short enough for a domain expert to read, critique, and even correct by hand.

Technically, the framework rests on two pillars: a structured search and a dedicated numerical optimizer. The search space of candidate equations is defined by a configurable context-free grammar, a design choice inherited from classic work on declarative bias in equation discovery. The grammar constrains equations to sums of simple summands, including linear terms, products of two features, and exponential expressions, each parameterized by constants. Crucially, the grammar is redundancy-aware: constructions that would produce syntactically different but semantically identical equations are pruned in advance, since, for example, subtraction between summands is unnecessary when a constant coefficient can simply be negative. Traversing this space exhaustively is impossible for all but the smallest problems, so the algorithm employs beam search, iteratively refining the most promising candidate equations level by level while keeping only a fixed number of survivors at each stage.

Fitting the constants inside each candidate equation proved surprisingly subtle. Although every equation in the grammar is differentiable, gradient descent performed poorly in practice, largely because of the exponential terms that pepper the search space. The authors instead adopted a tailored hill-climbing procedure that first samples a large pool of random constant configurations, then concentrates its remaining budget on refining the best ones. In a systematic comparison against off-the-shelf optimizers from the SciPy library, including Powell, Cobyqa, Cobyla, Nelder-Mead, and stochastic gradient descent, this hill climber achieved the highest mean area under the ROC curve across one hundred randomly generated test problems. Perhaps most strikingly, a simple random-sampling baseline already reached a mean AUC of 0.9974 with a budget of one thousand evaluations, revealing that the inner optimization problem is more tractable than one might fear.

The experiments on synthetic data produced one of the study’s most intriguing findings. When Gaussian noise was injected into datasets whose generating decision boundaries were known, EDC did not merely match the original boundary; beyond a certain noise level it outperformed it. The explanation is a phenomenon the authors describe carefully: noise pushes data points near a curved boundary across it, and concave sections of that boundary collect more stray points than they lose, causing the effective boundary embedded in the data to drift away from its original position and gradually straighten. EDC, fitting the data rather than the hidden formula, tracks this shifted, smoothed boundary, achieving higher AUC than the very equation that generated the data. As noise grew from negligible to substantial across seventeen hundred artificial datasets, even a restricted linear version of EDC eventually beat the original nonlinear boundary.

The framework also proved capable of reconstructing notoriously difficult structures, including XOR-like and interaction-driven boundaries, and of fitting data produced by Gaussian clusters where no explicit target equation exists at all. On these cluster-based problems, which the authors describe as closest to real-world conditions among their artificial experiments, EDC outperformed existing symbolic classification approaches while landing near state-of-the-art black-box methods such as random forests, multi-layer perceptrons, and radial-basis-function support vector machines, all of which posted mean AUC values around 0.97.

Real-world benchmarks reinforced the pattern. Across nine binary classification datasets from the UCI repository, spanning tasks from banknote authentication to income prediction, EDC achieved a higher AUC than every competing equation-discovery-based classifier on every dataset, and beat simple decision trees across the board. A critical distance analysis showed that random forests, neural networks, and SVMs did not statistically significantly outperform EDC, even though those black-box methods won on several datasets, particularly ionosphere and sonar, where feature-class relationships appear to lie outside EDC’s current set of building blocks. On the Adult income dataset, the discovered equation offered a vivid demonstration of interpretability in action: one term acted as a penalty on years of education only when the individual appeared as a child in the household, while an exponential term over marital status effectively functioned as an if-else statement, adding roughly 28,586 to the score for married individuals living with a spouse and a negligible 8 otherwise.

The method’s main weakness is computational cost. In its default configuration, with a search depth of six and a beam width of ten, EDC takes dramatically longer than the sub-second runtimes of conventional classifiers, largely because pairwise interaction terms grow quadratically with the number of features and because one-hot encoding of categorical variables inflates the feature count. The authors show, however, that the expense is largely optional. Restricting the search depth, narrowing the beam, or replacing interaction terms with simple quadratic terms produced speed-ups of up to a factor of fifty at only a marginal loss of accuracy, with no statistically significant difference in performance across the benchmark suite. The authors also note that the framework is not limited to two classes: standard one-versus-rest schemes can extend EDC to multi-class problems, with each of the resulting equations explaining when a particular class label prevails.

The work arrives amid a broader movement toward explainable machine learning, driven by domains such as medicine, finance, and criminal justice where decisions carry real consequences and regulators increasingly demand justification. EDC offers a principled bridge between symbolic regression and classification, delivering models that are simultaneously compact, expressive, and auditable. While it may not dethrone random forests or deep networks on raw accuracy, it demonstrates that the gap is small enough, and the interpretability dividend large enough, that equations once again deserve a seat at the machine learning table. The authors have released their code, experimental setup, and datasets openly so that the entire study can be reproduced and the grammar extended by practitioners in new domains.

Subject of Research: Equation discovery for binary classification using interpretable symbolic decision boundaries

Article Title: Equation Discovery for Classification: Finding Interpretable Symbolic Specifications of the Decision Boundary

Article References: Toussaint, G., & Knobbe, A. (2026). Equation Discovery for Classification: Finding Interpretable Symbolic Specifications of the Decision Boundary. Machine Learning, 115(9), Article 215. https://doi.org/10.1007/s10994-026-07156-1

Image Credits: AI Generated

DOI: 10.1007/s10994-026-07156-1

Keywords: equation discovery, binary classification, symbolic regression, decision boundary, interpretable machine learning, beam search, symbolic classification, explainable AI, context-free grammar, UCI datasets, machine learning, Equation