Contrastive Multi-View Representation Learning on Graphs
원문 초록
We introduce a self-supervised approach for learning node and graph level representations by contrasting structural views of graphs. We show that unlike visual representation learning, increasing the number of views to more than two or contrasting multi-scale encodings do not improve performance, and the best performance is achieved by contrasting encodings from first-order neighbors and a graph diffusion. We achieve new state-of-the-art results in self-supervised learning on 8 out of 8 node and graph classification benchmarks under the linear evaluation protocol. For example, on Cora (node) and Reddit-Binary (graph) classification benchmarks, we achieve 86.8% and 84.5% accuracy, which are 5.5% and 2.4% relative improvements over previous state-of-the-art. When compared to supervised baselines, our approach outperforms them in 4 out of 8 benchmarks. Source code is released at: https://github.com/kavehhassani/mvgrl
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
Contrastive Self-Supervised Learning As Neural Manifold Packing
Self-supervised Learning of Echocardiographic Video Representations via Online Cluster Distillation
Positional Encoding meets Persistent Homology on Graphs
ShapeEmbed: a self-supervised learning framework for 2D contour quantification
USAD: Universal Speech and Audio Representation via Distillation
Exploring Non-contrastive Self-supervised Representation Learning for Image-based Profiling
토론
이 논문과 연결된 포럼 글이 아직 없습니다.