FlowSymm: Physics Aware, Symmetry Preserving Graph Attention for Network Flow Completion
Not on the map. Why?
Abstract (arXiv)
Recovering missing flows on the edges of a network, while exactly respecting local conservation laws, is a fundamental inverse problem that arises in many systems such as transportation, energy, and mobility. We introduce FlowSymm, a novel architecture that combines (i) a group-action on divergence-free flows, (ii) a graph-attention encoder to learn feature-conditioned weights over these symmetry-preserving actions, and (iii) a lightweight Tikhonov refinement solved via implicit bilevel optimization. The method first anchors the given observation on a minimum-norm divergence-free completion. We then compute an orthonormal basis for all admissible group actions that leave the observed flows invariant and parameterize the valid solution subspace, which shows an Abelian group structure under vector addition. A stack of GATv2 layers then encodes the graph and its edge features into per-edge embeddings, which are pooled over the missing edges and produce per-basis attention weights. This attention-guided process selects a set of physics-aware group actions that preserve the observed flows. Finally, a scalar Tikhonov penalty refines the missing entries via a convex least-squares solver, with gradients propagated implicitly through Cholesky factorization. Across three real-world flow benchmarks (traffic, power, bike), FlowSymm outperforms state-of-the-art baselines in RMSE, MAE and correlation metrics.
Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 24 of its 38 references that are in the map. First posted on arXiv 29 Jan 2026.
Builds on
24 of 38 references.
References · 24
- 2016Semi-Supervised Classification with Graph Convolutional Networkscited by 11,282
- 2018How Powerful are Graph Neural Networks?cited by 4,355
- 2016Convolutional Neural Networks on Graphs with Fast Localized Spectral Filteringcited by 2,085
- 2021Geometric Deep Learning: Grids, Groups, Graphs, Geodesics, and Gaugescited by 1,131
- 2021How Attentive are Graph Attention Networks?cited by 818
- 2018Tensor field networks: Rotation- and translation-equivariant neural networks for 3D point cloudscited by 735
- 2021E(3)-Equivariant Graph Neural Networks for Data-Efficient and Accurate Interatomic Potentialscited by 701
- 2020SE(3)-Transformers: 3D Roto-Translation Equivariant Attention Networkscited by 602
- 2018Bilevel Programming for Hyperparameter Optimization and Meta-Learningcited by 403
- 2021Choose a Transformer: Fourier or Galerkincited by 333
- 2017Forward and Reverse Gradient-Based Hyperparameter Optimizationcited by 232
- 2021A Practical Method for Constructing Equivariant Multilayer Perceptrons for Arbitrary Matrix Groupscited by 185
12 more
- 2019Relational Pooling for Graph Representationscited by 150
- 2021Physics-informed graph neural Galerkin networks: A unified framework for solving PDE-governed forward and inverse problemscited by 100
- 2020Implicit Graph Neural Networkscited by 98
- 2022Physics-Embedded Neural Networks: Graph Neural PDE Solvers with Mixed Boundary Conditionscited by 33
- 2019Graph-based Semi-Supervised & Active Learning for Edge Flowscited by 25
- 2022Equivariant Graph Hierarchy-Based Neural Networkscited by 24
- 2022Bi-level Physics-Informed Neural Networks for PDE Constrained Optimization using Broyden's Hypergradientscited by 17
- 2024Graph Neural PDE Solvers with Conservation and Similarity-Equivariancecited by 15
- 2023Learning Lagrangian Fluid Mechanics with E(3)-Equivariant Graph Neural Networkscited by 12
- 2023Graph Automorphism Group Equivariant Neural Networkscited by 4
- 2024Conservation-informed Graph Learning for Spatiotemporal Dynamics Predictioncited by 4
- 2025Dynami-CAL GraphNet: A Physics-Informed Graph Neural Network Conserving Linear and Angular Momentum for Dynamical Systemscited by 3
Built on by
Not cited yet.