Wave-BLS, a robust broad learning framework that integrates the wave loss function, which is asymmetric, bounded, and smooth, enabling controlled penalization of large errors, is proposed, establishing Wave-BLS as a stable and robust alternative to existing broad learning models for learning under data uncertainty.
Abstract
Broad Learning System (BLS) offers an efficient alternative to deep architectures by enabling fast learning through randomized feature mapping and closed-form solutions. However, its reliance on squared error loss makes it highly sensitive to noise, outliers, and corrupted labels, limiting its reliability in real-world scenarios. To address this limitation, we propose Wave-BLS, a robust broad learning framework that integrates the wave loss function, which is asymmetric, bounded, and smooth, enabling controlled penalization of large errors. The proposed formulation replaces the standard least-squares objective with a wave-loss-based optimization problem, solved efficiently using a Nesterov accelerated gradient (NAG)-based scheme without requiring matrix inversion, thereby improving scalability. Extensive experiments on 30 UCI benchmark datasets demonstrate that Wave-BLS consistently outperforms classical BLS and several robust variants. Statistical validation using Friedman and Nemenyi post-hoc tests confirms the significance of the observed improvements. Furthermore, robustness evaluations under controlled noise and outlier injection reveal that Wave-BLS exhibits substantially slower performance degradation compared to BLS, even in challenging contamination settings. These results establish Wave-BLS as a stable and robust alternative to existing broad learning models for learning under data uncertainty.
Feature selection in neural networks remains a challenging problem, particularly in the presence of noisy or contaminated data. LassoNet is a recent approach that addresses this issue by combining neural networks with hierarchical sparsity constraints, enabling simultaneous prediction and variable selection. However, i...
D. De Canditiis, I. De Feis, P. Stolfi· 0 citations
Experiments on UCI benchmark datasets validate the superiority of the proposed IFW-BLS model over the baseline models over the baseline models; additional corruption experiments also show more stable performance than BLS under noise and outlier contamination.
A GSR-enhanced robust sparse feature learning framework that derives stability control conditions for the GSR system, integrates a lightweight dual-branch architecture to fuse global convolutional features and local sparse spectral peak features, and constructs a Wasserstein-regularized dual-loss function to optimize t...
Xue Wen, Xue-Rui Zhang, Li-Feng Lin et al.· Measurement science and tech...· 0 citations
Sample-level reliability heterogeneity is common in deep time series learning. Standard training pipelines apply a uniform regularization setting to all samples, which can under-regularize corrupted samples and over-restrict clean samples. Common robustness approaches filter observations in data space or impose priors...
Si-Ru Zhong, Sen-Zhang Wang, James T. Kwok et al.· 0 citations
Due to the use of fixed loss weight allocation between different feature layers, unsupervised industrial surface anomaly detection often fails to capture multi-scale anomalies, resulting in the loss of fine-grained defects and severe background noise. To address this research gap, this paper proposes an unsupervised an...
Zhi-Xing Wu· ITM Web of Conferences· 0 citations
Related blog posts
MIT News · Artificial Intelligence· news.mit.eduOct 14, 2026
Learn how Google DeepMind and GovTech Singapore uses lightweight on-device Gemma models to intercept conversational scams in private chats with zero cloud data egress.
MIT News · Artificial Intelligence· news.mit.eduOct 13, 2026
Machine-learning networks can learn without detailed instructions from a designer. Those that do may offer insight into how the brain reorganizes itself during learning.