用脉冲神经网络降低异构图神经网络的计算开销
Spiking Heterogeneous Graph Attention Networks
- 将脉冲神经网络融入异构图注意力机制,实现低功耗计算
- 在三个真实数据集上达到媲美现有方法的分类性能
- 适合部署在资源受限设备上的异构图学习任务
现实世界中的图结构通常具有异质性,包含多种类型的节点和关系。异构图神经网络(HGNN)能有效处理这些多样性,捕捉图中异质信息,表现出优异性能。然而,多数HGNN方法结构复杂,导致内存占用高、推理时间长、计算资源消耗大,限制了其在资源受限设备上的应用。为此,我们提出脉冲异构图注意力网络(SpikingHAN),将脉冲神经网络(SNN)的类脑特性与节能优势引入异构图学习,以降低计算成本而不牺牲性能。SpikingHAN使用参数共享的单层图卷积聚合基于元路径的邻居信息,通过语义级注意力机制捕获不同元路径的重要性并进行语义聚合,最后通过SNN将异质信息编码为脉冲序列,模拟生物信息处理过程,生成二值化的1比特图表示。在三个真实异构图数据集上的实验表明,SpikingHAN在参数量更少、推理更快、内存占用更低、能耗更少的前提下,实现了具有竞争力的节点分类性能。代码已公开于https://github.com/QianPeng369/SpikingHAN。
原文摘要 · Abstract (English)
Real-world graphs or networks are usually heterogeneous, involving multiple types of nodes and relationships. Heterogeneous graph neural networks (HGNNs) can effectively handle these diverse nodes and edges, capturing heterogeneous information within the graph, thus exhibiting outstanding performance. However, most methods of HGNNs usually involve complex structural designs, leading to problems such as high memory usage, long inference time, and extensive consumption of computing resources. These limitations pose certain challenges for the practical application of HGNNs, especially for resource-constrained devices. To mitigate this issue, we propose the Spiking Heterogeneous Graph Attention Networks (SpikingHAN), which incorporates the brain-inspired and energy-saving properties of Spiking Neural Networks (SNNs) into heterogeneous graph learning to reduce the computing cost without compromising the performance. Specifically, SpikingHAN aggregates metapath-based neighbor information using a single-layer graph convolution with shared parameters. It then employs a semantic-level attention mechanism to capture the importance of different meta-paths and performs semantic aggregation. Finally, it encodes the heterogeneous information into a spike sequence through SNNs, simulating bioinformatic processing to derive a binarized 1-bit representation of the heterogeneous graph. Comprehensive experimental results from three real-world heterogeneous graph datasets show that SpikingHAN delivers competitive node classification performance. It achieves this with fewer parameters, quicker inference, reduced memory usage, and lower energy consumption. Code is available at https://github.com/QianPeng369/SpikingHAN.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。