REVIEW 14 cited by
Kolmogorov-Arnold Networks are Radial Basis Function Networks
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
read the original abstract
This short paper is a fast proof-of-concept that the 3-order B-splines used in Kolmogorov-Arnold Networks (KANs) can be well approximated by Gaussian radial basis functions. Doing so leads to FastKAN, a much faster implementation of KAN which is also a radial basis function (RBF) network.
Forward citations
Cited by 14 Pith papers
-
Kolmogorov--Arnold Networks for Small Language Models
In small language models, KAN feed-forward blocks are auditable and pruneable, but on standardized benchmarks and scale tests they show no consistent accuracy, quality, or latency advantage over MLP baselines.
-
A holomorphic Kolmogorov-Arnold network framework for solving elliptic problems on arbitrary 2D domains
A boundary-only holomorphic KAN framework solves Laplace, Helmholtz, and elasticity problems on simply and multiply connected 2D domains, outperforming standard PINNs in the tested cases.
-
Fast, accurate, and differentiable: a neural-network surrogate for NRSur7dq4 precessing binary black hole waveforms
A piecewise MLP surrogate emulates NRSur7dq4 over its full domain at NR-faithful accuracy with ~1 ms GPU latency and a fully differentiable JAX likelihood pipeline.
-
Improving Memory Efficiency for Training KANs via Meta Learning
MetaKANs generates each KAN activation function from a shared prompt-conditioned meta-learner, cutting trainable parameters toward MLP level while retaining comparable or better accuracy on tested benchmarks.
-
Sinusoidal Approximation Theorem for Kolmogorov-Arnold Networks
The paper states universal approximation theorems for sine-based Kolmogorov-Arnold networks, but the proof relies on an invalid lemma and an unproven matrix invertibility.
-
Physics-Informed PointNets for Modeling Electromagnetic Scattering from All-Dielectric Metasurfaces with Inclined Nanopillars
A physics-informed PointNet that encodes spatially varying permittivity predicts near-field and far-field scattering from metasurfaces with inclined nanopillars, reaching 1.7% MAPE for low-contrast 2D cases.
-
Multi-Resolution Training-Enhanced Kolmogorov-Arnold Networks for Multi-Scale PDE Problems
MR-PIKAN, a multi-resolution training schedule that alternates coarse and fine collocation grids, cuts training time while keeping accuracy on multi-scale forward and inverse PDE problems.
-
Neural Tangent Kernel Analysis to Probe Convergence in Physics-informed Neural Solvers: PIKANs vs. PINNs
The first NTK analysis of cPIKANs finds their kernel spectra stay stable during training, correlating with large accuracy gains over PINNs, especially when time is split into subdomains.
-
"KAN you hear me?" Exploring Kolmogorov-Arnold Networks for Spoken Language Understanding
Placing a KAN layer between two linear layers improves spoken language understanding accuracy over linear-only baselines on several speech-intent datasets.
-
PG-KINN: A Physics-Informed Petrov-Galerkin Kolmogorov-Arnold Network for Solving Forward and Inverse PDEs
PG-KINN pairs a KAN trial space with a Petrov–Galerkin test space for forward and inverse PDEs, but the inverse benchmark data is inconsistent with the governing equation and the accuracy claims are not supported by t...
-
STKAN: Kolmogorov-Arnold Networks for Spatio-Temporal Forecasting
STKAN inserts Taylor-polynomial KAN token mixers into spatial and temporal mixing blocks and achieves small but consistent gains over strong baselines on three traffic-flow benchmarks and a tie on a fourth.
-
SechKAN: Kolmogorov-Arnold Networks with Hyperbolic Secant Functions
SechKAN combines sech basis functions with a 1D linear projection to build a KAN-style model whose parameter count matches MLPs and which is competitive or better than several KAN variants on tested benchmarks.
-
Multi-Exit Kolmogorov-Arnold Networks: enhancing accuracy and parsimony
Augmenting Kolmogorov-Arnold Networks with prediction exits at each layer improves accuracy and often yields more parsimonious models, and a differentiable learning-to-exit algorithm automates the choice of exit weights.
-
Taylor expansion-based Kolmogorov-Arnold network for blind image quality assessment
A Taylor-expansion KAN variant outperforms B-spline, orthogonal-polynomial, wavelet, and Fourier KAN variants and MLPs on five authentic BIQA databases, with PCA and shallow layers reducing training cost.
Discussion (0). Continue with ORCID to comment.