Abstract:Dynamic graph representation learning requires capturing both structural relations and temporal evolution, yet existing approaches face a core trade-off: attention-based methods offer expressiveness at $O(T^2)$ complexity, while recurrent architectures suffer from gradient pathologies and dense state storage. Spiking neural networks provide event-driven efficiency but are constrained by sequential propagation, binary information loss, and local aggregation that lacks global context. We propose ChronoSpike, an adaptive spiking graph neural network that integrates learnable LIF neurons with per-channel membrane dynamics, multi-head spatially-attentive aggregation over continuous features, and a lightweight Transformer temporal encoder. This design enables fine-grained local modeling and long-range dependency capture with $O(T \cdot d)$ activation/state memory and an additional $O(T^2)$ per-node attention term that remains small for the horizons evaluated here. ChronoSpike outperforms twelve state-of-the-art baselines on three large benchmarks by $2.0$% Macro-F1 and $2.4$% Micro-F1 on average while achieving $3-10\times$ faster training than recurrent methods with a constant 105K-parameter budget independent of graph size. We provide theoretical guarantees for membrane potential boundedness, gradient flow stability under contraction factor $\rho<1$, and BIBO stability; interpretability analyses reveal heterogeneous temporal receptive fields and a learned primacy effect with $83-88$% sparsity.
| Subjects: | Machine Learning (cs.LG) |
| Cite as: | arXiv:2602.01124 [cs.LG] |
| (or arXiv:2602.01124v3 [cs.LG] for this version) | |
| https://doi.org/10.48550/arXiv.2602.01124 arXiv-issued DOI via DataCite |
From: Md Abrar Jahin [view email]
[v1]
Sun, 1 Feb 2026 09:50:21 UTC (664 KB)
[v2]
Fri, 3 Apr 2026 02:14:07 UTC (656 KB)
[v3]
Thu, 7 May 2026 09:19:58 UTC (649 KB)
此内容由惯性聚合(RSS阅读器)自动聚合整理，仅供阅读参考。 原文来自 — 版权归原作者所有。