Towards Robust Graph Contrastive Learning
arXiv:2102.13085
Abstract
We study the problem of adversarially robust self-supervised learning on graphs. In the contrastive learning framework, we introduce a new method that increases the adversarial robustness of the learned representations through i) adversarial transformations and ii) transformations that not only remove but also insert edges. We evaluate the learned representations in a preliminary set of experiments, obtaining promising results. We believe this work takes an important step towards incorporating robustness as a viable auxiliary task in graph contrastive learning.
References in corpus (11)
- PyTorch: An Imperative Style, High-Performance Deep Learning Library
- A Simple Framework for Contrastive Learning of Visual Representations
- Learning deep representations by mutual information estimation and maximization
- Fast Graph Representation Learning with PyTorch Geometric
- Graph Contrastive Learning with Adaptive Augmentation
- Adversarial Attacks on Neural Networks for Graph Data
- Deep Graph Contrastive Representation Learning
- Adversarial Attacks on Graph Neural Networks via Meta Learning
- DeepRobust: A PyTorch Library for Adversarial Attacks and Defenses
- Pre-Training Graph Neural Networks for Generic Structural Feature Extraction
- Self-supervised Graph Representation Learning via Bootstrapping