arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2009.10273cs.LGstat.ML
收藏

可伸缩自监督图表示学习的子图对比

Sub-graph Contrast for Scalable Self-Supervised Graph Representation Learning

Fudan University(复旦大学);Shanghai Institute for Advanced Communication and Data Science(上海先进通信与数据科学研究院);Florida State University(佛罗里达州立大学)

Yizhu Jiao, Yun Xiong, Jiawei Zhang, Yao Zhang, Tianqi Zhang, Yangyong Zhu

摘要:

图表示学习近年来引起了人们的广泛关注。现有的图神经网络与完整的图形数据馈送是不可扩展的,由于有限的计算和存储器成本。因此,在大规模图形数据中获取丰富的信息仍然是一个巨大的挑战。此外,这些方法主要集中在监督学习和高度依赖于节点标签信息,这是昂贵的,以获得在现实世界中。而无监督的网络嵌入方法过分强调节点的邻近性,其学习到的表示很难直接用于下游应用任务。近年来,新兴的自监督学习为解决上述问题提供了一个潜在的解决方案。然而,现有的自我监督的作品也在完整的图数据上操作,并且在定义基于互信息的损失项时偏向于适合全局或非常局部(1跳邻域)的图结构。本文提出了一种基于子图对比度的自监督表示学习方法,即\textsc{Subg-Con},该方法利用中心节点与其采样子图之间的强相关性来获取区域结构信息。\textsc{Subg-Con}不是在完整的输入图数据上学习,而是使用一种新的数据增强策略,通过基于从原始图中采样的子图定义的对比损失来学习节点表示。与现有的图表示学习方法相比,\textsc{Subg-Con}在监督要求较低、模型学习可扩展性和并行性方面具有突出的性能优势。大量的实验验证了我们的工作的有效性和效率相比,经典和国家的最先进的图表示学习方法在多个现实世界的大规模基准数据集从不同的领域。

英文摘要:

Graph representation learning has attracted lots of attention recently. Existing graph neural networks fed with the complete graph data are not scalable due to limited computation and memory costs. Thus, it remains a great challenge to capture rich information in large-scale graph data. Besides, these methods mainly focus on supervised learning and highly depend on node label information, which is expensive to obtain in the real world. As to unsupervised network embedding approaches, they overemphasize node proximity instead, whose learned representations can hardly be used in downstream application tasks directly. In recent years, emerging self-supervised learning provides a potential solution to address the aforementioned problems. However, existing self-supervised works also operate on the complete graph data and are biased to fit either global or very local (1-hop neighborhood) graph structures in defining the mutual information based loss terms. In this paper, a novel self-supervised representation learning method via Subgraph Contrast, namely \textsc{Subg-Con}, is proposed by utilizing the strong correlation between central nodes and their sampled subgraphs to capture regional structure information. Instead of learning on the complete input graph data, with a novel data augmentation strategy, \textsc{Subg-Con} learns node representations through a contrastive loss defined based on subgraphs sampled from the original graph instead. Compared with existing graph representation learning approaches, \textsc{Subg-Con} has prominent performance advantages in weaker supervision requirements, model learning scalability, and parallelization. Extensive experiments verify both the effectiveness and the efficiency of our work compared with both classic and state-of-the-art graph representation learning approaches on multiple real-world large-scale benchmark datasets from different domains.

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

↑