arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2106.02466cs.LG

Graph Barlow Twins:一种用于图的自监督表示学习框架

Graph Barlow Twins: A self-supervised representation learning framework for graphs

Wroclaw University of Science and Technology(弗罗茨瓦夫科技大学);University of Notre Dame(圣母大学)

Piotr Bielak, Tomasz Kajdanowicz, Nitesh V. Chawla

AI总结:

提出自监督图表示学习框架Graph Barlow Twins,利用基于互相关的损失函数替代负样本且无需非对称网络架构,在减少超参数和大幅缩短计算时间的同时取得了与最佳自监督及全监督方法相当的结果。

摘要:

自监督学习(SSL)范式是一个重要的探索领域,旨在消除对昂贵数据标注的需求。尽管SSL方法在计算机视觉和自然语言处理中取得了巨大成功,但大多数方法采用了需要负样本的对比学习目标,而负样本难以定义。在图的情况下,这变得更加具有挑战性,并且是实现鲁棒表示的瓶颈。为了克服这些限制,我们提出了一个自监督图表示学习框架——Graph Barlow Twins,它利用基于互相关损失函数代替负样本。此外,与最先进的自监督图表示学习方法BGRL相比,它不依赖于非对称神经网络架构。我们表明,我们的方法取得了与最佳自监督方法和完全监督方法同样具有竞争力的结果,同时需要更少的超参数和大幅缩短的计算时间(比BGRL快约30倍)。

英文摘要:

The self-supervised learning (SSL) paradigm is an essential exploration area, which tries to eliminate the need for expensive data labeling. Despite the great success of SSL methods in computer vision and natural language processing, most of them employ contrastive learning objectives that require negative samples, which are hard to define. This becomes even more challenging in the case of graphs and is a bottleneck for achieving robust representations. To overcome such limitations, we propose a framework for self-supervised graph representation learning - Graph Barlow Twins, which utilizes a cross-correlation-based loss function instead of negative samples. Moreover, it does not rely on non-symmetric neural network architectures - in contrast to state-of-the-art self-supervised graph representation learning method BGRL. We show that our method achieves as competitive results as the best self-supervised methods and fully supervised ones while requiring fewer hyperparameters and substantially shorter computation time (ca. 30 times faster than BGRL).

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

↑