Scaling Up Dynamic Graph Representation Learning via Spiking Neural Networks
Jintang Li, Zhouxin Yu, Zulun Zhu, Liang Chen, Qi Yu, Zibin Zheng,, Sheng Tian, Ruofan Wu, Changhua Meng

TL;DR
SpikeNet introduces a scalable approach using spiking neural networks to model dynamic graphs efficiently, outperforming traditional RNN-based methods in large-scale temporal graph tasks with lower computational costs.
Contribution
The paper proposes SpikeNet, a novel framework leveraging spiking neural networks for scalable and efficient dynamic graph representation learning on large temporal graphs.
Findings
SpikeNet outperforms strong baselines on temporal node classification.
It generalizes well to large graphs with fewer parameters.
It achieves lower computational costs compared to RNN-based methods.
Abstract
Recent years have seen a surge in research on dynamic graph representation learning, which aims to model temporal graphs that are dynamic and evolving constantly over time. However, current work typically models graph dynamics with recurrent neural networks (RNNs), making them suffer seriously from computation and memory overheads on large temporal graphs. So far, scalability of dynamic graph representation learning on large temporal graphs remains one of the major challenges. In this paper, we present a scalable framework, namely SpikeNet, to efficiently capture the temporal and structural patterns of temporal graphs. We explore a new direction in that we can capture the evolving dynamics of temporal graphs with spiking neural networks (SNNs) instead of RNNs. As a low-power alternative to RNNs, SNNs explicitly model graph dynamics as spike trains of neuron populations and enable…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
Taxonomy
TopicsAdvanced Graph Neural Networks
