Adaptive RBF-KAN: A Comparative Evaluation of Dynamic Shape Parameters in Kolmogorov-Arnold Networks

• URL: http://arxiv.org/abs/2605.21534v1
• Date: Wed, 20 May 2026 01:28:34 GMT
• Title: Adaptive RBF-KAN: A Comparative Evaluation of Dynamic Shape Parameters in Kolmogorov-Arnold Networks
• Abstract summary: We introduce a broader family of radial basis kernels and initializing the kernel shape parameter using leave-one-out cross-validation (LOOCV)<n>To the best of our knowledge, this is the first study that integrates LOOCV-based kernel scale estimation with deep KAN training.<n>The proposed adaptive RBF-KAN is evaluated on several two-dimensional benchmark functions.
• Score: 39.58172554437255
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Kolmogorov-Arnold Networks (KANs) approximate multivariate functions using learnable univariate edge functions, typically parameterized by B-spline bases. Although effective, spline-based implementations can be computationally expensive. A modified version of KANs, called FastKAN, improves efficiency by replacing splines with Gaussian radial basis functions (RBFs), but it relies on a fixed kernel and shape parameter. In this work, we extend the RBF-based KAN framework by introducing a broader family of radial basis kernels and by initializing the kernel shape parameter using leave-one-out cross-validation (LOOCV). To the best of our knowledge, this is the first study that integrates LOOCV-based kernel scale estimation with deep KAN training. We also introduce Matérn and Wendland kernels into the KAN framework for the first time, enabling more flexible basis representations beyond the Gaussian kernel used in FastKAN. The LOOCV estimate provides a data-driven initialization of the kernel scale, which is subsequently refined during network training. The proposed adaptive RBF-KAN is evaluated on several two-dimensional benchmark functions. The results highlight the importance of kernel selection and adaptive shape parameters, with different kernels showing advantages for smooth functions, discontinuities, and oscillatory patterns. Overall, combining LOOCV-based initialization with adaptive kernel learning provides a practical strategy for improving RBF-based KAN models.

Related papers

• Partition-of-Unity Gaussian Kolmogorov-Arnold Networks [0.0]
  We introduce the partition-of-unity Gaussian KAN (PU-GKAN) in which the Gaussian basis values on each edge are divided by their local sum over fixed centers.<n>This produces a partition-of-unity feature map with trainable coefficients, while preserving the standard edge-based KAN structure.<n> Numerical experiments show that PU-GKAN reduces sensitivity to (), improves validation accuracy for most smooth and moderately non-smooth targets, and gives more stable training behavior.
  arXiv  Detail & Related papers  (2026-04-26T08:24:03Z)
• Free-RBF-KAN: Kolmogorov-Arnold Networks with Adaptive Radial Basis Functions for Efficient Function Learning [2.2851922041620587]
  Kolmogorov-Arnold Networks (KANs) have shown strong potential for efficiently approximating complex nonlinear functions.<n>The original KAN formulation relies on B-spline basis functions, which incur substantial computational overhead due to De Boor's algorithm.<n>We propose Free-RBF-KAN, a RBF-based KAN architecture that incorporates adaptive learning grids and trainable smoothness to close this performance gap.
  arXiv  Detail & Related papers  (2026-01-12T17:45:31Z)
• Function Spaces Without Kernels: Learning Compact Hilbert Space Representations [17.20282687120807]
  We show that function encoders provide a principled connection to feature learning and kernel methods.<n>We develop two training algorithms that learn compact bases.<n>This work suggests a path toward neural predictors with kernel-level guarantees.
  arXiv  Detail & Related papers  (2025-09-24T22:55:52Z)
• Generalization Bound of Gradient Flow through Training Trajectory and Data-dependent Kernel [55.82768375605861]
  We establish a generalization bound for gradient flow that aligns with the classical Rademacher complexity for kernel methods.<n>Unlike static kernels such as NTK, the LPK captures the entire training trajectory, adapting to both data and optimization dynamics.
  arXiv  Detail & Related papers  (2025-06-12T23:17:09Z)
• Enhancing Kernel Flexibility via Learning Asymmetric Locally-Adaptive Kernels [35.76925787221499]
  This paper introduces the concept of Locally-Adaptive-Bandwidths (LAB) as trainable parameters to enhance the Radial Basis Function (RBF) kernel. The parameters in LAB RBF kernels are data-dependent, and its number can increase with the dataset. This paper for the first time establishes an asymmetric kernel ridge regression framework and introduces an iterative kernel learning algorithm.
  arXiv  Detail & Related papers  (2023-10-08T17:08:15Z)
• Promises and Pitfalls of the Linearized Laplace in Bayesian Optimization [73.80101701431103]
  The linearized-Laplace approximation (LLA) has been shown to be effective and efficient in constructing Bayesian neural networks. We study the usefulness of the LLA in Bayesian optimization and highlight its strong performance and flexibility.
  arXiv  Detail & Related papers  (2023-04-17T14:23:43Z)
• A Robust Asymmetric Kernel Function for Bayesian Optimization, with Application to Image Defect Detection in Manufacturing Systems [2.4278445972594525]
  We propose a robust kernel function, Asymmetric Elastic Net Radial Basis Function (AEN-RBF) We show theoretically that AEN-RBF can realize smaller mean squared prediction error under mild conditions. We also show that the AEN-RBF kernel function is less sensitive to outliers.
  arXiv  Detail & Related papers  (2021-09-22T17:59:05Z)
• Random Features for the Neural Tangent Kernel [57.132634274795066]
  We propose an efficient feature map construction of the Neural Tangent Kernel (NTK) of fully-connected ReLU network. We show that dimension of the resulting features is much smaller than other baseline feature map constructions to achieve comparable error bounds both in theory and practice.
  arXiv  Detail & Related papers  (2021-04-03T09:08:12Z)
• Flow-based Kernel Prior with Application to Blind Super-Resolution [143.21527713002354]
  Kernel estimation is generally one of the key problems for blind image super-resolution (SR) This paper proposes a normalizing flow-based kernel prior (FKP) for kernel modeling. Experiments on synthetic and real-world images demonstrate that the proposed FKP can significantly improve the kernel estimation accuracy.
  arXiv  Detail & Related papers  (2021-03-29T22:37:06Z)
• Finite Versus Infinite Neural Networks: an Empirical Study [69.07049353209463]
  kernel methods outperform fully-connected finite-width networks. Centered and ensembled finite networks have reduced posterior variance. Weight decay and the use of a large learning rate break the correspondence between finite and infinite networks.
  arXiv  Detail & Related papers  (2020-07-31T01:57:47Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.