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

双曲图表示学习:一个新的研究方向

Hyperbolic Graph Representation Learning: A Tutorial

Noah’s Ark Lab, Huawei Technologies(华为技术有限公司诺亚方舟实验室);The Chinese University of Hong Kong(香港中文大学)

Min Zhou, Menglin Yang, Lujia Pan, Irwin King

摘要:

图结构的数据广泛存在于现实世界的应用中,如社交网络,推荐系统,知识图谱,化学分子等。尽管欧几里德空间的图相关的学习任务的成功,其建模复杂模式的能力基本上是由其多项式增长的能力受到限制。最近,双曲空间已经成为一个有前途的替代处理图形数据与树状结构或幂律分布,由于指数增长的性质。与欧氏空间的多项式扩展不同,双曲空间的指数增长特性使得它在抽象具有层次结构的树型图或无标度图方面具有天然的优势。在本教程中,我们的目标是介绍这个新兴的图表示学习领域,并明确表示所有受众都可以访问。我们首先简要介绍了图表示学习以及一些初步的黎曼几何和双曲几何。然后,我们全面回顾了双曲嵌入技术,包括双曲浅模型和双曲神经网络。此外,我们介绍了目前的双曲图神经网络的技术细节,将它们统一到一个通用的框架,并总结了每个组件的变体。此外,我们进一步介绍了一系列相关的应用在各个领域。在最后一部分中,我们讨论了关于图表示学习的双曲几何的几个高级主题,这些主题可能为进一步繁荣非欧几里得图学习社区提供指导。

英文摘要:

Graph-structured data are widespread in real-world applications, such as social networks, recommender systems, knowledge graphs, chemical molecules etc. Despite the success of Euclidean space for graph-related learning tasks, its ability to model complex patterns is essentially constrained by its polynomially growing capacity. Recently, hyperbolic spaces have emerged as a promising alternative for processing graph data with tree-like structure or power-law distribution, owing to the exponential growth property. Different from Euclidean space, which expands polynomially, the hyperbolic space grows exponentially which makes it gains natural advantages in abstracting tree-like or scale-free graphs with hierarchical organizations. In this tutorial, we aim to give an introduction to this emerging field of graph representation learning with the express purpose of being accessible to all audiences. We first give a brief introduction to graph representation learning as well as some preliminary Riemannian and hyperbolic geometry. We then comprehensively revisit the hyperbolic embedding techniques, including hyperbolic shallow models and hyperbolic neural networks. In addition, we introduce the technical details of the current hyperbolic graph neural networks by unifying them into a general framework and summarizing the variants of each component. Moreover, we further introduce a series of related applications in a variety of fields. In the last part, we discuss several advanced topics about hyperbolic geometry for graph representation learning, which potentially serve as guidelines for further flourishing the non-Euclidean graph learning community.

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

↑