Aug 2026· Universe· Vol 12, pp. 253· 0 citations· 36 references
TL;DR
Kolmogorov–Arnold networks are not efficient drop-in replacements for MLP emulators, but the large KAN tested here improved spectral emulation accuracy and residual-tail robustness.
Abstract
Kolmogorov–Arnold networks (KANs) replace the fixed activations of a multilayer perceptron (MLP) with learnable univariate edge functions. We evaluate KANs as Payne-style label-to-flux emulators using the public 1000-spectrum Kurucz grid released with The Payne. Two capacity-matched KAN–MLP pairs (approximately 2.3 and 18–19 million parameters) were tuned separately, trained for the same 120,000-update budget across three seeds, and evaluated on a fixed 200-spectrum holdout. At the smaller capacity, the KAN did not outperform the tuned MLP. At the larger capacity, KAN-L achieved the lowest flux errors among the models trained from scratch: its mean absolute error was 35% below the best small model, all three large-MLP layouts remained less accurate, and its residual tails were lighter. In injection–recovery tests, KAN-L improved the recovery of effective temperature, surface gravity, and metallicity at all the tested signal-to-noise ratios relative to the small matched MLP; the best large-MLP control was not included in this test. The learned KAN response shapes were reproducible across seeds. These gains required substantially greater training and inference costs. In an APOGEE Data Release 17 deployment, surface-gravity offsets decreased by approximately 0.09 dex for all the tested emulators when calibrated APOGEE Stellar Parameter and Chemical Abundances Pipeline (ASPCAP) values were replaced by the raw spectroscopic scale, indicating a common reference-scale contribution. KANs are therefore not efficient drop-in replacements for MLP emulators, but the large KAN tested here improved spectral emulation accuracy and residual-tail robustness.
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 scalin...
T. Čadež, Sanghoon Lee, Kyoung-Min Kim· 0 citations
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. We show that this choice conceals a large capability difference between architectures: ChebyKAN's test MSE (evaluated against cle...
Kolmogorov-Arnold Networks (KANs) represent a paradigmatic shift in deep learning by replacing fixed node activations with learnable univariate functions on edges, offering enhanced interpretability and parameter efficiency. While recent polynomial-based KAN variants have addressed the computational overhead of origina...
Physics-informed neural networks (PINNs) remain difficult to train for hyperbolic conservation laws. Artificial viscosity is a common remedy, and several methods reduce its coefficient during training. We examine adaptive moment estimation (Adam) followed by limited-memory Broyden–Fletcher–Goldfarb–Shanno (L-BFGS) opti...
S. Mukhambetzhanov, Y. Kenzhebek, S. D. Bekele et al.· Big Data and Cognitive Compu...· 0 citations
We employ equation-driven, physics-constrained deep learning to solve the fixed-boundary Grad-Shafranov (GS) equilibrium problem, constructing axisymmetric magnetohydrodynamic equilibria with tokamak-relevant characteristics. Equilibria across linear (Solov'ev) and nonlinear profile functions are constructed using Phys...
D. Kaltsas, A. Kuiroukidis, J. Liu et al.· 0 citations
This work encodes two conditions in an effective edge measure and shows that zero effective exposure exactly identifies Fisher-null directions within an edge, which is not a Fisher-based pruning criterion for KANs.
A. Tavory, Meir Feder· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.