GIST: Gauge-Invariant Spectral Transformers for Scalable Graph Neural Operators
Abstract
Neural operators on irregular meshes face a fundamental tension. Spectral positional encodings, the natural choice for capturing geometry, require cubic-complexity eigendecomposition and inadvertently break gauge invariance through numerical solver artifacts; existing efficient approximations sacrifice gauge symmetry by design. Both failure modes break discretization invariance: models fail to transfer across mesh resolutions of the same domain, and similarly across different graphs of related structure in inductive settings. We propose GIST (Gauge-Invariant Spectral Transformer), a scalable neural operator that resolves this tension by restricting attention to pairwise inner products of efficient approximate spectral embeddings. We prove these inner products estimate an exactly gauge-invariant graph kernel at end-to-end $ (N)$ complexity, and establish a formal connection between gauge invariance and discretization-invariant learning with bounded mismatch error. To our knowledge, GIST is the first scalable graph neural operator with a provable discretization-mismatch bound. Empirically, GIST sets state-of-the-art on the AirfRANS, ShapeNet-Car, DrivAerNet, and DrivAerNet++ mesh benchmarks (up to 750K nodes), and additionally matches strong baselines on standard graph benchmarks (e.g., 99.50\
Benchmark Results
Tested on 2 datasets 6 baseline values reported too low
Tables show presented results in global context (best 3 papers + GCN + MLP).
Classic
| # | Model | Accuracy ↑ | Paper |
|---|---|---|---|
| 1 | GraphTARIF | 0.9703
±0.0019 | |
| 2 | GAT | 0.9669
±0.0014 best reported | |
| 3 | GAT+T | 0.9660
±0.0007 | |
| 7 | SAGE | 0.9643
±0.0027 | |
| 8 | GCN | 0.9632
±0.0008 best reported | |
| 18 | Specformer | 0.9580
±0.0026 best reported | best at pub: NTFormer: A Composite Node Tokenized Graph Transformer for Node Classification (2024) Difference within reported uncertainty; not counted as underperformance. |
| 26 | GIST | 0.9561
±0.0023 | This paper |
| 43 | Exphormer (LapPE) | 0.9527
±0.0042 | This paper |
| 87 | GCNII | 0.9430
±0.0020 best reported | best at pub: Polynormer: Polynomial-Expressive Graph Transformer in Linear Time (ICLR 2024) |
| 390 | MLP | 0.9128
±0.0063 |
| # | Model | F1 ↑ | Paper |
|---|---|---|---|
| 1 | GAMLP(JK) | 0.9982
±0.0001 | |
| 2 | GraphCON-GCN | 0.9960 | |
| 3 | GCNII | 0.9953
±0.0001 | prev best: Graph-Coupled Oscillator Networks (ICML 2022) |
| 6 | GIST | 0.9950
±0.0003 | This paper |
| 4 | GraphSAINT | 0.9950 | This paper |
| 5 | GCNIII | 0.9950
±0.0003 | This paper |
| 9 | Cluster-GCN | 0.9940 best reported | best at pub: Graph-Coupled Oscillator Networks (ICML 2022) |
| 17 | GaAN | 0.9871 | This paper |
| 21 | GCN | 0.9850 best reported | best at pub: Graph-Coupled Oscillator Networks (ICML 2022) |
| 57 | GAT | 0.9732
±0.0032 best reported | best at pub: HAT-GAE: Self-Supervised Graph Auto-encoders with Hierarchical Adaptive Masking and Trainable Corruption (2023) Difference within reported uncertainty; not counted as underperformance. |
| 72 | GATv2 | 0.9630 | This paper |
| 92 | GIN | 0.8724
±0.0002 | |
| 101 | GraphSAGE | 0.7860 best reported | best at pub: Optimization-Induced Graph Implicit Nonlinear Diffusion (ICML 2022) |
| 173 | MLP | 0.4620 |
