arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2508.14101cs.LGcs.AI
收藏

隐式超图神经网络

Implicit Hypergraph Neural Network

Dept of Computer Science, University of Iowa(计算机科学系,爱荷华大学)

Akash Choudhuri, Yongjian Zhong, Bijaya Adhikari

AI总结:

隐式超图神经网络通过联合学习节点和超边的固定点表示,解决超图中长距离依赖问题,提升节点分类性能。

摘要:

超图提供了一个捕捉实体之间高阶关系的通用框架,并已在医疗、社交网络和生物信息学等多个领域得到广泛应用。依赖于超边上的节点之间信息传递来学习潜在表示的超图神经网络,已成为许多这些领域中预测任务的首选方法。这些方法通常只进行少量的信息传递轮次来学习表示,然后用于预测。少量的信息传递轮次带来了代价,因为表示只捕捉了局部信息并舍弃了长距离的高阶依赖关系。然而,正如我们所展示的,盲目地增加信息传递轮次以捕捉长距离依赖关系也会降低超图神经网络的性能。最近的研究表明,隐式图神经网络在标准图中捕捉长距离依赖关系的同时仍能保持性能。尽管它们很受欢迎,但先前的工作尚未研究超图神经网络上的长距离依赖问题。在此,我们首先证明现有超图神经网络在聚合更多信息以捕捉长距离依赖时会失去预测能力。然后,我们提出隐式超图神经网络(IHNN),一种新的框架,以端到端的方式联合学习节点和超边的固定点表示,以缓解这一问题。利用隐式微分,我们引入了一种可处理的投影梯度下降方法来高效训练模型。在真实世界超图上进行的大量实验表明,IHNN在大多数设置中优于最接近的先前工作,确立了超图学习的新最先进的状态。

英文摘要:

Hypergraphs offer a generalized framework for capturing high-order relationships between entities and have been widely applied in various domains, including healthcare, social networks, and bioinformatics. Hypergraph neural networks, which rely on message-passing between nodes over hyperedges to learn latent representations, have emerged as the method of choice for predictive tasks in many of these domains. These approaches typically perform only a small number of message-passing rounds to learn the representations, which they then utilize for predictions. The small number of message-passing rounds comes at a cost, as the representations only capture local information and forego long-range high-order dependencies. However, as we demonstrate, blindly increasing the message-passing rounds to capture long-range dependency also degrades the performance of hyper-graph neural networks. Recent works have demonstrated that implicit graph neural networks capture long-range dependencies in standard graphs while maintaining performance. Despite their popularity, prior work has not studied long-range dependency issues on hypergraph neural networks. Here, we first demonstrate that existing hypergraph neural networks lose predictive power when aggregating more information to capture long-range dependency. We then propose Implicit Hypergraph Neural Network (IHNN), a novel framework that jointly learns fixed-point representations for both nodes and hyperedges in an end-to-end manner to alleviate this issue. Leveraging implicit differentiation, we introduce a tractable projected gradient descent approach to train the model efficiently. Extensive experiments on real-world hypergraphs for node classification demonstrate that IHNN outperforms the closest prior works in most settings, establishing a new state-of-the-art in hypergraph learning.

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

↑