Continuous Spiking Graph Neural Networks

Fuente: arXiv
Salvato in:
Dettagli Bibliografici
Autori principali: Yin, Nan, Wan, Mengzhu, Shen, Li, Patel, Hitesh Laxmichand, Li, Baopu, Gu, Bin, Xiong, Huan
Natura: Preprint
Pubblicazione: 2024
Soggetti:
Accesso online:
Tags: Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
_version_ 1866912477580623872
author Yin, Nan
Wan, Mengzhu
Shen, Li
Patel, Hitesh Laxmichand
Li, Baopu
Gu, Bin
Xiong, Huan
author_facet Yin, Nan
Wan, Mengzhu
Shen, Li
Patel, Hitesh Laxmichand
Li, Baopu
Gu, Bin
Xiong, Huan
contents Continuous graph neural networks (CGNNs) have garnered significant attention due to their ability to generalize existing discrete graph neural networks (GNNs) by introducing continuous dynamics. They typically draw inspiration from diffusion-based methods to introduce a novel propagation scheme, which is analyzed using ordinary differential equations (ODE). However, the implementation of CGNNs requires significant computational power, making them challenging to deploy on battery-powered devices. Inspired by recent spiking neural networks (SNNs), which emulate a biological inference process and provide an energy-efficient neural architecture, we incorporate the SNNs with CGNNs in a unified framework, named Continuous Spiking Graph Neural Networks (COS-GNN). We employ SNNs for graph node representation at each time step, which are further integrated into the ODE process along with time. To enhance information preservation and mitigate information loss in SNNs, we introduce the high-order structure of COS-GNN, which utilizes the second-order ODE for spiking representation and continuous propagation. Moreover, we provide the theoretical proof that COS-GNN effectively mitigates the issues of exploding and vanishing gradients, enabling us to capture long-range dependencies between nodes. Experimental results on graph-based learning tasks demonstrate the effectiveness of the proposed COS-GNN over competitive baselines.
format Preprint
id arxiv_https___arxiv_org_abs_2404_01897
institution arXiv
publishDate 2024
record_format arxiv
spellingShingle Continuous Spiking Graph Neural Networks
Yin, Nan
Wan, Mengzhu
Shen, Li
Patel, Hitesh Laxmichand
Li, Baopu
Gu, Bin
Xiong, Huan
Neural and Evolutionary Computing
Artificial Intelligence
Machine Learning
Continuous graph neural networks (CGNNs) have garnered significant attention due to their ability to generalize existing discrete graph neural networks (GNNs) by introducing continuous dynamics. They typically draw inspiration from diffusion-based methods to introduce a novel propagation scheme, which is analyzed using ordinary differential equations (ODE). However, the implementation of CGNNs requires significant computational power, making them challenging to deploy on battery-powered devices. Inspired by recent spiking neural networks (SNNs), which emulate a biological inference process and provide an energy-efficient neural architecture, we incorporate the SNNs with CGNNs in a unified framework, named Continuous Spiking Graph Neural Networks (COS-GNN). We employ SNNs for graph node representation at each time step, which are further integrated into the ODE process along with time. To enhance information preservation and mitigate information loss in SNNs, we introduce the high-order structure of COS-GNN, which utilizes the second-order ODE for spiking representation and continuous propagation. Moreover, we provide the theoretical proof that COS-GNN effectively mitigates the issues of exploding and vanishing gradients, enabling us to capture long-range dependencies between nodes. Experimental results on graph-based learning tasks demonstrate the effectiveness of the proposed COS-GNN over competitive baselines.
title Continuous Spiking Graph Neural Networks
topic Neural and Evolutionary Computing
Artificial Intelligence
Machine Learning
url https://arxiv.org/abs/2404.01897