REVIEW 27 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
Signed reviews
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 27 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.
-
ChemKANs for Combustion Chemistry Modeling and Acceleration
ChemKANs, a physics-structured KAN-ODE network, infer chemical kinetic models from noisy data and accelerate hydrogen-air combustion chemistry with 344 parameters at 2x speedup.
-
PRKAN: Parameter-Reduced Kolmogorov-Arnold Networks
PRKAN lowers KAN parameter counts to near-MLP levels via attention, convolution/pooling, dimension summation, and feature-vector projections, reaching MLP-like accuracy on MNIST and Fashion-MNIST.
-
KKANs: Kurkova-Kolmogorov-Arnold Networks and Their Learning Dynamics
KKANs, a two-block KART-based architecture with MLP inner functions and basis-function outer functions, universally approximate continuous functions and empirically outperform MLP and cKAN baselines in regression, PIN...
-
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.
-
Efficient Implicit Neural Compression of Point Clouds via Learnable Activation in Latent Space
The proposed PICO/LeAFNet pipeline compresses point clouds by fitting two small neural networks with learnable activations, reporting 4.92 dB average BD-PSNR gain over MPEG codecs on 8iVFB.
-
MatrixKAN: Parallelized Kolmogorov-Arnold Network
MatrixKAN replaces KAN's recursive B-spline evaluation with precomputed matrix multiplications, making training time nearly independent of spline degree.
-
TimeKAN: KAN-based Frequency Decomposition Learning Architecture for Long-term Time Series Forecasting
A frequency-decomposing KAN architecture achieves state-of-the-art or near-state-of-the-art long-term forecasting on five of six datasets with 12-38K parameters.
-
KAA: Kolmogorov-Arnold Attention for Enhancing Attentive Graph Neural Networks
Swapping attentive GNN score mappings for a single-layer Kolmogorov-Arnold Network improves benchmark performance and, on a specially constructed input matrix, provably achieves zero maximum ranking error.
-
Interpretable deep learning illuminates multiple structures fluorescence imaging: a path toward trustworthy artificial intelligence in microscopy
AEMS-Net, a U-Net variant with KAN convolutions, attention, and brightness adaptation, reconstructs mitochondrial and microtubule images from one fluorescence image and reports large gains over vanilla U-Net.
-
Learnable Activation Functions in Physics-Informed Neural Networks for Solving Partial Differential Equations
Comparing fixed and learnable activations in PINNs across five PDEs shows learnable bases help in small networks, destabilize large ones, and low spectral bias does not guarantee accuracy.
-
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.
-
DAE-KAN: A Kolmogorov-Arnold Network Model for High-Index Differential-Algebraic Equations
DAE-KAN, a dual-network KAN-PINN, is reported to solve index-1 through index-3 differential-algebraic equations with one to two orders of magnitude lower error than MLP-based PINNs on two benchmark problems.
-
EFKAN: A KAN-Integrated Neural Operator For Efficient Magnetotelluric Forward Modeling
EFKAN, an FNO-branch with KAN-trunk neural operator, gives mixed but generally lower average L1 error than EFNO on synthetic 2D magnetotelluric forward modeling and is much faster than FDM.
-
Scaled-cPIKANs: Domain Scaling in Chebyshev-based Physics-informed Kolmogorov-Arnold Networks
Rescaling PDE spatial variables to [-1,1] before training Chebyshev-based physics-informed Kolmogorov-Arnold networks improves accuracy and convergence on wide oscillatory domains.
-
PowerMLP: An Efficient Version of KAN
PowerMLP is a ReLU-power MLP that trains about 40x faster than KAN in the reported benchmarks and often beats it, but the main proof that KANs are contained in PowerMLPs at the same depth is flawed.
Discussion (0). Continue with ORCID to comment.