M-estimation activation functions for high-performance extreme learning machine ensemble classification

Machine learning plays a pivotal role in addressing real-world challenges across domains such as cybersecurity, where AI-driven methods, especially in Software-Defined Networking, enhance traffic monitoring and anomaly detection. Contemporary networks often employ models like Random Forests, Neural Networks, and Support Vector Machines to identify threats early and reinforce security. Ensemble learning further improves predictive accuracy and stability, yet many frameworks falter when confronted with noisy or contaminated data. In this study, we propose a robust ensemble framework for Extreme Learning Machines (ELMs) that integrates a family of redescending ψ-activation functions grounded in M-estimation theory. Each ψ-function yields a distinct base classifier, initialized with random weights, and the optimal hidden-node count is selected via grid search minimizing the Brier score. Rather than traditional voting, ensemble outputs are combined through a least-squares optimization, allowing precise parameter estimation and enhanced stability. We validate our method on five benchmark datasets, SatImage, Email-Spamdexing, Breast Cancer, Musk, and Iris, demonstrating consistently superior accuracy and reduced variance compared to existing ELM ensembles. Rigorous statistical testing (Kruskal-Wallis with Dunn's post-hoc comparisons) confirms these gains. Our results show that embedding robust M-estimator-based activations within a controlled ensemble yields marked improvements in generalization, predictive precision, and resilience to data irregularities, offering a significant advancement in the design of efficient neural classifiers.