Pith. sign in

REVIEW 1 cited by

GraphKAN: Enhancing Feature Extraction with Graph Kolmogorov Arnold 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.13597 v1 pith:S46452IT submitted 2024-06-19 cs.LG cs.AI

classification cs.LGcs.AI
keywords kansextractionfeaturegraphkannetworksactivationarnoldfunctions
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Massive number of applications involve data with underlying relationships embedded in non-Euclidean space. Graph neural networks (GNNs) are utilized to extract features by capturing the dependencies within graphs. Despite groundbreaking performances, we argue that Multi-layer perceptrons (MLPs) and fixed activation functions impede the feature extraction due to information loss. Inspired by Kolmogorov Arnold Networks (KANs), we make the first attempt to GNNs with KANs. We discard MLPs and activation functions, and instead used KANs for feature extraction. Experiments demonstrate the effectiveness of GraphKAN, emphasizing the potential of KANs as a powerful tool. Code is available at https://github.com/Ryanfzhang/GraphKan.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

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

  1. Khan-GCL: Kolmogorov-Arnold Network Based Graph Contrastive Learning with Hard Negatives

    cs.LG 2025-05 conditional novelty 6.0 of 10

    Khan-GCL combines KAN encoders with coefficient-based critical feature identification to generate hard negatives and reports state-of-the-art graph classification results.

Pith tools