arXiv AI By Harshil Lodhiya

ER-KANs: Efficient and Robust Kolmogorov-Arnold Networks for Data-Scarce Scientific Machine Learning

Read the original on arXiv AI →

arXiv:2608. 14773v1 Announce Type: cross Abstract: The efficient-KAN literature---covering Chebyshev, wavelet, and radial-basis-function variants of the original Kolmogorov-Arnold Network---has been benchmarked almost entirely on clean data.

Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv AI.

arXiv Machine Learning
Aug 4

An Embedded RISC-V Evaluation of Kolmogorov--Arnold Networks in Hard-Constrained Recurrent Physics-Informed Models

arXiv:2608. 00737v1 Announce Type: new Abstract: Hard-constrained recurrent physics-informed networks (HRPINNs) embed known dynamics inside a recurrent numerical integrator and restrict a neural branch to learning only the residual dynamics that the first-principles model does not capture.

By Enzo Nicolas Spotorno, Josafat Leal Filho
arXiv Machine Learning
1d ago

Neural scaling laws and evolution of learnable activation functions of Kolmogorov-Arnold networks

The paper studies Kolmogorov‑Arnold Networks (KANs), a neural architecture that treats activation functions as learnable components, offering improved interpretability for scientific applications. It investigates how KANs scale with dataset size on image classification tasks (MNIST, Fashion‑MNIST) and a magnetic‑parameter regression task, revealing a broken neural scaling law that transitions from a faster to a slower decay of test loss as data grows. The authors also analyze how the learned activation functions evolve from simple linear approximations to more complex, interpretable symbolic forms as more data is provided.

By Tilen Cadez, Sanghoon Lee, Kyoung-Min Kim
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