Aggregation Buffer: Revisiting DropEdge with a New Parameter Block
Abstract
We revisit DropEdge, a data augmentation technique for GNNs which randomly removes edges to expose diverse graph structures during training. While being a promising approach to effectively reduce overfitting on specific connections in the graph, we observe that its potential performance gain in supervised learning tasks is significantly limited. To understand why, we provide a theoretical analysis showing that the limited performance of DropEdge comes from the fundamental limitation that exists in many GNN architectures. Based on this analysis, we propose Aggregation Buffer, a parameter block specifically designed to improve the robustness of GNNs by addressing the limitation of DropEdge. Our method is compatible with any GNN model, and shows consistent performance improvements on multiple datasets. Moreover, our method effectively addresses well-known problems such as degree bias or structural disparity as a unifying solution. Code and datasets are available at https://github.com/dooho00/agg-buffer.
Benchmark Results
Tested on 2 datasets 3 baseline values reported too low
Tables show presented results in global context (best 3 papers + GCN + MLP).
Heterophilic Graphs
| # | Model | Accuracy ↑ | Paper |
|---|---|---|---|
| 1 | DiGGR | 0.4535
±0.0353 | |
| 2 | TRIGON | 0.4402
±0.0028 | |
| 3 | DoG | 0.4320
±0.0120 | |
| 42 | MLP | 0.4026
±0.0108 best reported | best at pub: Heterophily-Aware Graph Attention Network (2023) |
| 68 | GraphSAGE | 0.3899
±0.0085 |
| # | Model | Accuracy ↑ | Paper |
|---|---|---|---|
| 1 | Hetero-S (GAT 8-layer) | 0.8693 | |
| 2 | Dir-GNN+CNA | 0.8586
±0.0180 | |
| 3 | GAT | 0.8560 | |
| 52 | GCN | 0.7033 best reported | best at pub: Understanding Heterophily for Graph Neural Networks (ICML 2024) |
| 108 | SAGE | 0.6340
±0.0300 | |
| 169 | MLP | 0.5429 best reported | best at pub: Understanding Heterophily for Graph Neural Networks (ICML 2024) |
| 238 | DropEdge | 0.4310
±0.0050 best reported | best at pub: DeepRicci: Self-supervised Graph Structure-Feature Co-Refinement for Alleviating Over-squashing (2023) Difference within reported uncertainty; not counted as underperformance. |
| 251 | Aggregation Buffer | 0.4096
±0.0483 | This paper |
| 252 | DropMessage | 0.4048
±0.0307 | This paper |
| 253 | GraphPatcher | 0.4035
±0.0411 | This paper |
| 254 | TuneUp | 0.4024
±0.0424 | This paper |
| 256 | DropNode | 0.3974
±0.0279 | This paper |
