CurvDrop: A Ricci Curvature Based Approach to Prevent Graph Neural Networks from Over-Smoothing and Over-Squashing

Author:

Liu Yang1ORCID,Zhou Chuan2ORCID,Pan Shirui3ORCID,Wu Jia4ORCID,Li Zhao5ORCID,Chen Hongyang6ORCID,Zhang Peng7ORCID

Affiliation:

1. Academy of Mathematics and Systems Science, Chinese Academy of Sciences, China

2. AMSS, Chinese Academy of Science, China and School of Cyber Security, University of Chinese Academy of Science, China

3. School of Information and Communication Technology, Griffith University, Australia

4. School of Computing, Macquarie University, Australia

5. Hangzhou link2do Technology, China

6. Research Center for Graph Computing, Zhejiang Lab, China

7. Cyberspace Institute of Advanced Technology, Guangzhou University, China

Funder

Australian Research Council (ARC) Projects

Key Research Project of Zhejiang Lab

National Key Research and Development Program of China

Joint Research Fund of Guangzhou University

CAS Project for Young Scientists in Basic Research

Publisher

ACM

Reference41 articles.

1. Uri Alon and Eran Yahav . 2020 . On the Bottleneck of Graph Neural Networks and its Practical Implications . In International Conference on Learning Representations. Uri Alon and Eran Yahav. 2020. On the Bottleneck of Graph Neural Networks and its Practical Implications. In International Conference on Learning Representations.

2. Shuliang Bai , An Huang , Linyuan Lu , and Shing-Tung Yau . 2020. On the sum of Ricci-curvatures for weighted graphs. arXiv preprint arXiv:2001.01776 ( 2020 ). Shuliang Bai, An Huang, Linyuan Lu, and Shing-Tung Yau. 2020. On the sum of Ricci-curvatures for weighted graphs. arXiv preprint arXiv:2001.01776 (2020).

3. Aleksandar Bojchevski , Oleksandr Shchur , Daniel Zügner , and Stephan Günnemann . 2018 . Netgan: Generating graphs via random walks . In International conference on machine learning. PMLR, 610–619 . Aleksandar Bojchevski, Oleksandr Shchur, Daniel Zügner, and Stephan Günnemann. 2018. Netgan: Generating graphs via random walks. In International conference on machine learning. PMLR, 610–619.

4. Measuring and Relieving the Over-Smoothing Problem for Graph Neural Networks from the Topological View

5. Jie Chen , Tengfei Ma , and Cao Xiao . 2018 . FastGCN: Fast learning with graph convolutional networks via importance sampling . In International Conference on Learning Representations. International Conference on Learning Representations, ICLR. Jie Chen, Tengfei Ma, and Cao Xiao. 2018. FastGCN: Fast learning with graph convolutional networks via importance sampling. In International Conference on Learning Representations. International Conference on Learning Representations, ICLR.

Cited by 8 articles. 订阅此论文施引文献 订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献

1. Efficient and Provable Effective Resistance Computation on Large Graphs: An Index-based Approach;Proceedings of the ACM on Management of Data;2024-05-29

2. RicciNet: Deep Clustering via A Riemannian Generative Model;Proceedings of the ACM Web Conference 2024;2024-05-13

3. Meta Structure Search for Link Weight Prediction in Heterogeneous Graphs;ICASSP 2024 - 2024 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP);2024-04-14

4. Conditional Shift-Robust Conformal Prediction for Graph Neural Network;2024

5. DeepRicci: Self-supervised Graph Structure-Feature Co-Refinement for Alleviating Over-squashing;2023 IEEE International Conference on Data Mining (ICDM);2023-12-01

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3