arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2601.02401cs.NEcs.LGcs.SI

脉冲异构图注意力网络

Spiking Heterogeneous Graph Attention Networks

Buqing Cao, Qian Peng, Xiang Xie, Liang Chen, Min Shi, Jianxun Liu

AI总结:

SpikingHAN通过融合脉冲神经网络的节能特性,降低异构图学习的计算成本,同时保持性能。

摘要:

现实中的图或网络通常是异构的,涉及多种类型的节点和关系。异构图神经网络(HGNNs)能够有效处理这些多样化的节点和边,捕捉图内的异构信息,从而表现出出色的性能。然而,大多数HGNN的方法通常涉及复杂的结构设计,导致问题如高内存使用、长推理时间以及大量消耗计算资源。这些限制对HGNN的实用应用构成了挑战,尤其是对资源受限的设备。为了解决这个问题,我们提出了脉冲异构图注意力网络(SpikingHAN),将受生物启发且节能的脉冲神经网络(SNNs)特性融入异构图学习中,以减少计算成本而不牺牲性能。具体而言,SpikingHAN使用单层图卷积和共享参数来聚合基于元路径的邻居信息。然后,它采用语义层面的注意力机制来捕捉不同元路径的重要性,并执行语义聚合。最后,它通过SNN将异构信息编码为脉冲序列,模拟生物信息处理,以获得异构图的二进制1位表示。来自三个真实世界异构图数据集的全面实验结果表明,SpikingHAN在节点分类性能方面表现竞争。它通过更少的参数、更快的推理、减少的内存使用和更低的能量消耗实现了这一点。代码可在https://github.com/QianPeng369/SpikingHAN上获得。

英文摘要:

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.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑