TANGO: Graph Neural Dynamics via Learned Energy and Tangential Flows
Not on the map. Why?
Abstract (arXiv)
We introduce TANGO -- a dynamical systems inspired framework for graph representation learning that governs node feature evolution through a learned energy landscape and its associated descent dynamics. At the core of our approach is a learnable Lyapunov function over node embeddings, whose gradient defines an energy-reducing direction that guarantees convergence and stability. To enhance flexibility while preserving the benefits of energy-based dynamics, we incorporate a novel tangential component, learned via message passing, that evolves features while maintaining the energy value. This decomposition into orthogonal flows of energy gradient descent and tangential evolution yields a flexible form of graph dynamics, and enables effective signal propagation even in flat or ill-conditioned energy regions, that often appear in graph learning. Our method mitigates oversquashing and is compatible with different graph neural network backbones. Empirically, TANGO achieves strong performance across a diverse set of node and graph classification and regression benchmarks, demonstrating the effectiveness of jointly learned energy functions and tangential flows for graph neural networks.
Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 85 of its 105 references that are in the map. First posted on arXiv 7 Aug 2025.
Builds on
85 of 105 references.
References · 85
- 2017Attention Is All You Needcited by 59,932
- 2019PyTorch: An Imperative Style, High-Performance Deep Learning Librarycited by 20,160
- 2016Semi-Supervised Classification with Graph Convolutional Networkscited by 11,282
- 2017Graph Attention Networkscited by 8,854
- 2017Inductive Representation Learning on Large Graphscited by 6,284
- 2018How Powerful are Graph Neural Networks?cited by 4,355
- 2018Neural Ordinary Differential Equationscited by 3,733
- 2021Convex optimizationcited by 2,479
- 2021Efficiently Modeling Long Sequences with Structured State Spacescited by 2,424
- 2020Big Bird: Transformers for Longer Sequencescited by 1,673
- 2021Geometric Deep Learning: Grids, Groups, Graphs, Geodesics, and Gaugescited by 1,131
- 2019Strategies for Pre-training Graph Neural Networkscited by 964
38 more
- 2020Simple and Deep Graph Convolutional Networkscited by 857
- 2022Recipe for a General, Powerful, Scalable Graph Transformercited by 702
- 2020Benchmarking Graph Neural Networkscited by 672
- 2020A Generalization of Transformer Networks to Graphscited by 653
- 2020On the Bottleneck of Graph Neural Networks and its Practical Implicationscited by 624
- 2020Adaptive Universal Generalized PageRank Graph Neural Networkcited by 592
- 2020Masked Label Prediction: Unified Message Passing Model for Semi-Supervised Classificationcited by 500
- 2020Principal Neighbourhood Aggregation for Graph Netscited by 477
- 2021Understanding over-squashing and bottlenecks on graphs via curvaturecited by 471
- 2021Rethinking Graph Transformers with Spectral Attentioncited by 468
- 2019MixHop: Higher-Order Graph Convolutional Architectures via Sparsified Neighborhood Mixingcited by 442
- 2019Diffusion Improves Graph Learningcited by 414
- 2022Message Passing Neural PDE Solverscited by 368
- 2021Beyond Low-frequency Information in Graph Convolutional Networkscited by 361
- 2017Residual Gated Graph ConvNetscited by 341
- 2023A critical look at the evaluation of GNNs under heterophily: Are we really making progress?cited by 332
- 2021Graph Neural Networks with Learnable Structural and Positional Representationscited by 326
- 2019Revisiting Graph Neural Networks: All We Have is Low-Pass Filterscited by 260
- 2021GRAND: Graph Neural Diffusioncited by 258
- 2022Long Range Graph Benchmarkcited by 258
- 2020A Note on Over-Smoothing for Graph Neural Networkscited by 245
- 2020Graph Neural Networks with Heterophilycited by 202
- 2018Deep Neural Networks Motivated by Partial Differential Equationscited by 187
- 2022Graph neural networks for materials science and chemistrycited by 181
- 2022Finding Global Homophily in Graph Neural Networks When Meeting Heterophilycited by 179
- 2016A Theory of Generative ConvNetcited by 174
- 2022How Powerful are Spectral Graph Neural Networkscited by 169
- 2023On Over-Squashing in Message Passing Neural Networks: The Impact of Width, Depth, and Topologycited by 163
- 2021From Stars to Subgraphs: Uplifting Any GNN with Local Structure Awarenesscited by 154
- 2019Graph Neural Ordinary Differential Equationscited by 153
- 2023Graph Inductive Biases in Transformers without Message Passingcited by 150
- 2020Directional Graph Networkscited by 132
- 2024Graph-Mamba: Towards Long-Range Graph Sequence Modeling with Selective State Spacescited by 132
- 2022Graph-Coupled Oscillator Networkscited by 123
- 2023Rethinking the Expressive Power of GNNs via Graph Biconnectivitycited by 119
- 2019Continuous Graph Neural Networkscited by 114
- 2021Global Self-Attention as a Replacement for Graph Convolutioncited by 113
- 2021PDE-GCN: Novel Architectures for Graph Neural Networks Motivated by Partial Differential Equationscited by 106
50 most cited of 85 All 85 (JSON)
Built on by
Not cited yet.