---
title: Kolmogorov-Arnold Graph Neural Networks
url: https://www.emergentmind.com/topics/kolmogorov-arnold-graph-neural-networks-kagnns
type: topic
---

# Kolmogorov-Arnold Graph Neural Networks

Kolmogorov-Arnold Graph Neural Networks (KAGNNs) are a class of graph neural network architectures that instantiate the Kolmogorov–Arnold superposition theorem within the message-passing or convolutional paradigm of GNNs. By systematically replacing traditional linear weights and fixed activation functions with learnable univariate non-linear maps—typically parameterized as splines, polynomials, or Fourier bases—KAGNNs achieve enhanced representational capacity, theoretical universality, and explicit interpretability over standard MLP-based GNNs. These models have demonstrated superior performance and interpretability across node classification, link prediction, graph classification/regression, contrastive learning, and domain-specific biomedical and material science applications.

## 1. Mathematical Foundations: Kolmogorov–Arnold Decomposition

KAGNNs are motivated by the Kolmogorov–Arnold superposition theorem, which states that any continuous multivariate function $f:[0,1]^n \to \mathbb{R}$ can be decomposed as
\[
f(x_1, \ldots, x_n) = \sum_{q=1}^{2n+1} \Phi_q\left(\sum_{p=1}^n \phi_{q,p}(x_p)\right)
\]
where $\phi_{q,p}$ and $\Phi_q$ are continuous univariate functions. Unlike conventional neural networks that employ weight matrices and fixed activations, a Kolmogorov–Arnold Network (KAN) replaces each scalar weight by a trainable univariate function, effectively expanding the expressivity and flexibility of each connection [2406.06470, 2406.13597, 2406.18354]. This approach provides a universal function approximator using only sums and compositions of univariate nonlinearities [2406.18354].

## 2. General KAGNN Layer Designs and Algorithmic Structure

Within KAGNNs, the core layer replaces the typical linear/MLP transformation and elementwise activation with a bank of learnable univariate functions. Specifically, for an input vector $\mathbf{x} \in \mathbb{R}^d$, the KAN layer computes
\[
y_j = \sum_{i=1}^{d} \phi_{j,i}(x_i)
\]
where each $\phi_{j,i}: \mathbb{R} \to \mathbb{R}$ is parameterized as a spline, polynomial, or (optionally) via alternative bases such as radial basis functions or Fourier series [2406.06470, 2406.18354, 2410.11323, 2506.06296, 2406.18380].

KAGNN layers are inserted into standard GNN architectures in place of MLPs within node-update or attention-scoring modules. For message-passing GNNs, both GCN- and GIN-like variants implement
\[
h_v^{(\ell+1)} = \text{KAN}\left(\sum_{u\in \mathcal N(v)} \text{aggregation}(h_u^{(\ell)})\right)
\]
Multiple KAGNN layers can be stacked, and readout can either be a standard permutation-invariant pooling or an additional KAN layer [2406.18380, 2410.11323, 2505.15103].

Architectural innovations include:
- **Spline-based edge and node activations**: Each edge or node update employs a learnable spline function, with coefficients learned by backpropagation [2406.18354].
- **KAN-augmented attention**: The neighbor-scoring function in attentive GNNs (e.g., GAT) is replaced by a KAN module, resulting in Kolmogorov–Arnold Attention (KAA), which can universally approximate any ranking over the neighbors [2501.13456].
- **Domain-adaptive basis selection**: B-splines, RBFs, Fourier, and Jacobi polynomial bases are all used to instantiate KAN layers, depending on the smoothness/structure of the application [2410.11323, 2506.06296].

## 3. Learning, Parameterization, and Expressivity

Each univariate map is parameterized as a weighted sum of basis functions. For B-splines of degree $p$ on a grid of $g$ intervals:
\[
\phi(x) = w_b \cdot b(x) + w_s \cdot \sum_{k=1}^K c_k B_k(x)
\]
where $b(x)$ is a fixed residual basis (e.g., SiLU), $B_k$ are spline basis functions, and $w_b, w_s, c_k$ are trainable parameters [2406.06470, 2406.18354, 2410.11323]. Fourier-based KANs represent each $\phi_{j,i}$ as
\[
\phi_{j,i}(x) = \sum_{k=1}^K \left( A_{k,j,i}\cos(kx) + B_{k,j,i}\sin(kx) \right)
\]
yielding explicit capacity control and interpretability [2410.11323].

The expressive power of KAGNNs is formally connected to the maximum ranking distance (MRD) metric for neighbor scoring: a single-layer KAN with zero-order B-splines can approximate any permutation of neighbors, surpassing the expressivity of linear or shallow MLP scoring [2501.13456]. This universality is reflected in both theoretical analysis and consistent empirical gains across tasks, especially under parameter constraints or low-label regimes [2406.18354, 2406.18380].

## 4. Empirical Results and Application Benchmarks

KAGNNs consistently outperform or match state-of-the-art conventional GNNs in node, link, and graph-level tasks:

| Dataset/Task            | GCN           | GIN          | GAT         | KAGNN Variant                | Result Type           |
|-------------------------|---------------|--------------|-------------|------------------------------|----------------------|
| Cora (classif.)         | 76.3%         | 60.0%        | 78.9%       | KAGIN 81.2%, KAGIN 76.2%     | Accuracy             |
| PubMed (classif.)       | 77.4%         | —            | 78.2%       | KAGIN 81.0%                  | Accuracy             |
| MUTAG (graph classif.)  | GIN 85.1%     | —            | 75.1%       | KAGIN 85.5%                  | Accuracy             |
| ModelNet40 (3D, OA)     | 84.5% (MLP-DG)| —            | —           | Jacobi-KAN 87.3%             | Overall Accuracy     |
| CHILI-3K (materials)    | 0.367/0.496*  | 0.587*       | —           | KAGCN 0.995, KAEdgeCNN 0.976 | F1 (classification)  |
| ADNI (Alzheimer's)      | 57.4% (GCN)   | —            | —           | GCN-KAN 62.6%                | Accuracy             |
| Multi-omics (cancer)    | 95.5% (1D CNN)| 94.6% (GCNN) | —           | MOGKAN 96.3%                 | Accuracy             |

*\* denotes task-specific GIN/EdgeCNN on atom-type task*  
KAGNNs also achieve strong performance in graph regression (e.g., reduced MAE on ZINC and QM9), and contrastive self-supervised graph learning (up to +2% ROC-AUC over GraphCL on MoleculeNet) [2406.18354, 2410.11323, 2505.15103, 2512.19494, 2504.00946, 2503.22939].

KAGNNs show particular strength in non-Euclidean and scientific domains: molecular property prediction [2410.11323], complex multi-omics classification [2503.22939], inorganic nanomaterial discovery [2512.19494], and neuroimaging-based diagnostics [2504.00946].

## 5. Interpretability and Theoretical Insights

A key property of KAGNNs is inherent interpretability. Since all nonlinear transformations are explicit, learnable univariate functions, it is possible to:
- **Plot the learned splines or polynomial expansions** to directly observe the transformation applied to input features or aggregated neighbor representations [2406.18354].
- **Inspect attention and importance attributions**: In KAA-based attention, the learned B-spline coefficients for each neighbor map directly correspond to ranking importance, yielding nearly arbitrary ranking capacity and fidelity [2501.13456].
- **Direct feature/biomarker identification**: Models such as MOGKAN enable attribution of output decisions to individual feature transformations, validated via biological pathway analysis [2503.22939].

Pruning of nearly-zero spline coefficients can further simplify models and support symbolic interpretability [2406.18354].

## 6. Limitations, Hyperparameter Sensitivity, and Ongoing Challenges

Despite empirical and interpretability gains, KAGNNs introduce several new challenges:
- **Computational overhead**: Evaluating splines (and especially high-order polynomials or large basis expansions) is substantially slower than standard matrix multiplications, with per-epoch costs 10–100× higher in some settings [2406.18354, 2406.06470, 2506.06296].
- **Parameter efficiency vs. expressivity trade-off**: Larger grid size, spline order, or basis expansions improve representational power but rapidly increase memory and learning complexity [2406.18380, 2512.19494].
- **Hyperparameter selection**: Grid size, basis order, and basis type require careful tuning; higher-order polynomial bases are not always beneficial and may introduce overfitting or instability [2506.06296].
- **Scaling**: Some architectures (e.g., KAEdgeCNN on large graphs) present RAM bottlenecks, motivating further development of lightweight or sparsely parameterized KAN kernels [2512.19494].
- **Sensitivity to input normalization**: Some datasets (e.g., ENZYMES) require feature normalization for stable KAGNN training [2406.18380].

Future research includes efficient GPU kernels for spline evaluation, adaptive basis choice, residual or attention-enhanced message passing, and large-scale deployment [2406.13597, 2406.18380, 2512.19494, 2410.11323, 2505.15103].

## 7. Broader Impact and Application Scope

KAGNNs have found rapid adoption in emerging scientific ML domains where the function to be learned is known to be highly structured and non-Euclidean, and where interpretability is essential. They enable state-of-the-art accuracy in drug discovery, materials science, medical diagnostics, and multi-omics integration, and have established new SOTA results on large molecular and materials datasets [2410.11323, 2512.19494, 2503.22939]. The model’s flexibility in basis choice—B-splines, Fourier, RBFs, Jacobi polynomials—allows domain-informed inductive biases, while the explicit function-form design unlocks transparent post-training analysis.

The KAGNN paradigm unifies theoretical universality, strong empirical results, and interpretability in graph deep learning, opening new avenues for the principled design of expressive, transparent GNN architectures [2406.06470, 2406.18354, 2406.13597, 2501.13456, 2512.19494].

Source: https://www.emergentmind.com/topics/kolmogorov-arnold-graph-neural-networks-kagnns