The reviewed record of science sign in
Pith

arxiv: 2504.01246 · v1 · pith:G3L6BHDV · submitted 2025-04-01 · cs.LG · cs.AI

Dynamic Graph Structure Estimation for Learning Multivariate Point Process using Spiking Neural Networks

Reviewed by Pith T0 review T1 audit T2 compute T3 formal T4 kernel pith:G3L6BHDVrecord.jsonopen to challenge →

classification cs.LG cs.AI
keywords sdgndynamicgraphspikingdependenciesgraphslearningmethods
0
0 comments X
read the original abstract

Modeling and predicting temporal point processes (TPPs) is critical in domains such as neuroscience, epidemiology, finance, and social sciences. We introduce the Spiking Dynamic Graph Network (SDGN), a novel framework that leverages the temporal processing capabilities of spiking neural networks (SNNs) and spike-timing-dependent plasticity (STDP) to dynamically estimate underlying spatio-temporal functional graphs. Unlike existing methods that rely on predefined or static graph structures, SDGN adapts to any dataset by learning dynamic spatio-temporal dependencies directly from the event data, enhancing generalizability and robustness. While SDGN offers significant improvements over prior methods, we acknowledge its limitations in handling dense graphs and certain non-Gaussian dependencies, providing opportunities for future refinement. Our evaluations, conducted on both synthetic and real-world datasets including NYC Taxi, 911, Reddit, and Stack Overflow, demonstrate that SDGN achieves superior predictive accuracy while maintaining computational efficiency. Furthermore, we include ablation studies to highlight the contributions of its core components.

This paper has not been read by Pith yet.

discussion (0)

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