arXiv AI By Federico Clerici, Ferran Bohigas-Daranas, Hamid Latif-Mart\'inez, Eduardo Prieto-Araujo, Oriol Gomis-Bellmunt, Pere Barlet-Ros

Benchmarking Graph Neural Networks for AC Power Flow: The Role of Inductive Biases and Physical Constraints

Read the original on arXiv AI →

The paper presents a unified benchmark of graph neural network (GNN) architectures for predicting AC power flow (ACPF) on IEEE 14‑bus and 118‑bus systems. It isolates the effects of message‑passing mechanisms and inductive biases by using identical preprocessing, training procedures, and comparable parameter budgets. The study finds that anisotropic message‑passing, explicit edge features for line impedances, and global context aggregation yield the best trade‑off between predictive accuracy and physical consistency, while two or three message‑passing layers are generally optimal under a fixed parameter budget.

Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv AI.

arXiv AI
Jul 16

MxGPS: Multiplex Graph Transformers for a Power Grid Foundation Model

arXiv:2607. 13763v1 Announce Type: cross Abstract: Single-task fine-tuning of graph neural networks (GNNs) for power grid problems exhibits a systematic failure mode: models that achieve the lowest in-distribution error degrade the most under topology shift.

By Charilaos Papaioannou, Ioannis Tsantilas, Dimitris Giannakakos, Vasilis Michalakopoulos, Sotiris Pelekis, Vangelis Marinakis, Arsam Aryandoust, Antonello Monti, Ricardo J. Bessa, Perdo P. Vergara, Jochen Cremer, Elissaios Sarmas
Hugging Face Trending Papers
Jul 15

MxGPS: Multiplex Graph Transformers for a Power Grid Foundation Model

Single-task fine-tuning of graph neural networks (GNNs) for power grid problems exhibits a systematic failure mode: models that achieve the lowest in-distribution error degrade the most under topology shift. We term this topology overfitting: the tendency of task-specific gradient signals to encode relational structure particular to the training topologies rather than the underlying physics, causing models to fail on unseen grids despite strong in-distribution performance.

arXiv AI
Sep 25

Reachability-Based Formal Verification of Graph Neural Networks with Node and Edge Features

The paper extends the neural network verification framework to graph neural networks by introducing GraphStar sets, which model uncertainty over both node and edge features. This allows sound propagation of linear message‑passing operations and ReLU nonlinearities for GCN and GINE layers. Experiments on power system tasks (PF, OPF, CFA) and graph classification benchmarks (ENZYMES, PROTEINS) show that the method, called GNNV, yields tighter robustness guarantees than CORA and provides, for the first time, edge‑aware guarantees for GINE‑based models under joint node and edge perturbations.

By Anne M. Tumlin, Ben Wooding, Zhenxuan Shao, Diego Manzanas Lopez, Tyler Derr, Taylor T. Johnson