The kernel risk-sensitive mean p-power based RVFL (KRPRVFL) model is proposed, which integrates the computational efficiency of RVFL with the robustness of the kernel risk-sensitive mean p-power (KRP) criterion and adaptively reduces the influence of corrupted or unreliable samples during training, resulting in improved stability and generalization.
Abstract
Random vector functional link (RVFL) networks are lightweight and fast neural models that offer efficient training and strong generalization through randomized hidden-layer weights and direct input-output connections. However, conventional RVFL models are sensitive to noisy labels, outliers, and imbalanced data, which limits their performance in real-world applications. To address these challenges, we propose the kernel risk-sensitive mean p-power based RVFL (KRPRVFL) model, which integrates the computational efficiency of RVFL with the robustness of the kernel risk-sensitive mean p-power (KRP) criterion. By replacing the standard least-squares objective with a KRP-based loss, KRPRVFL adaptively reduces the influence of corrupted or unreliable samples during training, resulting in improved stability and generalization. Additionally, a collaborative learning mechanism is introduced to enable adaptive interaction among model components, further enhancing robustness in complex and noisy environments. The proposed framework also leverages kernel-induced feature mapping to capture nonlinear relationships without requiring explicit hidden-layer selection, maintaining both efficiency and scalability. Extensive experiments on UCI and KEEL benchmark datasets demonstrate that KRPRVFL consistently outperforms baseline models in terms of accuracy, robustness, and statistical significance, highlighting its effectiveness as a fast, scalable, and reliable solution for challenging classification tasks.
RoBell-RVFL is proposed, a robust and lightweight generalized bell random vector functional link network that redefines how randomized models handle class imbalance and noisy data and achieves adaptive control over sample contributions without sacrificing the closed-form learning efficiency of RVFL networks.
Extensive experiments conducted on UCI and KEEL benchmark datasets demonstrate the superiority of the proposed IF-dRVFL and IF-edRVFL models over existing SOTA fuzzy and non-fuzzy approaches.
M. Sajid, A. Quadir, A. Rahaman et al.· 0 citations
Random vector functional link (RVFL) networks have gained considerable attention as efficient randomized learning models due to their fast training and simple architecture. However, classical RVFL still suffers from three fundamental limitations: the reliance on the squared loss makes it highly vulnerable to noise and...
Kausar Ali, M. Akhtar, A. Zafar et al.· IEEE transactions on fuzzy s...· 0 citations
Random Vector Functional Link (RVFL) networks provide an efficient randomized learning framework for classification. Existing multi-view RVFL methods utilize complementary information from multiple views. However, preserving view-specific geometric structure, limiting the influence of large prediction residuals, and mo...
Structured pruning of large language models (LLMs) offers hardware-efficient compression, yet existing methods require calibration data, gradient computation, or large auxiliary policy networks at pruning time. LILA (\emph{Latent-Informed Layer Analysis}) scores neuron importance via the Kolmogorov--Smirnov (KS) distan...
Sankar Behera, D. Singh, Anshika Agnihotri et al.· 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.
M. Akhtar, M. Tanveer· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.