New Adaptive RBF-KAN Model Revolutionizes Multivariate Function Approximation

Published on May 22, 2026

The field of machine learning has long relied on Kolmogorov-Arnold Networks (KANs) to approximate complex multivariate functions. Traditionally, these networks used B-spline bases, which are effective but computationally intensive. Researchers needed a solution that balanced performance with efficiency.

Recent developments introduced the FastKAN, an improved version of KANs that utilized Gaussian radial basis functions (RBFs). However, FastKAN’s reliance on a fixed kernel and shape parameter limited its adaptability. This restriction created a demand for more flexible approaches that could better accommodate varying data characteristics.

The latest study presents the adaptive RBF-KAN, which integrates a diverse range of radial basis kernels, including Matérn and Wendland functions. -one-out cross-validation for kernel shape initialization, this framework allows for data-driven kernel scaling that enhances performance during network training. Evaluations on benchmark functions showed significant improvements in handling smooth and complex function behaviors.

The introduction of adaptive kernel selection marks a significant advancement in RBF-KAN models. Researchers found that different kernels exhibited distinct advantages, proving that adaptability is key to effectively addressing various function types. This innovation could reshape how neural networks process data, paving the way for more efficient and accurate machine learning applications.

Related News