Pith. sign in

REVIEW 5 cited by

Kolmogorov-Arnold Graph Neural 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

arxiv 2406.18354 v2 pith:UOLKVVBH submitted 2024-06-26 cs.LG cs.AI

Kolmogorov-Arnold Graph Neural Networks

classification cs.LG cs.AI
keywords gkangraphinterpretabilityaccuracyclassificationdecision-makingdomainskolmogorov-arnold
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original abstract

Graph neural networks (GNNs) excel in learning from network-like data but often lack interpretability, making their application challenging in domains requiring transparent decision-making. We propose the Graph Kolmogorov-Arnold Network (GKAN), a novel GNN model leveraging spline-based activation functions on edges to enhance both accuracy and interpretability. Our experiments on five benchmark datasets demonstrate that GKAN outperforms state-of-the-art GNN models in node classification, link prediction, and graph classification tasks. In addition to the improved accuracy, GKAN's design inherently provides clear insights into the model's decision-making process, eliminating the need for post-hoc explainability techniques. This paper discusses the methodology, performance, and interpretability of GKAN, highlighting its potential for applications in domains where interpretability is crucial.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 5 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. QKAN: quantum Kolmogorov-Arnold networks with applications in machine learning and multivariate state preparation

    quant-ph 2024-10 unverdicted novelty 7.0

    QKAN is a quantum algorithmic framework using block-encodings and QSVT to implement wide-and-shallow networks for quantum learning and compositional state preparation.

  2. Variational Kolmogorov-Arnold Network

    cs.LG 2025-07 unverdicted novelty 6.0

    InfinityKAN is a variational inference method that learns the number of basis functions per layer in KANs during training, matching or exceeding fixed-basis KAN performance across 18 datasets without manual selection.

  3. KAN Text to Vision? The Exploration of Kolmogorov-Arnold Networks for Multi-Scale Sequence-Based Pose Animation from Sign Language Notation

    cs.CV 2026-05 unverdicted novelty 5.0

    KANMultiSign generates sign language poses from notation via coarse-to-fine multi-scale supervision and compact KAN-Transformer modules, achieving lower DTW joint error with fewer parameters than baselines on several ...

  4. Singularity Formation: Synergy in Theoretical, Numerical and Machine Learning Approaches

    math.NA 2026-04 unverdicted novelty 5.0

    The work introduces a modulation-based analytical method for singularity proofs in singular PDEs and refines ML techniques like PINNs and KANs to identify blowup solutions, with application to the open 3D Keller-Segel...

  5. Automated Modeling Method for Pathloss Model Discovery

    cs.LG 2025-05 unverdicted novelty 5.0

    Automated methods based on Deep Symbolic Regression and Kolmogorov-Arnold Networks discover compact, interpretable path loss models that achieve high accuracy and reduce prediction errors by up to 75% compared to trad...