Discovering Data Geometry: Energy-Driven Neural Diffusion
Abstract
Real-world data generation often involves complex inter-dependencies among instances, violating the IID-data hypothesis of standard learning paradigms and posing a challenge for uncovering the geometric structures for learning desired instance representations. To this end, we introduce an energy constrained diffusion model which encodes a batch of instances from a dataset into evolutionary states that progressively incorporate other instances' information by their interactions. The diffusion process is constrained by descent criteria w.r.t. a principled energy function that characterizes the global consistency of instance representations over latent structures. We provide rigorous theory that implies closed-form optimal estimates for the pairwise diffusion strength among arbitrary instance pairs, which gives rise to a new class of neural encoders, dubbed as DIFFormer (diffusion-based Transformers), with two instantiations: a simple version with linear complexity for prohibitive instance numbers, and an advanced version for learning complex structures. Experiments highlight the wide applicability of our model as a general-purpose encoder backbone with superior performance in various tasks, such as node classification on large graphs, semi-supervised image/text classification, and spatial-temporal dynamics prediction. The codes are available at.
Benchmark Results
Tested on 4 datasets 17 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: SplineCNN: Fast Geometric Deep Learning with Continuous B-Spline Kernels (2017) best today: Understanding Heterophily for Graph Neural Networks (ICML 2024) |
| 39 | SAGE | 0.8911
±0.0012 | |
| 44 | GAT | 0.8897
±0.0014 best reported | best at pub: Learned Low Precision Graph Neural Networks (2020) |
| 68 | NodeFormer | 0.8340
±0.0020 | prev best: Discovering the Representation Bottleneck of Graph Neural Networks (2022) best today: Efficient Tuning and Inference for Large Language Models on Textual Graphs (IJCAI 2024) |
| 87 | GRAND | 0.8815 best reported | best at pub: Graph-Coupled Oscillator Networks (ICML 2022) best today: Feature Transportation Improves Graph Neural Networks (AAAI 2023) |
| 189 | DIFFormer-s | 0.8590
±0.0040 | This paper |
| 223 | SGC | 0.8509
±0.0648 best reported | |
| 240 | GRAND-l | 0.8470
±0.0060 best reported | best at pub: GRAND: Graph Neural Diffusion (ICML 2021) Difference within reported uncertainty; not counted as underperformance. |
| 292 | DIFFORMER-a | 0.8410
±0.0060 | This paper |
| 309 | LDS | 0.8390
±0.0060 | This paper |
| 329 | GraphHeat | 0.8370 | This paper |
| 345 | GDC | 0.8360
±0.0020 | prev best: Scalable Graph Neural Networks via Bidirectional Propagation (NeurIPS 2020) |
| 390 | DGC-Euler | 0.8330 | This paper |
| 416 | GLCN | 0.8310
±0.0050 | This paper |
| 707 | Dense GAT | 0.7850
±0.0250 | This paper |
| 724 | MLP | 0.7768 best reported | best at pub: From Node Interaction to Hop Interaction: New Effective and Scalable Graph Learning Paradigm (2022) best today: Understanding Heterophily for Graph Neural Networks (ICML 2024) |
| 789 | GAT-kNN | 0.7380
±0.0170 | This paper |
| 807 | GCN-kNN | 0.7220
±0.0180 | This paper |
| 835 | LP | 0.6820 | prev best: Revisiting Semi-Supervised Learning with Graph Embeddings (ICML 2016) |
| 875 | ManiReg | 0.6040
±0.0080 | prev best: Revisiting Semi-Supervised Learning with Graph Embeddings (ICML 2016) Improvement within reported uncertainty; not highlighted. |
| # | Model | Accuracy ↑ | Paper |
|---|---|---|---|
| 1 | CNA | 0.9575
±0.0058 | |
| 2 | IS-GIB | 0.9390
±0.0187 | |
| 3 | EERM | 0.9112
±0.0145 | |
| 35 | GAT | 0.8080
±0.0026 best reported | best at pub: Gophormer: Ego-Graph Transformer for Node Classification (2021) best today: Feature Expansion for Graph Neural Networks (ICML 2023) |
| 44 | GCN | 0.8033
±0.0088 best reported | best at pub: Gophormer: Ego-Graph Transformer for Node Classification (2021) |
| 61 | GraphSAGE | 0.7923
±0.0053 | |
| 76 | NodeFormer | 0.7300
±0.0030 | prev best: Discovering the Representation Bottleneck of Graph Neural Networks (2022) Improvement within reported uncertainty; not highlighted. |
| 96 | SGC | 0.7765
±0.0012 best reported | |
| 122 | GRAND | 0.7410
±0.0170 | prev best: Graph-Coupled Oscillator Networks (ICML 2022) best today: Feature Transportation Improves Graph Neural Networks (AAAI 2023) Improvement within reported uncertainty; not highlighted. |
| 149 | DIFFORMER-a | 0.7570
±0.0030 | This paper |
| 186 | LDS | 0.7480
±0.0030 | This paper |
| 274 | DIFFormer-s | 0.7350
±0.0030 | This paper |
| 281 | GRAND-l | 0.7340
±0.0050 | This paper |
| 280 | GDC | 0.7340
±0.0030 | prev best: Scalable Graph Neural Networks via Bidirectional Propagation (NeurIPS 2020) |
| 293 | DGC-Euler | 0.7330
±0.0010 | This paper |
| 350 | MLP | 0.7289
±0.0010 best reported | best at pub: Block Modeling-Guided Graph Convolutional Neural Networks (AAAI 2021) best today: Gumbel-MPNN: Graph Rewiring with Gumbel-Softmax (2025) |
| 392 | GLCN | 0.7250
±0.0090 | This paper |
| 393 | GraphHeat | 0.7250 | This paper |
| 697 | ManiReg | 0.6770
±0.0160 best reported | best at pub: Learning Discrete Structures for Graph Neural Networks (ICML 2019) Difference within reported uncertainty; not counted as underperformance. |
| 736 | Dense GAT | 0.6640
±0.0150 | This paper |
| 849 | GCN-kNN | 0.5680
±0.0320 | This paper |
| 853 | GAT-kNN | 0.5640
±0.0380 | This paper |
| 877 | LP | 0.4530 best reported | best at pub: Attention-based Graph Neural Network for Semi-supervised Learning (2018) best today: Graph-Bert: Only Attention is Needed for Learning Graph Representations (2020) |
| # | Model | Accuracy ↑ | Paper |
|---|---|---|---|
| 1 | LGTL | 0.9518
±0.0011 | |
| 2 | MixHop (LO) | 0.9513
±0.0038 | |
| 3 | GraphSAGE (LO) | 0.9511
±0.0036 | |
| 7 | NodeFormer | 0.8150
±0.0040 | |
| 18 | GCN | 0.9296
±0.0015 best reported | best at pub: Tackling Over-Smoothing for General Graph Convolutional Networks (2020) |
| 20 | GAT | 0.9233
±0.0018 best reported | best at pub: Tackling Over-Smoothing for General Graph Convolutional Networks (2020) |
| 109 | GRAND | 0.8902 best reported | best at pub: Graph-Coupled Oscillator Networks (ICML 2022) best today: Feature Transportation Improves Graph Neural Networks (AAAI 2023) |
| 116 | SAGE | 0.8881
±0.0015 | |
| 141 | SGC | 0.8832
±0.0055 best reported | |
| 210 | MLP | 0.8690
±0.0074 best reported | best at pub: Block Modeling-Guided Graph Convolutional Neural Networks (AAAI 2021) best today: On the Equivalence of Graph Convolution and Mixup (TMLR 2023) |
| 338 | DIFFormer-s | 0.8180
±0.0030 | This paper |
| 404 | GraphHeat | 0.8050 | This paper |
| 405 | DIFFORMER-a | 0.8050
±0.0120 | This paper |
| 412 | GRAND-l | 0.8040
±0.0040 best reported | best at pub: GRAND: Graph Neural Diffusion (ICML 2021) Difference within reported uncertainty; not counted as underperformance. |
| 420 | DGC-Euler | 0.8030
±0.0010 | This paper |
| 625 | GDC | 0.7870
±0.0040 | prev best: Scalable Graph Neural Networks via Bidirectional Propagation (NeurIPS 2020) Improvement within reported uncertainty; not highlighted. |
| 648 | GLCN | 0.7840
±0.0150 | This paper |
| 790 | GAT-kNN | 0.7540
±0.0130 | This paper |
| 806 | GCN-kNN | 0.7450
±0.0320 | This paper |
| 831 | ManiReg | 0.7130
±0.0140 | prev best: Geometric deep learning on graphs and manifolds using mixture model CNNs (2016) Improvement within reported uncertainty; not highlighted. |
| 858 | Dense GAT | 0.6640
±0.0150 | This paper |
| 861 | LP | 0.6580 | prev best: Geometric deep learning on graphs and manifolds using mixture model CNNs (2016) |
LINKX Benchmarks
| # | Model | Accuracy ↑ | Paper |
|---|---|---|---|
| 1 | SAGE | 0.8597
±0.0021 | |
| 2 | Polynormer | 0.8595
±0.0007 | |
| 3 | NID_SAGE | 0.8563
±0.0031 | |
| 23 | GCN | 0.7601
±0.0049 best reported | best at pub: Convolutional Neural Networks on Graphs with Chebyshev Approximation, Revisited (NeurIPS 2022) best today: Mixture of Weak & Strong Experts on Graphs (ICLR 2023) |
| 24 | GraphSAGE | 0.7576
±0.0004 | |
| 28 | GAT | 0.7177
±0.0618 best reported | best at pub: FMP: Toward Fair Graph Message Passing against Topology Bias (2022) best today: Mixture of Weak & Strong Experts on Graphs (ICLR 2023) |
| 29 | SGC | 0.7124
±0.0046 best reported | best at pub: FMP: Toward Fair Graph Message Passing against Topology Bias (2022) |
| 31 | MLP | 0.7048
±0.0077 best reported | best at pub: FMP: Toward Fair Graph Message Passing against Topology Bias (2022) |
| 32 | DIFFormer-s | 0.6924
±0.0076 | This paper |
| 33 | NodeFormer | 0.6832
±0.0045 | This paper |
| 43 | LP | 0.5273 | This paper |
