LRGB
PascalVOC-SP
Structure
11,355Graphs
479Nodes
2,710Edges
21Classes
14Node Feature Dim
2Edge Feature Dim
Coverage
132Results
1Variants
22Papers
- Graph Cascades: Contagion-Based Mesoscopic Rewiring for Structure-Aware Graph Machine Learning Graph Cascades: Contagion-Based Mesoscopic Rewiring for Structure-Aware Graph Machine Learning
- Beyond Oversquashing: Understanding Signal Propagation in GNNs Via Observables Beyond Oversquashing: Understanding Signal Propagation in GNNs Via Observables
- GCCM: Enhancing Generative Graph Prediction via Contrastive Consistency Model GCCM: Enhancing Generative Graph Prediction via Contrastive Consistency Model
- FloydNet: A Learning Paradigm for Global Relational Reasoning FloydNet: A Learning Paradigm for Global Relational Reasoning
- TMLR 2025: Chimera: State Space Models Beyond Sequences Chimera: State Space Models Beyond Sequences TMLR 2025
- KDD 2025: Towards Efficient Few-shot Graph Neural Architecture Search via Partitioning Gradient Contribution Towards Efficient Few-shot Graph Neural Architecture Search via Partitioning Gradient Contribution KDD 2025
- AdS-GNN - a Conformally Equivariant Graph Neural Network AdS-GNN - a Conformally Equivariant Graph Neural Network
- Plain Transformers Can be Powerful Graph Learners Plain Transformers Can be Powerful Graph Learners
- KDD 2024: Benchmarking Positional Encodings for GNNs and Graph Transformers Benchmarking Positional Encodings for GNNs and Graph Transformers KDD 2024
- ICLR 2024: When Graph Neural Networks Meet Dynamic Mode Decomposition When Graph Neural Networks Meet Dynamic Mode Decomposition ICLR 2024
- AAAI 2024: A Scalable and Effective Alternative to Graph Transformers A Scalable and Effective Alternative to Graph Transformers AAAI 2024
- ICML 2024: What Improves the Generalization of Graph Transformers? A Theoretical Dive into the Self-attention and Positional Encoding What Improves the Generalization of Graph Transformers? A Theoretical Dive into the Self-attention and Positional Encoding ICML 2024
- ICML 2024: Graph External Attention Enhanced Transformer Graph External Attention Enhanced Transformer ICML 2024
- Spectral Greedy Coresets for Graph Neural Networks Spectral Greedy Coresets for Graph Neural Networks
- Bundle Neural Networks for message diffusion on graphs Bundle Neural Networks for message diffusion on graphs
- ICLR 2024: Distinguished In Uniform: Self Attention Vs. Virtual Nodes Distinguished In Uniform: Self Attention Vs. Virtual Nodes ICLR 2024
- RandAlign: A Parameter-Free Method for Regularizing Graph Convolutional Networks RandAlign: A Parameter-Free Method for Regularizing Graph Convolutional Networks
- KDD 2024: Graph Mamba: Towards Learning on Graphs with State Space Models Graph Mamba: Towards Learning on Graphs with State Space Models KDD 2024
- Operator Learning Meets Numerical Analysis: Improving Neural Networks through Iterative Methods Operator Learning Meets Numerical Analysis: Improving Neural Networks through Iterative Methods
- TMLR 2023: Where Did the Gap Go? Reassessing the Long-Range Graph Benchmark Where Did the Gap Go? Reassessing the Long-Range Graph Benchmark TMLR 2023
- ICML 2023: On the Connection Between MPNN and Graph Transformer On the Connection Between MPNN and Graph Transformer ICML 2023
- NeurIPS 2022: LRGB LRGB NeurIPS 2022
21-class node classification Assign one of 21 semantic-segmentation labels, including background, to every superpixel node. Evaluated by F1.
Dataset details
Task
Assign one of 21 semantic-segmentation labels, including background, to every superpixel node. A superpixel receives the ground-truth class of the pixel at the superpixel’s center-of-mass coordinate.
Data
Each of 11,355 images from the Semantic Boundaries Dataset augmentation of Pascal VOC 2011 becomes one graph. SLIC with compactness 30 produces at most 500 image regions, and two regions are connected when they share a boundary in the default region-adjacency graph.
Features
Each node has 12 RGB summary values—the mean, standard deviation, maximum, and minimum in each channel—plus its two-dimensional center-of-mass coordinate. Each edge stores the average Sobel response and pixel count along the shared boundary.
Splits and evaluation
The original training set remains training data. The original validation set is divided equally into validation and test subsets using a stratified image-level meta-label obtained by majority vote over non-background node labels, yielding 8,498/1,428/1,429 graphs. The score is class-weighted macro F1 over nodes.
Quirks and pitfalls
This is not pixel-level segmentation; labels and predictions are quantized to superpixels, and labeling only from the center pixel can misrepresent mixed regions. LRGB also releases compactness-10 and 8-nearest-neighbor graph variants, whose structures and edge features differ from the default compactness-30 region-boundary version.
Sources
SOTA Progression
new SOTA
matches SOTA at that time
other proposed result
other baseline result
Leaderboard
| # | Model | F1 ↑ | F1 score | F1-macro | fraction of nodes satisfying $\Delta_n(z_m)>0$ | Paper |
|---|---|---|---|---|---|---|
| 1 | NeuralWalker | 0.4912
±
0.0042 | — | — | — | |
| 2 | PPGT | 0.4641
±
0.0033 | — | — | — | |
| 3 | CRaWl | 0.4588
±
0.0079 | — | — | — | |
| 4 | GEAET | 0.4585 | — | — | — | |
| 5 | GraphGPS | 0.4538
±
0.0083 | — | — | — | |
| 6 | GraphGPS + ESLapPE | 0.4538
±
0.0083 | — | — | — | |
| 7 | GraphGPS + RWSE | 0.4531
±
0.0073 | — | — | — | |
| 8 | GraphGPS + (noPE) | 0.4517
±
0.0112 | — | — | — | |
| 9 | GraphGPS + GCKN | 0.4515
±
0.0053 | — | — | — | |
| 10 | GraphGPS+LapPE | 0.4501
±
0.0057 | — | — | — | |
| 11 | GraphGPS + RWDIFF | 0.4488
±
0.0097 | — | — | — | |
| 12 | GatedGCN-VN | 0.4477
±
0.0137 | — | — | — | |
| 13 | Chimera | 0.4460
±
0.0070 | — | — | — | |
| 14 | GPS | 0.4440
±
0.0065 | — | — | — | |
| 15 | GraphGPS+Transformer | 0.4440
±
0.0054 | — | — | — | |
| 16 | Graph Mamba | 0.4393
±
0.0112 | — | — | — | |
| 17 | GraphGPS + SignNet | 0.4291
±
0.0056 | — | — | — | |
| 18 | GPS + RandAlign | 0.4288
±
0.0062 | — | — | — | |
| 19 | Exphormer | 0.4242
±
0.0044 | — | — | — | |
| 20 | Exphormer + LapPE | 0.4242
±
0.0044 | — | — | — | |
| 21 | GCCM | 0.4219
±
0.0102 | — | — | — | |
| 22 | Exphormer + RWSE | 0.4218
±
0.0063 | — | — | — | |
| 23 | GECO | 0.4210
±
0.0080 | — | — | — | |
| 24 | EXPHORMER + GCN | 0.4196
±
0.0049 | — | — | — | |
| 25 | GPS-PCL | 0.4196
±
0.0086 | — | — | — | |
| 26 | Graph-Mamba | 0.4191 | — | — | — | |
| 27 | Exphormer + RWDIFF | 0.4165
±
0.0059 | — | — | — | |
| 28 | Exphormer + noPE | 0.4149
±
0.0047 | — | — | — | |
| 29 | Exphormer + ESLapPE | 0.4141
±
0.0054 | — | — | — | |
| 30 | Exphormer + WLPE | 0.4104
±
0.0071 | — | — | — | |
| 31 | BuNN | 0.4049
±
0.0046 | — | — | — | |
| 32 | FloydNet | 0.4046 | — | — | — | |
| 33 | Exphormer | 0.3975
±
0.0037 | — | — | — | |
| 34 | Exphormer + SignNet | 0.3966
±
0.0020 | — | — | — | |
| 35 | GatedGCN + GCKN | 0.3933
±
0.0044 | — | — | — | |
| 36 | GatedGCN + ESLapPE | 0.3930
±
0.0041 | — | — | — | |
| 37 | GatedGCN + noPE | 0.3923
±
0.0020 | — | — | — | |
| 38 | GatedGCN+LapPE | 0.3920
±
0.0033 | — | — | — | |
| 39 | GatedGCN + RWDIFF | 0.3919
±
0.0019 | — | — | — | |
| 40 | GPS-LGD | 0.3912
±
0.0207 | — | — | — | |
| 41 | GatedGCN+RWSE | 0.3882
±
0.0041 | — | — | — | |
| 42 | GatedGCN | 0.3880
±
0.0040 | — | — | — | |
| 43 | Gated-GCN | 0.3880
±
0.0040 | — | — | — | |
| 44 | GatedGCN + SignNet | 0.3814
±
0.0005 | — | — | — | |
| 45 | GatedGCN + WLPE | 0.3805
±
0.0018 | — | — | — | |
| 46 | GPS w/ Transformer | 0.3748
±
0.0109 | — | — | — | |
| 47 | GPS | 0.3748
±
0.0109 | — | — | — | |
| 48 | GraphSAGE (PIGN) | 0.3560
±
0.0037 | — | — | — | |
| 49 | GRIT | 0.3556
±
0.0019 | — | — | — | |
| 50 | GRIT + noPE | 0.3556
±
0.0019 | — | — | — |
SOTA performance
set a new SOTA at the time
matched the SOTA at the time