mlsanityData to 14 Oct 2026

GraphTTA: Test Time Adaptation on Graph Neural Networks

arXiv 2208.09126 ↗First posted 19 Aug 2022cs.LGcited by 14

Not on the map. Why?

Abstract (arXiv)

Recently, test time adaptation (TTA) has attracted increasing attention due to its power of handling the distribution shift issue in the real world. Unlike what has been developed for convolutional neural networks (CNNs) for image data, TTA is less explored for Graph Neural Networks (GNNs). There is still a lack of efficient algorithms tailored for graphs with irregular structures. In this paper, we present a novel test time adaptation strategy named Graph Adversarial Pseudo Group Contrast (GAPGC), for graph neural networks TTA, to better adapt to the Out Of Distribution (OOD) test data. Specifically, GAPGC employs a contrastive learning variant as a self-supervised task during TTA, equipped with Adversarial Learnable Augmenter and Group Pseudo-Positive Samples to enhance the relevance between the self-supervised task and the main task, boosting the performance of the main task. Furthermore, we provide theoretical evidence that GAPGC can extract minimal sufficient information for the main task from information theory perspective. Extensive experiments on molecular scaffold OOD dataset demonstrated that the proposed approach achieves state-of-the-art performance on GNNs.

Key facts. Cited by 14 papers in the map (data through 14 Oct 2026). Builds on 28 of its 37 references that are in the map. First posted on arXiv 19 Aug 2022.

Builds on

28 of 37 references.

References · 28

  1. 2020A Simple Framework for Contrastive Learning of Visual Representationscited by 12,049
  2. 2016Semi-Supervised Classification with Graph Convolutional Networkscited by 11,361
  3. 2018Representation Learning with Contrastive Predictive Codingcited by 7,777
  4. 2018How Powerful are Graph Neural Networks?cited by 4,393
  5. 2019Contrastive Multiview Codingcited by 1,301
  6. 2020Graph Contrastive Learning with Augmentationscited by 1,208
  7. 2016The Concrete Distribution: A Continuous Relaxation of Discrete Random Variablescited by 1,148
  8. 2017MoleculeNet: A Benchmark for Molecular Machine Learningcited by 1,051
  9. 2019Strategies for Pre-training Graph Neural Networkscited by 971
  10. 2020Do We Really Need to Access the Source Data? Source Hypothesis Transfer for Unsupervised Domain Adaptationcited by 848
  11. 2020Deep Graph Contrastive Representation Learningcited by 539
  12. 2022Efficient Test-Time Model Adaptation without Forgettingcited by 469
16 more
  1. 2020Improving robustness against common corruptions by covariate shift adaptationcited by 431
  2. 2019Confidence Regularized Self-Trainingcited by 419
  3. 2021MEMO: Test Time Robustness via Adaptation and Augmentationcited by 377
  4. 2016Revisiting Batch Normalization For Practical Domain Adaptationcited by 288
  5. 2022Contrastive Test-Time Adaptationcited by 261
  6. 2020Evaluating Prediction-Time Batch Normalization for Robustness under Covariate Shiftcited by 236
  7. 2020Pitfalls of In-Domain Uncertainty Estimation and Ensembling in Deep Learningcited by 210
  8. 2021Adversarial Graph Augmentation to Improve Graph Contrastive Learningcited by 200
  9. 2020Graph Information Bottleneckcited by 168
  10. 2022G-Mixup: Graph Data Augmentation for Graph Classificationcited by 146
  11. 2022Graph Data Augmentation for Graph Machine Learning: A Surveycited by 62
  12. 2021Self-Tuning for Data-Efficient Deep Learningcited by 39
  13. 2022Automated Data Augmentations for Graph Classificationcited by 20
  14. 2021Learnable Hypergraph Laplacian for Hypergraph Learningcited by 16
  15. 2022Hypergraph Convolutional Networks via Equivalency between Hypergraphs and Undirected Graphscited by 16
  16. 2022SoftEdge: Regularizing Graph Classification with Random Soft Edgescited by 2

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2023: 1; 2024: 5; 2025: 4; 2026: 4.

14 papers.

Sort: