Scalable Graph Compressed Convolutions
Abstract
Designing effective graph neural networks (GNNs) with message passing has two fundamental challenges, i.e., determining optimal message-passing pathways and designing local aggregators. Previous methods of designing optimal pathways are limited with information loss on the input features. On the other hand, existing local aggregators generally fail to extract multi-scale features and approximate diverse operators under limited parameter scales. In contrast to these methods, Euclidean convolution has been proven as an expressive aggregator, making it a perfect candidate for GNN construction. However, the challenges of generalizing Euclidean convolution to graphs arise from the irregular structure of graphs. To bridge the gap between Euclidean space and graph topology, we propose a differentiable method that applies permutations to calibrate input graphs for Euclidean convolution. The permutations constrain all nodes in a row regardless of their input order and therefore enable the flexible generalization of Euclidean convolution to graphs. Based on the graph calibration, we propose the Compressed Convolution Network (CoCN) for hierarchical graph representation learning. CoCN follows local feature-learning and global parameter-sharing mechanisms of convolution neural networks. The whole model can be trained end-to-end, with compressed convolution applied to learn individual node features and their corresponding structure features. CoCN can further borrow successful practices from Euclidean convolution, including residual connection and inception mechanism. We validate CoCN on both node-level and graph-level benchmarks. CoCN achieves superior performance over competitive GNN baselines. Codes are available at https://github.com/sunjss/CoCN.
Benchmark Results
Tested on 10 datasets 37 baseline values reported too low
Tables show presented results in global context (best 3 papers + GCN + MLP).
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) |
| 55 | PATCHY-SAN | 0.9260
±0.0420 best reported | best at pub: Graph Homomorphism Convolution (ICML 2020) best today: Graph Self-Supervised Learning with Learnable Structural and Positional Encodings (WWW 2025) Difference within reported uncertainty; not counted as underperformance. |
| 63 | GCN | 0.9220
±0.0440 best reported | best at pub: Breaking the Limits of Message Passing Graph Neural Networks (ICML 2021) best today: Depth-Adaptive Graph Neural Networks via Learnable Bakry-Émery Curvature (KDD 2025) |
| 101 | TopKPool | 0.9130
±0.0070 best reported | best at pub: Mind the Label Shift of Augmentation-based Graph OOD Generalization (2023) |
| 158 | GraphSAGE | 0.9040
±0.0780 best reported | best at pub: Asynchronous Neural Networks for Learning in Graphs (2022) Difference within reported uncertainty; not counted as underperformance. |
| 202 | GMT | 0.8990
±0.0420 best reported | best at pub: Structural Entropy Guided Graph Hierarchical Pooling (ICML 2022) best today: Graph Classification via Reference Distribution Learning: Theory and Practice (NeurIPS 2024) |
| 208 | CoCN | 0.8989
±0.0039 | This paper |
| 239 | DiffPool | 0.8940
±0.0460 best reported | best at pub: Total Variation Graph Neural Networks (ICML 2022) best today: Graph Classification via Reference Distribution Learning: Theory and Practice (NeurIPS 2024) |
| 245 | SEP | 0.8940
±0.0610 best reported | best today: Graph Classification via Reference Distribution Learning: Theory and Practice (NeurIPS 2024) Difference within reported uncertainty; not counted as underperformance. |
| 367 | ASAP | 0.8740
±0.0570 best reported | best at pub: Multi-grained Semantics-aware Graph Neural Networks (2020) best today: Graph Classification via Reference Distribution Learning: Theory and Practice (NeurIPS 2024) |
| 391 | CoCN vanilla | 0.8708
±0.0017 | This paper |
| 403 | MLP | 0.8660
±0.0495 | |
| 623 | SAGPool | 0.7986
±0.0236 best reported | best at pub: Embedding Graphs on Grassmann Manifold (2022) Difference within reported uncertainty; not counted as underperformance. |
| 718 | SAGE | 0.7490
±0.0870 |
| # | Model | Accuracy ↑ | Paper |
|---|---|---|---|
| 1 | WL-MLP | 0.9954 | |
| 2 | GIN | 0.9934 best reported | best at pub: 1-WL Expressiveness Is (Almost) All You Need (2022) |
| 3 | GCN | 0.9727 best reported | best at pub: 1-WL Expressiveness Is (Almost) All You Need (2022) |
| 5 | DiffPool | 0.9210
±0.0260 best reported | best at pub: Where to Mask: Structure-Guided Masking for Graph Masked Autoencoders (IJCAI 2024) |
| 13 | CoCN | 0.8583
±0.0086 | This paper |
| 80 | CoCN vanilla | 0.8289
±0.0019 | This paper |
| 87 | PG-GNN | 0.8280
±0.0130 | This paper |
| 115 | PathNN | 0.8230
±0.0190 | This paper |
| 131 | GraphSAGE | 0.8200
±0.0100 best reported | best at pub: Weisfeiler and Leman Go Infinite: Spectral and Combinatorial Pre-Colorings (TMLR 2022) |
| 226 | GMT | 0.7990
±0.0040 best reported | best at pub: Structural Entropy Guided Graph Hierarchical Pooling (ICML 2022) best today: Graph Classification via Reference Distribution Learning: Theory and Practice (NeurIPS 2024) Difference within reported uncertainty; not counted as underperformance. |
| 254 | SEP | 0.7935
±0.0033 | prev best: Graph Parsing Networks (ICLR 2024) |
| 259 | SAGPool | 0.7910
±0.0300 best reported | best at pub: The expressive power of pooling in Graph Neural Networks (NeurIPS 2023) |
| 288 | PATCHY-SAN | 0.7860
±0.0190 | This paper |
| 309 | ASAP | 0.7821
±0.0175 best reported | best at pub: Multi-grained Semantics-aware Graph Neural Networks (2020) |
| 355 | TopKPool | 0.7706
±0.0090 best reported | best at pub: Embedding Graphs on Grassmann Manifold (2022) |
| 534 | PathNet | 0.6410
±0.0230 | This paper |
| # | Model | Accuracy ↑ | Paper |
|---|---|---|---|
| 1 | MSH-GNN | 0.9410
±0.0330 | |
| 2 | GRDL | 0.8260
±0.0120 | |
| 3 | GMN | 0.8225 | |
| 7 | DiffPool | 0.8161
±0.0232 best reported | |
| 24 | CoCN | 0.7948
±0.0051 | This paper |
| 29 | ASAP | 0.7892
±0.0145 best reported | best at pub: Multi-grained Semantics-aware Graph Neural Networks (2020) |
| 32 | GIN | 0.7880
±0.0410 best reported | |
| 58 | TopKPool | 0.7768 best reported | best at pub: Memory-Based Graph Networks (ICLR 2020) |
| 67 | SAGE | 0.7726
±0.0228 | |
| 90 | CoCN vanilla | 0.7686
±0.0013 | This paper |
| 92 | PG-GNN | 0.7680
±0.0380 | This paper |
| 115 | SEP | 0.7642
±0.0039 | This paper |
| 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 | |
| 154 | SAGPool | 0.7595
±0.0452 best reported | best at pub: Embedding Graphs on Grassmann Manifold (2022) Difference within reported uncertainty; not counted as underperformance. |
| 155 | GraphSAGE | 0.7590
±0.0320 best reported | best at pub: On Structural Expressive Power of Graph Transformers (KDD 2023) best today: Simplifying Graph Convolutional Networks with Redundancy-Free Neighbors (2025) Difference within reported uncertainty; not counted as underperformance. |
| 225 | PathNN | 0.7520
±0.0390 | This paper |
| 237 | PATCHY-SAN | 0.7510
±0.0330 best reported | best at pub: Scalable Expressiveness through Preprocessed Graph Perturbations (2024) best today: Graph Classification via Reference Distribution Learning: Theory and Practice (NeurIPS 2024) Difference within reported uncertainty; not counted as underperformance. |
| 236 | GMT | 0.7510
±0.0060 best reported | best at pub: Structural Entropy Guided Graph Hierarchical Pooling (ICML 2022) best today: Multi-Scale Harmonic Encoding for Feature-Wise Graph Message Passing (2025) Difference within reported uncertainty; not counted as underperformance. |
| 453 | PathNet | 0.7050
±0.0390 | This paper |
| # | Model | Accuracy ↑ | Paper |
|---|---|---|---|
| 1 | WL-MLP | 0.9792 | |
| 2 | MSH-GNN | 0.9640
±0.0070 | |
| 3 | CoCN | 0.8722
±0.0013 | This paper |
| 5 | CoCN vanilla | 0.8615
±0.0010 | This paper |
| 23 | GCN | 0.8260
±0.0220 best reported | best at pub: Scalable Expressiveness through Preprocessed Graph Perturbations (2024) Difference within reported uncertainty; not counted as underperformance. |
| 30 | GIN | 0.8220
±0.0210 best reported | best at pub: Scalable Expressiveness through Preprocessed Graph Perturbations (2024) |
| 33 | DiffPool | 0.8213
±0.0043 | prev best: CogDL: A Comprehensive Library for Graph Deep Learning (WWW 2021) |
| 39 | SAGPool | 0.8176
±0.0157 best reported | best at pub: Embedding Graphs on Grassmann Manifold (2022) |
| 57 | TopKPool | 0.8140
±0.0094 best reported | best at pub: Embedding Graphs on Grassmann Manifold (2022) |
| 69 | SEP | 0.8130
±0.0020 best reported | best today: Multi-Scale Harmonic Encoding for Feature-Wise Graph Message Passing (2025) Difference within reported uncertainty; not counted as underperformance. |
| 88 | PG-GNN | 0.8090
±0.0080 | This paper |
| 93 | GMT | 0.8074
±0.0054 | This paper |
| 136 | GraphSAGE | 0.7970
±0.0170 best reported | best at pub: Quaternion Graph Neural Networks (2020) |
| 137 | SAGE | 0.7970
±0.0170 | |
| 151 | MLP | 0.7920
±0.0240 | |
| 166 | ASAP | 0.7864
±0.0050 | This paper |
| 275 | PATCHY-SAN | 0.7310
±0.0270 best reported | best at pub: Scalable Expressiveness through Preprocessed Graph Perturbations (2024) best today: Graph Classification via Reference Distribution Learning: Theory and Practice (NeurIPS 2024) Difference within reported uncertainty; not counted as underperformance. |
Heterophilic Graphs
| # | Model | Accuracy ↑ | Paper |
|---|---|---|---|
| 1 | P^2GNN | 0.9541
±0.0272 | |
| 2 | ACM-GCN | 0.9480
±0.0380 | |
| 3 | RF-GCN | 0.9429 | |
| 15 | GGCN | 0.9230
±0.0367 best reported | best at pub: Understanding convolution on graphs via energies (TMLR 2022) best today: $P^2$GNN: Two Prototype Sets to boost GNN Performance (2026) Difference within reported uncertainty; not counted as underperformance. |
| 21 | APPNP | 0.9181
±0.0196 best reported | best at pub: LON-GNN: Spectral GNNs with Learnable Orthonormal Basis (2023) |
| 24 | MLP | 0.9136
±0.0070 | |
| 35 | GCNII | 0.8918
±0.0396 best reported | best at pub: Convolutional Neural Networks on Graphs with Chebyshev Approximation, Revisited (NeurIPS 2022) best today: $P^2$GNN: Two Prototype Sets to boost GNN Performance (2026) |
| 38 | FAGCN | 0.8852
±0.0133 best reported | best at pub: Node-oriented Spectral Filtering for Graph Neural Networks (2022) |
| 63 | ACMII-GCN | 0.8649
±0.0673 best reported | best at pub: Graph Neural Reaction Diffusion Models Submitted to the editors June 2023. Accepted in March 2024. (2024) Difference within reported uncertainty; not counted as underperformance. |
| 71 | CoCN vanilla | 0.8622
±0.0049 | This paper |
| 85 | ChebNet | 0.8533
±0.0104 best reported | best at pub: Node-oriented Spectral Filtering for Graph Neural Networks (2022) Difference within reported uncertainty; not counted as underperformance. |
| 98 | AERO-GNN | 0.8480
±0.0330 best reported | best at pub: Sign is Not a Remedy: Multiset-to-Multiset Message Passing for Learning on Heterophilic Graphs (ICML 2024) Difference within reported uncertainty; not counted as underperformance. |
| 123 | LINKX | 0.8346
±0.0061 best reported | best at pub: Differentiable Cluster Graph Neural Network (2024) Difference within reported uncertainty; not counted as underperformance. |
| 124 | CoCN | 0.8339
±0.0165 | This paper |
| 138 | SAGE | 0.8269 | |
| 157 | GraphSAGE | 0.8196
±0.0739 best reported | best at pub: Heterophily-Aware Graph Attention Network (2023) Difference within reported uncertainty; not counted as underperformance. |
| 170 | GCN | 0.8082
±0.0360 best reported | best at pub: Differentiable Cluster Graph Neural Network (2024) best today: Bayesian Neighborhood Adaptation for Graph Neural Networks (TMLR 2025) |
| 183 | MixHop | 0.7950
±0.0630 best reported | best at pub: Label-Wise Graph Convolutional Network for Heterophilic Graphs (2021) Difference within reported uncertainty; not counted as underperformance. |
| 200 | GPRGCN | 0.7811
±0.0655 | This paper |
| 342 | Geom-GCN | 0.6412 best reported | best at pub: Steering Graph Neural Networks with Pinning Control (2023) Difference within reported uncertainty; not counted as underperformance. |
| # | Model | Accuracy ↑ | Paper |
|---|---|---|---|
| 1 | DiGGR | 0.4535
±0.0353 | |
| 2 | TRIGON | 0.4402
±0.0028 | |
| 3 | DoG | 0.4320
±0.0120 | |
| 38 | GCNII | 0.4082
±0.0179 best reported | best at pub: Feature Expansion for Graph Neural Networks (ICML 2023) best today: $P^2$GNN: Two Prototype Sets to boost GNN Performance (2026) |
| 41 | APPNP | 0.4046
±0.0064 best reported | best at pub: A Quasi-Wasserstein Loss for Learning Graph Neural Networks (WWW 2023) |
| 42 | MLP | 0.4026
±0.0108 | |
| 56 | FAGCN | 0.3970 best reported | best at pub: Beyond Low-frequency Information in Graph Convolutional Networks (AAAI 2021) |
| 62 | GGCN | 0.3929
±0.0048 best reported | best at pub: Feature Transportation Improves Graph Neural Networks (AAAI 2023) best today: $P^2$GNN: Two Prototype Sets to boost GNN Performance (2026) Difference within reported uncertainty; not counted as underperformance. |
| 68 | GraphSAGE | 0.3899
±0.0085 best reported | best at pub: A Quasi-Wasserstein Loss for Learning Graph Neural Networks (WWW 2023) |
| 87 | Geom-GCN | 0.3810 best reported | best at pub: Beyond Low-frequency Information in Graph Convolutional Networks (AAAI 2021) |
| 88 | ChebNet | 0.3802
±0.0023 best reported | best at pub: Node-oriented Spectral Filtering for Graph Neural Networks (2022) |
| 131 | ACMII-GCN | 0.3709
±0.0132 best reported | best at pub: Feature Transportation Improves Graph Neural Networks (AAAI 2023) best today: Graph Neural Reaction Diffusion Models Submitted to the editors June 2023. Accepted in March 2024. (2024) Difference within reported uncertainty; not counted as underperformance. |
| 135 | GCN | 0.3690 best reported | best at pub: Beyond Low-frequency Information in Graph Convolutional Networks (AAAI 2021) |
| 155 | CoCN | 0.3662
±0.0085 | This paper |
| 157 | AERO-GNN | 0.3657
±0.0110 | This paper |
| 162 | MixHop | 0.3648
±0.0120 best reported | best at pub: Towards Deep Attention in Graph Neural Networks: Problems and Remedies (ICML 2023) |
| 170 | CoCN vanilla | 0.3635
±0.0012 | This paper |
| 180 | LINKX | 0.3610
±0.0155 | This paper |
| 225 | GPRGCN | 0.3516
±0.0090 | This paper |
| 266 | GIN | 0.3410
±0.0030 |
| # | Model | Accuracy ↑ | Paper |
|---|---|---|---|
| 1 | Hetero-S (GAT 8-layer) | 0.8693 | |
| 2 | Dir-GNN+CNA | 0.8586
±0.0180 | |
| 3 | GAT | 0.8560 | |
| 17 | CoCN | 0.7935
±0.0142 | This paper |
| 18 | CoCN exp. | 0.7935 | This paper |
| 19 | CoCN vanilla | 0.7917
±0.0017 | This paper |
| 40 | AERO-GNN | 0.7158
±0.0240 | |
| 48 | GGCN | 0.7114
±0.0184 | This paper |
| 52 | GCN | 0.7033 best reported | best at pub: Understanding Heterophily for Graph Neural Networks (ICML 2024) |
| 63 | ACMII-GCN | 0.6846
±0.0170 | This paper |
| 64 | LINKX | 0.6842
±0.0138 | This paper |
| 79 | APPNP | 0.6670
±0.0270 best reported | best at pub: Restructuring Graphs for Higher Homophily via Adaptive Spectral Clustering (AAAI 2022) |
| 103 | GCNII | 0.6386
±0.0304 | This paper |
| 108 | SAGE | 0.6340
±0.0300 | |
| 113 | GPRGCN | 0.6259
±0.0204 | This paper |
| 124 | Geom-GCN | 0.6090 best reported | best at pub: Non-Local Graph Neural Networks (2020) best today: Beyond Smoothing: Unsupervised Graph Representation Learning with Edge Heterophily Discriminating (AAAI 2022) Difference within reported uncertainty; not counted as underperformance. |
| 129 | MixHop | 0.6050
±0.0253 | This paper |
| 140 | ChebNet | 0.5928
±0.0125 best reported | best at pub: LON-GNN: Spectral GNNs with Learnable Orthonormal Basis (2023) Difference within reported uncertainty; not counted as underperformance. |
| 169 | MLP | 0.5429 |
| # | Model | Accuracy ↑ | Paper |
|---|---|---|---|
| 1 | IBG-NN | 0.7763
±0.0179 | |
| 2 | Dir-GNN+CNA | 0.7747
±0.0128 | |
| 3 | DHGNN | 0.7684
±0.0161 | |
| 13 | CoCN | 0.7298
±0.0178 | This paper |
| 14 | CoCN vanilla | 0.7295
±0.0023 | This paper |
| 26 | ACMII-GCN | 0.6740
±0.0221 best reported | best at pub: Feature Transportation Improves Graph Neural Networks (AAAI 2023) |
| 40 | LINKX | 0.6181
±0.0180 | This paper |
| 41 | AERO-GNN | 0.6176
±0.0240 | |
| 46 | GCN | 0.6067 | |
| 68 | APPNP | 0.5590
±0.0290 best reported | best at pub: Restructuring Graphs for Higher Homophily via Adaptive Spectral Clustering (AAAI 2022) |
| 69 | GGCN | 0.5567
±0.0187 best reported | best at pub: GPNet: Simplifying Graph Neural Networks via Multi-channel Geometric Polynomials (2022) best today: $P^2$GNN: Two Prototype Sets to boost GNN Performance (2026) Difference within reported uncertainty; not counted as underperformance. |
| 107 | GPRGCN | 0.4631
±0.0246 | This paper |
| 125 | ChebNet | 0.4386
±0.0164 | prev best: Optimizing Polynomial Graph Filters: A Novel Adaptive Krylov Subspace Approach (WWW 2024) |
| 127 | MixHop | 0.4380
±0.0148 | This paper |
| 128 | GraphSAGE | 0.4378
±0.0190 best reported | |
| 172 | MLP | 0.3930
±0.0079 | |
| 176 | GCNII | 0.3881
±0.0197 best reported | best at pub: GPNet: Simplifying Graph Neural Networks via Multi-channel Geometric Polynomials (2022) best today: $P^2$GNN: Two Prototype Sets to boost GNN Performance (2026) Difference within reported uncertainty; not counted as underperformance. |
| 179 | Geom-GCN | 0.3832
±0.0092 best reported | best at pub: Feature Transportation Improves Graph Neural Networks (AAAI 2023) best today: Graph Neural Reaction Diffusion Models Submitted to the editors June 2023. Accepted in March 2024. (2024) Difference within reported uncertainty; not counted as underperformance. |
LRGB
| # | Model | MRR ↑ | Paper |
|---|---|---|---|
| 1 | FloydNet | 0.6143 | |
| 2 | Exphormer | 0.4737
±0.0024 | |
| 3 | Exphormer + LapPE | 0.4737
±0.0024 | |
| 8 | GatedGCN | 0.4670
±0.0004 best reported | best at pub: Learning Long Range Dependencies on Graphs via Random Walks (ICLR 2024) best today: Benchmarking Positional Encodings for GNNs and Graph Transformers (KDD 2024) |
| 15 | GINE | 0.4617
±0.0005 best reported | best at pub: Recipe for a General, Powerful, Scalable Graph Transformer (NeurIPS 2022) best today: Benchmarking Positional Encodings for GNNs and Graph Transformers (KDD 2024) |
| 16 | GIN | 0.4617
±0.0005 | |
| 28 | GCN | 0.4526
±0.0006 best reported | best at pub: Learning Long Range Dependencies on Graphs via Random Walks (ICLR 2024) best today: Benchmarking Positional Encodings for GNNs and Graph Transformers (KDD 2024) |
| 36 | CoCN exp. | 0.3713
±0.0037 | This paper |
| 44 | Cache-GNN+RWSE | 0.3488
±0.0008 | This paper |
| 48 | DRew-GCN | 0.3444
±0.0017 | This paper |
| 56 | Graph Diffuser | 0.3388
±0.0011 | This paper |
| 82 | GCNII | 0.3161
±0.0004 | This paper |
Heterophily Benchmark
| # | Model | Accuracy ↑ | Paper |
|---|---|---|---|
| 1 | UniGAP | 0.6375
±0.0110 | |
| 2 | H2GCN + HalfHop | 0.5961
±0.0100 | |
| 3 | GraphSAGE + HalfHop | 0.5897
±0.0150 | |
| 7 | H2GCN | 0.5681
±0.0090 best reported | |
| 12 | SAGE | 0.5569
±0.0023 | |
| 14 | GAT | 0.5559
±0.0027 best reported | best at pub: Graph Neural Networks for Graphs with Heterophily: A Survey (2022) |
| 24 | GCN | 0.5411
±0.0034 best reported | best at pub: Graph Neural Networks for Graphs with Heterophily: A Survey (2022) |
| 80 | Sp. CoCN | 0.5074
±0.0015 | This paper |
| 82 | SGC | 0.5066
±0.0048 | This paper |
| 84 | MLP | 0.5058 | |
| 137 | FAGCN | 0.4632
±0.0250 best reported | best at pub: Unleashing the Potential of Fractional Calculus in Graph Neural Networks with FROND (ICLR 2024) best today: Distributed-Order Fractional Graph Operating Network (NeurIPS 2024) Difference within reported uncertainty; not counted as underperformance. |
| 150 | GPRGCN | 0.4488
±0.0034 | This paper |
| 164 | Seg. CoCN | 0.4306
±0.0021 | This paper |
| 196 | GloGNN | 0.3728
±0.0066 best reported | best at pub: Unleashing the Potential of Fractional Calculus in Graph Neural Networks with FROND (ICLR 2024) best today: Distributed-Order Fractional Graph Operating Network (NeurIPS 2024) Difference within reported uncertainty; not counted as underperformance. |
