RADE: Random Add-Drop Edge as a Regularizer
Abstract
Graph Neural Networks (GNNs) suffer from overfitting and over-squashing of long-range information. Stochastic graph augmentations (e.g., edge deletion) regularize training against overfitting but can introduce train-inference misalignment and do not improve over-squashing. In contrast, rewiring methods improve connectivity to mitigate over-squashing, but are not designed to regularize training. We propose Random Add-Drop Edge (RADE), a stochastic graph augmentation method that jointly drops and adds edges to address both overfitting and over-squashing simultaneously. RADE is provably designed to align training and inference so that random augmentations regularize training without distribution shift, while supporting long-range communication at inference. We further propose and study a mini-batch gradient-norm balancing algorithm that adapts deletion and addition rates during training, rendering RADE hyperparameter-free in practice. Experiments on node- and graph-classification benchmarks show that RADE is a strong regularizer and mitigates over-squashing. Ablations support the roles of train-inference alignment, adaptive rate selection, and the complementary effects of random edge deletion and edge addition.
Benchmark Results
Tested on 8 datasets 22 baseline values reported too low
Tables show presented results in global context (best 3 papers + GCN + MLP).
Classic
| # | Model | Accuracy ↑ | Paper |
|---|---|---|---|
| 1 | GraphSAGE+CNA | 0.9418
±0.0033 | |
| 2 | GCN+CNA | 0.9366
±0.0048 | |
| 3 | TransformerConv | 0.9350
±0.0058 | |
| 21 | GCN | 0.9004 best reported | best at pub: Understanding Heterophily for Graph Neural Networks (ICML 2024) |
| 39 | SAGE | 0.8911
±0.0012 | |
| 43 | DropEdge | 0.8900 best reported | best at pub: Tackling Over-Smoothing for General Graph Convolutional Networks (2020) |
| 44 | GAT | 0.8897
±0.0014 best reported | |
| 165 | GIN | 0.8660
±0.0091 best reported | best at pub: Large Language Model Meets Graph Neural Network in Knowledge Distillation (AAAI 2024) |
| 605 | RADE-OF | 0.8108
±0.0106 | This paper |
| 617 | RADE-OFS | 0.8082
±0.0124 | This paper |
| 619 | DropNode | 0.8080
±0.0055 | prev best: xAI-Drop: Don't Use What You Cannot Explain (LoG 2024) |
| 623 | Dropout | 0.8076
±0.0085 | This paper |
| 627 | DropMessage | 0.8065
±0.0101 | This paper |
| 724 | MLP | 0.7768 |
| # | Model | Accuracy ↑ | Paper |
|---|---|---|---|
| 1 | CNA | 0.9575
±0.0058 | |
| 2 | IS-GIB | 0.9390
±0.0187 | |
| 3 | EERM | 0.9112
±0.0145 | |
| 24 | DropEdge | 0.8130 best reported | best at pub: Tackling Over-Smoothing for General Graph Convolutional Networks (2020) |
| 35 | GAT | 0.8080
±0.0026 best reported | best at pub: Feature Expansion for Graph Neural Networks (ICML 2023) |
| 44 | GCN | 0.8033
±0.0088 best reported | best at pub: NTFormer: A Composite Node Tokenized Graph Transformer for Node Classification (2024) |
| 61 | GraphSAGE | 0.7923
±0.0053 | |
| 350 | MLP | 0.7289
±0.0010 | |
| 389 | GIN | 0.7250
±0.0080 best reported | best at pub: Towards Self-Explainable Graph Neural Network (2021) |
| 613 | RADE-OF | 0.7020
±0.0131 | This paper |
| 616 | RADE-OFS | 0.7012
±0.0225 | This paper |
| 621 | Dropout | 0.7004
±0.0058 | This paper |
| 672 | DropNode | 0.6842
±0.0143 | This paper |
| 688 | DropMessage | 0.6794
±0.0182 | This paper |
| # | Model | Accuracy ↑ | Paper |
|---|---|---|---|
| 1 | LGTL | 0.9518
±0.0011 | |
| 2 | MixHop (LO) | 0.9513
±0.0038 | |
| 3 | GraphSAGE (LO) | 0.9511
±0.0036 | |
| 18 | GCN | 0.9296
±0.0015 best reported | |
| 20 | GAT | 0.9233
±0.0018 best reported | |
| 43 | DropEdge | 0.9090 best reported | best at pub: Training Robust Graph Neural Networks with Topology Adaptive Edge Dropping (2021) |
| 116 | SAGE | 0.8881
±0.0015 | |
| 157 | GIN | 0.8810 best reported | best at pub: UGSL: A Unified Framework for Benchmarking Graph Structure Learning (2023) |
| 210 | MLP | 0.8690
±0.0074 | |
| 558 | DropMessage | 0.7920 best reported | best at pub: Oversmoothing alleviation in graph neural networks: a survey and unified view (2024) |
| 661 | RADE-OFS | 0.7824
±0.0085 | This paper |
| 675 | RADE-OF | 0.7804
±0.0080 | This paper |
| 702 | Dropout | 0.7770
±0.0072 | This paper |
| 705 | DropNode | 0.7768
±0.0064 | This paper |
TU Dortmund
| # | Model | Accuracy ↑ | Paper |
|---|---|---|---|
| 1 | MSH-GNN | 0.9910
±0.0030 | |
| 2 | ID-GNN+BEC | 0.9830
±0.0360 | |
| 3 | SupCosine | 0.9830
±0.0250 | |
| 39 | GIN | 0.9330
±0.0290 best reported | best at pub: ProtGNN: Towards Self-Explaining Graph Neural Networks (AAAI 2021) Difference within reported uncertainty; not counted as underperformance. |
| 63 | GCN | 0.9220
±0.0440 best reported | best at pub: Depth-Adaptive Graph Neural Networks via Learnable Bakry-Émery Curvature (KDD 2025) |
| 116 | DropEdge | 0.9100
±0.0570 best reported | best at pub: Understanding and Extending Subgraph GNNs by Rethinking Their Symmetries (NeurIPS 2022) Difference within reported uncertainty; not counted as underperformance. |
| 158 | GraphSAGE | 0.9040
±0.0780 | |
| 183 | GAT | 0.9010
±0.0580 best reported | best at pub: Breaking the Limits of Message Passing Graph Neural Networks (ICML 2021) best today: The Expressive Power of Graph Neural Networks: A Survey (2023) |
| 363 | DropNode | 0.8750 best reported | best at pub: SoftEdge: Regularizing Graph Classification with Random Soft Edges (2022) Difference within reported uncertainty; not counted as underperformance. |
| 403 | MLP | 0.8660
±0.0495 | |
| 411 | RADE-OFS | 0.8624
±0.0679 | This paper |
| 415 | RADE-OF | 0.8616
±0.0562 | This paper |
| 421 | DropMessage | 0.8608
±0.0739 | This paper |
| 473 | Dropout | 0.8441
±0.0894 | This paper |
| # | Model | Accuracy ↑ | Paper |
|---|---|---|---|
| 1 | MSH-GNN | 0.9410
±0.0330 | |
| 2 | GRDL | 0.8260
±0.0120 | |
| 3 | GMN | 0.8225 | |
| 32 | GIN | 0.7880
±0.0410 best reported | best at pub: Permutation-Invariant graph partitioning: How graph neural networks capture structural interactions? (2023) Difference within reported uncertainty; not counted as underperformance. |
| 49 | GAT | 0.7800
±0.0300 best reported | best at pub: CI-GNN: A Granger Causality-Inspired Graph Neural Network for Interpretable Brain Network-Based Psychiatric Diagnosis (2023) Difference within reported uncertainty; not counted as underperformance. |
| 67 | SAGE | 0.7726
±0.0228 | |
| 148 | GCN | 0.7600
±0.0320 best reported | best at pub: CI-GNN: A Granger Causality-Inspired Graph Neural Network for Interpretable Brain Network-Based Psychiatric Diagnosis (2023) best today: Simplifying Graph Convolutional Networks with Redundancy-Free Neighbors (2025) Difference within reported uncertainty; not counted as underperformance. |
| 149 | MLP | 0.7600
±0.0320 | |
| 163 | RADE-OFS | 0.7584
±0.0344 | This paper |
| 182 | RADE-OF | 0.7562
±0.0186 | This paper |
| 193 | DropEdge | 0.7550
±0.0020 best reported | best at pub: SoftEdge: Regularizing Graph Classification with Random Soft Edges (2022) Difference within reported uncertainty; not counted as underperformance. |
| 198 | DropMessage | 0.7545
±0.0380 | This paper |
| 204 | Dropout | 0.7540
±0.0441 | This paper |
| 234 | DropNode | 0.7511
±0.0300 best reported | best at pub: Fused Gromov-Wasserstein Graph Mixup for Graph-level Classifications (NeurIPS 2023) Difference within reported uncertainty; not counted as underperformance. |
OGB
| # | Model | ROC-AUC ↑ | Paper |
|---|---|---|---|
| 1 | Multi-RF Fusion with Multi-GNN Blending | 0.8476
±0.0002 | |
| 2 | HyperFusion | 0.8475
±0.0003 | |
| 3 | PAS+FPs | 0.8420
±0.0015 | |
| 9 | GatedGCN | 0.8090
±0.0160 | |
| 109 | GIN | 0.7780
±0.0182 best reported | best at pub: GRPE: Relative Positional Encoding for Graph Transformer (2022) |
| 140 | GAT | 0.7717
±0.0137 best reported | best at pub: Do We Need Anisotropic Graph Neural Networks? (ICLR 2021) |
| 160 | GraphSAGE | 0.7690
±0.0136 | |
| 184 | GCN | 0.7630
±0.0030 best reported | best at pub: Motif-based Graph Representation Learning with Application to Chemical Molecules (2022) Difference within reported uncertainty; not counted as underperformance. |
| 185 | RADE-OFS | 0.7628
±0.0141 | This paper |
| 188 | DropEdge | 0.7620
±0.0100 best reported | best at pub: Automated Data Augmentations for Graph Classification (ICLR 2022) Difference within reported uncertainty; not counted as underperformance. |
| 196 | RADE-OF | 0.7609
±0.0124 | This paper |
| 200 | DropNode | 0.7604
±0.0100 | prev best: Graph Mixup with Soft Alignments (ICML 2023) Improvement within reported uncertainty; not highlighted. |
| 255 | DropMessage | 0.7421
±0.0107 | This paper |
| 260 | Dropout | 0.7400
±0.0094 | This paper |
| # | Model | Accuracy ↑ | Paper |
|---|---|---|---|
| 1 | GIANT-XRT | 0.7612
±0.0016 | |
| 2 | GEGCN | 0.7576
±0.0064 | |
| 3 | AGDN | 0.7522
±0.0007 | |
| 15 | GAT | 0.7365
±0.0011 best reported | best at pub: Fully-inductive Node Classification on Arbitrary Graphs (ICLR 2024) |
| 23 | GCN | 0.7300
±0.0017 best reported | |
| 25 | GraphSAGE | 0.7277
±0.0016 | |
| 50 | RADE-OF | 0.7185
±0.0032 | This paper |
| 59 | DropMessage | 0.7155
±0.0020 | This paper |
| 62 | DropNode | 0.7149
±0.0024 | This paper |
| 76 | RADE-OFS | 0.7095
±0.0019 | This paper |
| 77 | Dropout | 0.7077
±0.0042 | This paper |
| 81 | GIN | 0.7046
±0.0019 | |
| 82 | DropEdge | 0.7038
±0.0027 | This paper |
| 107 | MLP | 0.5765
±0.0012 |
LRGB
| # | Model | AP ↑ | Paper |
|---|---|---|---|
| 1 | S^2GCN | 0.7311
±0.0066 | |
| 2 | S4G | 0.7293
±0.0004 | |
| 3 | BuNN | 0.7276
±0.0065 | |
| 4 | GCN | 0.7261
±0.0011 best reported | best at pub: From Message-Passing to Linearized Graph Sequence Models (2026) |
| 26 | GIN | 0.7059
±0.0089 best reported | best at pub: From Message-Passing to Linearized Graph Sequence Models (2026) |
| 145 | RADE-OFS | 0.5912
±0.0091 | This paper |
| 146 | RADE-OF | 0.5882
±0.0065 | This paper |
| 151 | DropMessage | 0.5848
±0.0084 | This paper |
| 152 | GAT | 0.5842
±0.0046 best reported | best at pub: Graph Triple Attention Network: A Decoupled Perspective (2024) |
| 155 | DropEdge | 0.5818
±0.0068 | This paper |
| 163 | Dropout | 0.5484
±0.0045 | This paper |
| 166 | DropNode | 0.5421
±0.0076 | This paper |
| 181 | MLP | 0.4060
±0.0021 |
