Searcharxiv⌕ Search

arXiv · 2611.22181

Benchmarking a Grid Foundation Model for AC Optimal Power Flow: Feasibility and Warm-Start Results on Synthetic Texas and South Carolina Grids

Abstract

Learning-based surrogates for alternating-current optimal power flow (AC-OPF) are often judged by the gap between their objective value and that of a nonlinear solver, which does not show that a prediction satisfies power balance and network limits. This paper tests whether predictions from the pretrained foundation model GridSFM-Open 1.1.0, recently released by Microsoft, are feasible AC-OPF operating points and whether they are useful initial values for a nonlinear solver. The model was evaluated zero-shot and after fine-tuning on 10, 100, and 1,000 labeled scenarios (FT10, FT100, and FT1000) on 500 scenarios for each of two synthetic grids, ACTIVSg2000 (Texas) and ACTIVSg500 (South Carolina), with Ipopt, MATPOWER MIPS, and pandapower PIPS as solver references. The lowest Texas median cost gap, 0.44\% for FT100, coincided with thermal violations in 24.1\% of cases and a median maximum bus power mismatch of 89 MW and 197 Mvar. Texas zero-shot predictions had a median maximum mismatch of 648 MW and 1,641 Mvar, and every South Carolina case violated a thermal limit for every model variant. Seeding Ipopt with FT1000 predictions gave geometric-mean solve-time speedups of 1.55x on South Carolina and 1.12x on Texas (p = 0.06, not significant at the 5\% level), while zero-shot seeds slowed South Carolina solves (0.26x). A small objective gap therefore did not indicate feasibility: although median zero-shot inference took only 1.32 s on Texas and 0.157 s on South Carolina on a shared host, every prediction still required a nonlinear solver, and fine-tuned predictions gave modest, grid-dependent warm-start speedups while zero-shot predictions slowed convergence on one grid. GridSFM may therefore be useful for initializing a nonlinear solver, but obtaining feasible AC-OPF solutions still required the solver.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Tam Kemabonta, Brighton Ombuki, Vladimir Abdelnour. 2026-11-17. Benchmarking a Grid Foundation Model for AC Optimal Power Flow: Feasibility and Warm-Start Results on Synthetic Texas and South Carolina Grids. https://searcharxiv.com/abs/2611.22181

Citations retain the original authors and DOI and include this site’s record URL. If this discovery service contributed to your research, you can also cite Searcharxiv by Indiciae: BibTeX · RIS.

KEEP EXPLORING

Related papers

Mean-Field Learning for Storage Aggregation

Distributed energy storage devices can be aggregated to provide operational flexibility for power systems. Their efficient integration into system-level optimization calls for an accurate and computationally tractable surrogate that jointly represents aggregate flexibility and operating costs. However, constructing such a surrogate is challenging due to device heterogeneity, nonconvex operating constraints, and high-dimensional power trajectories. To address these challenges, this paper develops a mean-field learning framework for storage aggregation. Using random-set expectations, we show that the joint representation of aggregate flexibility and operating costs converges almost surely to a deterministic convex mean-field limit. This limit provides a learning benchmark for storage aggregation, against which we bound the approximation error of any convex surrogate. These theoretical results motivate a convex virtual-battery surrogate with physically interpretable parameters. We learn these parameters through a bilevel optimization problem that matches the optimal values of the surrogate and the storage fleet when both respond to a set of price scenarios. We derive closed-form gradients to solve this problem efficiently. Case studies illustrate the theoretical results and demonstrate the framework's approximation accuracy, computational efficiency, and robustness to device heterogeneity.

eess.SY↗

HyperKKL: Enabling Non-Autonomous State Estimation through Dynamic Weight Conditioning

This paper proposes HyperKKL, a novel learning approach for designing Kazantzis-Kravaris/Luenberger (KKL) observers for non-autonomous nonlinear systems. While KKL observers offer a rigorous theoretical framework by immersing nonlinear dynamics into a stable linear latent space, its practical realization relies on solving Partial Differential Equations (PDE) that are analytically intractable. Current existing learning-based approximations of the KKL observer are mostly designed for autonomous systems, failing to generalize to driven dynamics without expensive retraining or online gradient updates. HyperKKL addresses this by employing a hypernetwork architecture that encodes the exogenous input signal to instantaneously generate the parameters of the KKL observer, effectively learning a family of immersion maps parameterized by the external drive. We rigorously evaluate this approach against a curriculum learning strategy that attempts to generalize from autonomous regimes via training heuristics alone. The novel approach is illustrated on four numerical simulations in benchmark examples including the Duffing, Van der Pol, Lorenz, and Rössler systems.

eess.SY↗

Dynamic Flexibility Requests in Local Flexibility Markets: Quantifying the DSO Willingness to Pay

Local Flexibility Markets (LFMs) require Distribution System Operators (DSOs) to determine both the quantity of flexibility to procure and the corresponding willingness to pay during market clearing. Existing approaches typically rely on centralized AC-OPF clearing algorithms with limited practical scalability or strictly localized, static flexibility requests driven primarily by congestion management, while the economic value of flexibility is largely neglected. This paper proposes a dynamic flexibility-request methodology in which the DSO's willingness to pay is embedded directly into the market-clearing objective by monetizing transformer and cable aging, network losses, and voltage congestion. To enable computationally efficient clearing, exact convex piecewise-linear epigraph reformulations of the IEEE C57.91 transformer aging model and an Arrhenius-based cable aging model are developed and formally proven to preserve exactness. The proposed framework is validated on a modified CIGRE MV benchmark and compared with a recent state-of-the-art flexibility-request methodology. The results demonstrate significantly higher market liquidity, more efficient flexibility procurement, and improved network operations while preserving the market's transparency and non-discrimination principles.

eess.SY↗