deep phgcn:迈向更深的双曲图卷积网络

Jiaxu Liu;Xinping Yi;Xiaowei Huang
{"title":"deep phgcn:迈向更深的双曲图卷积网络","authors":"Jiaxu Liu;Xinping Yi;Xiaowei Huang","doi":"10.1109/TAI.2024.3440223","DOIUrl":null,"url":null,"abstract":"Hyperbolic graph convolutional networks (HGCNs) have demonstrated significant potential in extracting information from hierarchical graphs. However, existing HGCNs are limited to shallow architectures due to the computational expense of hyperbolic operations and the issue of oversmoothing as depth increases. Although treatments have been applied to alleviate oversmoothing in graph convolutional networks (GCNs), developing a hyperbolic solution presents distinct challenges since operations must be carefully designed to fit the hyperbolic nature. Addressing these challenges, we propose DeepHGCN, the first deep multilayer HGCN architecture with dramatically improved computational efficiency and substantially reduced oversmoothing. DeepHGCN features two key innovations: 1) a novel hyperbolic feature transformation layer that enables fast and accurate linear mappings; and 2) techniques such as hyperbolic residual connections and regularization for both weights and features, facilitated by an efficient hyperbolic midpoint method. Extensive experiments demonstrate that DeepHGCN achieves significant improvements in link prediction (LP) and node classification (NC) tasks compared to both Euclidean and shallow hyperbolic GCN variants.","PeriodicalId":73305,"journal":{"name":"IEEE transactions on artificial intelligence","volume":"5 12","pages":"6172-6185"},"PeriodicalIF":0.0000,"publicationDate":"2024-08-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"DeepHGCN: Toward Deeper Hyperbolic Graph Convolutional Networks\",\"authors\":\"Jiaxu Liu;Xinping Yi;Xiaowei Huang\",\"doi\":\"10.1109/TAI.2024.3440223\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Hyperbolic graph convolutional networks (HGCNs) have demonstrated significant potential in extracting information from hierarchical graphs. However, existing HGCNs are limited to shallow architectures due to the computational expense of hyperbolic operations and the issue of oversmoothing as depth increases. Although treatments have been applied to alleviate oversmoothing in graph convolutional networks (GCNs), developing a hyperbolic solution presents distinct challenges since operations must be carefully designed to fit the hyperbolic nature. Addressing these challenges, we propose DeepHGCN, the first deep multilayer HGCN architecture with dramatically improved computational efficiency and substantially reduced oversmoothing. DeepHGCN features two key innovations: 1) a novel hyperbolic feature transformation layer that enables fast and accurate linear mappings; and 2) techniques such as hyperbolic residual connections and regularization for both weights and features, facilitated by an efficient hyperbolic midpoint method. Extensive experiments demonstrate that DeepHGCN achieves significant improvements in link prediction (LP) and node classification (NC) tasks compared to both Euclidean and shallow hyperbolic GCN variants.\",\"PeriodicalId\":73305,\"journal\":{\"name\":\"IEEE transactions on artificial intelligence\",\"volume\":\"5 12\",\"pages\":\"6172-6185\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2024-08-08\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"IEEE transactions on artificial intelligence\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://ieeexplore.ieee.org/document/10632071/\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE transactions on artificial intelligence","FirstCategoryId":"1085","ListUrlMain":"https://ieeexplore.ieee.org/document/10632071/","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

双曲图卷积网络(HGCNs)在从层次图中提取信息方面显示出巨大的潜力。然而,由于双曲运算的计算成本和随着深度增加的过平滑问题,现有的hgcn仅限于浅层架构。尽管已经应用了一些处理方法来缓解图卷积网络(GCNs)中的过度平滑,但由于必须仔细设计操作以适应双曲性质,因此开发双曲解决方案提出了明显的挑战。为了解决这些挑战,我们提出了DeepHGCN,这是第一个深度多层HGCN架构,大大提高了计算效率,并大大减少了过平滑。DeepHGCN具有两个关键创新:1)一种新的双曲特征转换层,可以实现快速准确的线性映射;2)利用有效的双曲中点方法对权值和特征进行双曲残差连接和正则化等技术。大量实验表明,与欧几里得和浅双曲GCN变体相比,DeepHGCN在链路预测(LP)和节点分类(NC)任务方面取得了显着改进。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
DeepHGCN: Toward Deeper Hyperbolic Graph Convolutional Networks
Hyperbolic graph convolutional networks (HGCNs) have demonstrated significant potential in extracting information from hierarchical graphs. However, existing HGCNs are limited to shallow architectures due to the computational expense of hyperbolic operations and the issue of oversmoothing as depth increases. Although treatments have been applied to alleviate oversmoothing in graph convolutional networks (GCNs), developing a hyperbolic solution presents distinct challenges since operations must be carefully designed to fit the hyperbolic nature. Addressing these challenges, we propose DeepHGCN, the first deep multilayer HGCN architecture with dramatically improved computational efficiency and substantially reduced oversmoothing. DeepHGCN features two key innovations: 1) a novel hyperbolic feature transformation layer that enables fast and accurate linear mappings; and 2) techniques such as hyperbolic residual connections and regularization for both weights and features, facilitated by an efficient hyperbolic midpoint method. Extensive experiments demonstrate that DeepHGCN achieves significant improvements in link prediction (LP) and node classification (NC) tasks compared to both Euclidean and shallow hyperbolic GCN variants.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
CiteScore
7.70
自引率
0.00%
发文量
0
期刊最新文献
Front Cover Table of Contents IEEE Transactions on Artificial Intelligence Publication Information Table of Contents Front Cover
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1