Function Fitting Based on Kolmogorov-Arnold Theorem and Kernel Functions
Jianpeng Liu, Qizhi Pan
TL;DR
This work establishes a unified kernel-based framework that reframes Kolmogorov-Arnold Networks and self-attention as kernel expansions, enabling a common function-fitting perspective anchored by $f(\mathbf{x})=\sum_{h=1}^{H}\phi_h(\sum_{d=1}^D\psi_{h,d}(x_d))$ with $H=2D+1$. It then develops kernel-based MHSA variants, notably a low-rank Pseudo-MHSA that reduces parameters by about 23% and a Gaussian-MHSA that validates nonlinear kernel benefits, both integrated into a ViT/MAE-style encoder. Empirical results on CIFAR-10 under MAE show Semi-Fusion achieving the highest accuracy among the variants (0.8243 versus a 0.8162 baseline), while Gaussian-MHSA offers a lightweight option with competitive performance. The work further demonstrates a convolutional interpretation of attention within the kernel framework and discusses implications for efficient Transformers and future extensions to larger multimodal tasks.
Abstract
This paper proposes a unified theoretical framework based on the Kolmogorov-Arnold representation theorem and kernel methods. By analyzing the mathematical relationship among kernels, B-spline basis functions in Kolmogorov-Arnold Networks (KANs) and the inner product operation in self-attention mechanisms, we establish a kernel-based feature fitting framework that unifies the two models as linear combinations of kernel functions. Under this framework, we propose a low-rank Pseudo-Multi-Head Self-Attention module (Pseudo-MHSA), which reduces the parameter count of traditional MHSA by nearly 50\%. Furthermore, we design a Gaussian kernel multi-head self-attention variant (Gaussian-MHSA) to validate the effectiveness of nonlinear kernel functions in feature extraction. Experiments on the CIFAR-10 dataset demonstrate that Pseudo-MHSA model achieves performance comparable to the ViT model of the same dimensionality under the MAE framework and visualization analysis reveals their similarity of multi-head distribution patterns. Our code is publicly available.
