RayE-Sub: Countering Subgraph Degradation via Perfect Reconstruction

IF 8.9 2区 计算机科学 Q1 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE
Kuo Yang;Zhengyang Zhou;Xu Wang;Pengkun Wang;Limin Li;Yang Wang
{"title":"RayE-Sub: Countering Subgraph Degradation via Perfect Reconstruction","authors":"Kuo Yang;Zhengyang Zhou;Xu Wang;Pengkun Wang;Limin Li;Yang Wang","doi":"10.1109/TKDE.2025.3544696","DOIUrl":null,"url":null,"abstract":"Subgraph learning has dominated most practices of improving the expressive power of Message Passing Neural Networks (MPNNs). Existing subgraph discovery policies can be classified into node-based and partition-based, which both achieve impressive performance in most scenarios. However, both mainstream solutions still face a subgraph degradation trap. Subgraph degradation is reflected in the phenomenon that the subgraph-level methods fail to offer any benefits over node-level MPNNs. In this work, we empirically investigate the existence of the subgraph degradation issue and introduce a unified perspective, perfect reconstruction, to provide insights for improving two lines of methods. We further propose a subgraph learning strategy guided by the principle of perfect reconstruction. To achieve this, two major issues should be well-addressed, i.e., <italic>(i) how to ensure the subgraphs to possess with ‘perfect’ information? (ii) how to guarantee the ‘reconstruction’ power of obtained subgraphs?</i> First, we propose a subgraph partition strategy <italic>Rayleigh-resistance</i> to extract non-overlap subgraphs by leveraging the graph spectral theory. Second, we put forward a <italic>Query</i> mechanism to achieve subgraph-level equivariant learning, which guarantees subgraph reconstruction ability. These two parts, <italic>perfect subgraph partition</i> and <italic>equivariant subgraph learning</i> are seamlessly unified as a novel <italic><u>Ray</u>leigh-resistance <u>E</u>quivariant <u>Sub</u>graph learning</i> architecture (<italic><b>RayE-Sub</b></i>). Comprehensive experiments on both synthetic and real datasets demonstrate that our approach can consistently outperform previous subgraph learning architectures.","PeriodicalId":13496,"journal":{"name":"IEEE Transactions on Knowledge and Data Engineering","volume":"37 6","pages":"3684-3699"},"PeriodicalIF":8.9000,"publicationDate":"2025-03-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE Transactions on Knowledge and Data Engineering","FirstCategoryId":"94","ListUrlMain":"https://ieeexplore.ieee.org/document/10919162/","RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE","Score":null,"Total":0}
引用次数: 0

Abstract

Subgraph learning has dominated most practices of improving the expressive power of Message Passing Neural Networks (MPNNs). Existing subgraph discovery policies can be classified into node-based and partition-based, which both achieve impressive performance in most scenarios. However, both mainstream solutions still face a subgraph degradation trap. Subgraph degradation is reflected in the phenomenon that the subgraph-level methods fail to offer any benefits over node-level MPNNs. In this work, we empirically investigate the existence of the subgraph degradation issue and introduce a unified perspective, perfect reconstruction, to provide insights for improving two lines of methods. We further propose a subgraph learning strategy guided by the principle of perfect reconstruction. To achieve this, two major issues should be well-addressed, i.e., (i) how to ensure the subgraphs to possess with ‘perfect’ information? (ii) how to guarantee the ‘reconstruction’ power of obtained subgraphs? First, we propose a subgraph partition strategy Rayleigh-resistance to extract non-overlap subgraphs by leveraging the graph spectral theory. Second, we put forward a Query mechanism to achieve subgraph-level equivariant learning, which guarantees subgraph reconstruction ability. These two parts, perfect subgraph partition and equivariant subgraph learning are seamlessly unified as a novel Rayleigh-resistance Equivariant Subgraph learning architecture (RayE-Sub). Comprehensive experiments on both synthetic and real datasets demonstrate that our approach can consistently outperform previous subgraph learning architectures.
RayE-Sub:通过完美重建对抗子图退化
子图学习在提高消息传递神经网络(MPNNs)表达能力的大多数实践中占据主导地位。现有的子图发现策略可以分为基于节点的和基于分区的,这两种策略在大多数情况下都取得了令人印象深刻的性能。然而,这两种主流解决方案仍然面临子图退化陷阱。子图退化反映在子图级方法无法提供任何优于节点级mpnn的现象中。在这项工作中,我们实证研究了子图退化问题的存在性,并引入了统一的视角,完美的重建,为改进两种方法提供了见解。我们进一步提出了一种以完全重构原则为指导的子图学习策略。为了实现这一目标,两个主要问题应该得到很好的解决,即(i)如何确保子图拥有“完美”的信息?(ii)如何保证获得的子图的“重建”能力?首先,利用图谱理论提出了一种提取非重叠子图的瑞利抵抗子图划分策略。其次,提出了一种实现子图级等变学习的查询机制,保证了子图重构能力。完美子图划分和等变子图学习这两部分无缝统一为一种新颖的瑞利抗等变子图学习体系结构(RayE-Sub)。在合成数据集和真实数据集上的综合实验表明,我们的方法可以始终优于以前的子图学习架构。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
IEEE Transactions on Knowledge and Data Engineering
IEEE Transactions on Knowledge and Data Engineering 工程技术-工程:电子与电气
CiteScore
11.70
自引率
3.40%
发文量
515
审稿时长
6 months
期刊介绍: The IEEE Transactions on Knowledge and Data Engineering encompasses knowledge and data engineering aspects within computer science, artificial intelligence, electrical engineering, computer engineering, and related fields. It provides an interdisciplinary platform for disseminating new developments in knowledge and data engineering and explores the practicality of these concepts in both hardware and software. Specific areas covered include knowledge-based and expert systems, AI techniques for knowledge and data management, tools, and methodologies, distributed processing, real-time systems, architectures, data management practices, database design, query languages, security, fault tolerance, statistical databases, algorithms, performance evaluation, and applications.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信