SyncAI.news, a Varaisys broadcasting
Neural scaling laws and evolution of learnable activation functions of Kolmogorov-Arnold networks
TC

Tilen Cadez, Sanghoon Lee, Kyoung-Min Kim

· 1 min read

ResearcharXiv cs.LG

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

arXiv:2610.00985v1 Announce Type: new Abstract: Kolmogorov-Arnold Networks (KANs) represent a compelling alternative to traditional Multi-Layer Perceptron (MLP)-based neural networks. By employing activation functions as learnable elements, KANs offer superior interpretability, making them suited for scientific domains. In this work, we investigate the neural scaling laws of KANs and the structural evolution of their learnable activation functions under dataset expansion. Specifically, we evaluate the scaling behavior of three KAN variants---BSRBF-KAN, Gottlieb-KAN, and Faster-KAN---across standard image classification benchmarks (MNIST and Fashion-MNIST) and a specialized scientific regression task (magnetic parameter estimation from domain images of moir\'e magnetic textures). Our results demonstrate that the test loss ${\cal L}$ exhibits a broken neural scaling law (BNSL) behavior as a function of the dataset size $N_D$. After passing through a random-guess regime, the loss follows architecture- and task-dependent scaling behavior. The loss crosses from a faster- to a slower-scaling branch, ${\cal L}\propto N_D^{-\alpha}$ and ${\cal L}\propto N_D^{-\beta}$ with $\alpha>\beta$ for image classification tasks. The exponents $\alpha$ and $\beta$ depend strongly on both the specific network architecture and the dataset-size regime, ranging from 0.4 to 1.5 and from 0.06 to 0.6, respectively. For the magnetic parameter-regression task, the loss follows a single scaling law with its exponent ranging from 1.28 to 2.59. Additionally, we provide a structural analysis of how activation functions refine their complexity as data volume increases, finding that dataset expansion drives a transition from simple linear-like approximations toward stable, interpretable symbolic forms. These findings provide a quantitative roadmap for the efficient application of KANs while managing the trade-off between model expressivity and computational overhead.

Original source

This story was published by arXiv cs.LG and written by Tilen Cadez, Sanghoon Lee, Kyoung-Min Kim. SyncAI.news shows a preview; the complete article is on the publisher's site.

Read the full story on arxiv.org

Similar News