Pith. sign in

REVIEW 3 cited by

Spiking Graph Convolutional 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 2205.02767 v2 pith:LKSHHGFB submitted 2022-05-05 cs.LG cs.AI

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

Graph Convolutional Networks (GCNs) achieve an impressive performance due to the remarkable representation ability in learning the graph information. However, GCNs, when implemented on a deep network, require expensive computation power, making them difficult to be deployed on battery-powered devices. In contrast, Spiking Neural Networks (SNNs), which perform a bio-fidelity inference process, offer an energy-efficient neural architecture. In this work, we propose SpikingGCN, an end-to-end framework that aims to integrate the embedding of GCNs with the biofidelity characteristics of SNNs. The original graph data are encoded into spike trains based on the incorporation of graph convolution. We further model biological information processing by utilizing a fully connected layer combined with neuron nodes. In a wide range of scenarios (e.g. citation networks, image graph classification, and recommender systems), our experimental results show that the proposed method could gain competitive performance against state-of-the-art approaches. Furthermore, we show that SpikingGCN on a neuromorphic chip can bring a clear advantage of energy efficiency into graph data analysis, which demonstrates its great potential to construct environment-friendly machine learning models.

Discussion (0). Sign in to comment.

Forward citations

Cited by 3 Pith papers

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

  1. TEFormer: Structured Bidirectional Temporal Enhancement Modeling in Spiking Transformers

    cs.NE 2026-01 conditional novelty 6.0 of 10

    A spiking transformer with forward temporal EMA in attention and backward gated recurrence in the MLP improves accuracy across static, neuromorphic, and temporally complex datasets.

  2. Scalable and Efficient Joint Spiking Embedding Predictive Architecture for Large-Scale Dynamic Graphs

    cs.LG 2026-07 conditional novelty 5.0 of 10

    SG-JEPA applies joint-embedding predictive learning to dynamic graphs, using spiking-neuron context encoders to predict future node embeddings without edge reconstruction or graph augmentation.

  3. Geometry-Aware Spiking Graph Neural Network

    cs.NE 2025-08 conditional novelty 4.0 of 10

    GSG, a spiking graph network that picks per-node geometry across hyperbolic, spherical, and flat spaces, reports top results on four benchmark datasets against twelve baselines.

Pith tools