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: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.
arXiv:2605.23194v2 Announce Type: replace-cross Abstract: Fast and reliable optimal power flow (OPF) approximation is important for power system operation, yet heterogeneous OPF graph models are ofte...
The paper proposes a hierarchical graph neural network (GNN) architecture for multi‑grid power‑flow modeling that exchanges information through two reduced graphs within a GENCO‑based corrective network. Experiments on three grid topologies show that the Kron‑derived transport approach reduces macro family‑balanced voltage error by 85 % compared to a flat backbone and 31 % compared to a Quotient construction, outperforming per‑bus mean baselines across all seeds. Preliminary results indicate strong generalization across operating scenarios within the studied topologies, though cross‑topology transfer remains an open challenge.
arXiv:2608. 16494v1 Announce Type: cross Abstract: Modern power systems face growing operational complexity driven by the integration of renewable energy sources, decentralization, and the need for real-time decision-making across a wide range of timescales.
arXiv:2609.16738v1 Announce Type: cross Abstract: Power Flow (PF), Optimal Power Flow (OPF), and State Estimation (SE) are fundamental problems in power system analysis, but solving them is computati...
The paper introduces Multi-Channel Physics-Aware Random Walk Fingerprints (MC-PA-RWF), a lightweight graph-level representation that incorporates physical edge states into random-walk propagation for power grid graphs. By constructing multiple edge-weighted channels from domain-relevant attributes and concatenating channel-specific fingerprints, the method achieves high balanced accuracy on PowerGraph benchmarks, outperforming topology-only RWF and matching or surpassing several graph neural network baselines. Experiments on three benchmark systems show statistically significant improvements, with the node-edge extension reaching up to 99.32% balanced accuracy and boosting failure-class F1 scores by 1.60–5.84 percentage points.
arXiv:2607. 29293v1 Announce Type: new Abstract: Accurate fault location is critical for distribution network reliability.
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.
arXiv:2509. 24256v2 Announce Type: replace-cross Abstract: The pretrain-transfer paradigm, which underpins the success of large language models (LLMs), has demonstrated the immense power of creating foundation models that learn generalizable representations from vast datasets.
arXiv:2603. 02462v2 Announce Type: replace-cross Abstract: A key challenge in developing unified neural solvers for combinatorial optimization (CO) is the efficient generalization of models from a given set of tasks to new tasks unseen during initial training.
arXiv:2607. 12241v1 Announce Type: cross Abstract: Machine-learned surrogates for the AC power flow (ACPF) problem amortize the cost of repeated solves on a fixed network, but lose one to two orders of magnitude of accuracy when a line outage changes the topology.
GridSFM is a 15‑million‑parameter physics‑inspired graph neural network that serves as a foundation model for solving AC Optimal Power Flow (AC‑OPF) across diverse grid topologies. Pretrained on 54 topologies ranging from 500 to 4,000 buses, it achieves a 2.45 % zero‑shot generation‑cost error on a held‑out 10,000‑bus case and adapts to unseen grids with only 100 solved instances using a physics‑informed fine‑tuning scheme based on Newton’s method. The authors address the disconnected feasible set of AC‑OPF by lifting and relaxing constraints with logarithmically penalized slacks, proving the resulting elastic feasible set is contractible and that solutions can be projected back onto the original feasible set.