arXiv Machine Learning

Robust Dual-Model Collaborative Random Vector Functional Link Network

arXiv:2608. 13628v1 Announce Type: new 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.

arXiv Machine Learning
Aug 19

RoBell-RVFL: A Robust Generalized Bell Random Vector Functional Link Network

RoBell-RVFL is a lightweight, quality‑aware generalized bell random vector functional link network designed to address class imbalance and noisy data in real‑world datasets. It uses a dual‑strategy sample‑level weighting: unit weights preserve minority class information, while a probability‑weighted generalized bell membership function suppresses noisy majority samples in a kernel‑induced feature space. Experiments on UCI and KEEL benchmarks, including tests with up to 40% label noise, show that RoBell‑RVFL consistently outperforms recent RVFL variants, demonstrating the importance of adaptive, quality‑aware sample weighting for robust learning.

By A. Rahaman, A. Quadir, M. Tanveer
arXiv AI
Sep 16

A unified framework for global and local interpretability using adaptive derivative-ordered random explanation

The paper introduces Adaptive Derivative-Ordered Random Explanation (ADORE), a unified framework that uses first- and second-order derivatives to capture nonlinear feature interactions and feature-sample dynamics. ADORE combines global feature importance with local sample contributions, quantifying both magnitude and direction of feature impact while identifying critical samples. It achieves computational efficiency via randomized SVD and dynamic sparsity detection, outperforming LIME and SHAP across tabular, text, and image data, and is released as an open-source Python package on GitHub.

By Lemen Chao, Ming Lei, Anran Fanga
arXiv Machine Learning
Jul 27

Smart predict-then-robustly-optimize

arXiv:2607. 21773v1 Announce Type: new Abstract: In this paper, we propose and study a robust variant of the smart predict-then-optimize approach that accounts for prediction shifts due to disturbance in the covariate feature space.

By Aakil Caunhye, Xuefei Lu, Belen Martin-Barragan
arXiv Machine Learning
Jul 13

Spectrally Deconfounded Gradient Boosting

arXiv:2607. 09371v1 Announce Type: cross Abstract: Flexible machine-learning methods can be sensitive to hidden confounding: they may learn associations induced by unobserved confounders rather than stable signals.

By Andrea Nava, Peter B\"uhlmann, Fabio Sigrist
arXiv Computer Vision
Sep 18

Fast Preemptive Robustification: High-Frequency Response Anti-Aligns Shared Vulnerability

The paper introduces Fast Preemptive Robustification (FPR), a lightweight defense that enhances the robustness of deep neural networks against transferable adversarial attacks. By sharpening Laplacian responses through a single 3×3 channel‑wise convolution, FPR eliminates the need for surrogate models, iterative optimization, or specialized training. Experiments show that FPR lowers untargeted attack success rates by 12.7% and reduces targeted attack success from 10.7% to 4.1%.

By Jiaming Liang, Chi-Man Pun
arXiv Machine Learning
Jun 17

Eigen-Spike Emergence and Quadratic Equivalents for Conjugate Kernels on Nonlinearly Separable Data

arXiv:2605. 29669v2 Announce Type: replace-cross Abstract: Recent work in random matrix theory (RMT) has developed the notion of deterministic equivalents: typically linear surrogate models that approximate the spectral behavior of large nonlinear random matrices, such as nonlinear feature maps in neural networks (NNs).

By Collin Cranston, Zhichao Wang, Todd Kemp, Michael W. Mahoney