Searcharxiv⌕ Search

arXiv subjects

Ayushi Jolotia

Publications and source records attributed to Ayushi Jolotia.

4 recordsLinked to original sources

Generalization Testing of Grid Foundation Models for Power Flow and Optimal Power Flow

There is growing interest in foundation models (FMs) for power grids, particularly for power flow and optimal power flow. Their usefulness depends on generalization accuracy, which existing works test on their own benchmarks. We propose a three-axis framework to test their generalization limits: changed admittance matrices of training grids, load levels, and unseen grids. We test GENCO, LUMINA and GridSFM against the DC baseline, alongside their reported limitations, and discuss theoretical reasons for their failures. Experiments reveal that adding a line degrades all FMs more than removing one, and longer lines eventually make LUMINA and fine-tuned GENCO worse than DC. All three degrade beyond their training load range, where the loading-voltage curve steepens. On unseen grids, LUMINA degrades sharply even inside its training range, and GridSFM fails on the grid farthest from it. Thus, beyond training conditions, FMs behave more like meta-models requiring test-time fine-tuning data and compute.

eess.SY↗

State Estimation as In-context Tabular Prediction

This letter poses state estimation (SE) as an in-context tabular prediction (ICTP) problem. The key idea is a tabular arrangement in which historical measurement vectors and corresponding state estimates serve as the context, and a new measurement vector forms the query for which we predict a state vector. We propose to use tabular foundation models (TFMs), pretrained on synthetic data, whose weights are never updated, so power system data is needed only as context. With frozen TFM weights we estimate the state of 14-, 30-, 33-, 70-, and 118-bus transmission and distribution networks, and do so where weighted least squares (WLS) fails or degrades, under low observability and with bad data. ICTP errors are 11 to 57$\times$ below the per-bus average of the context at full metering, and 1.3 to 4.0$\times$ below it with only 5% of measurements available. With measurements at six buses biased by 8$σ$, the ICTP angle error rises 1.8 to 5.0$\times$ over its bias-free value against 2.5 to 12.7$\times$ for WLS with bad-data detection. Without retraining, ICTP has lower voltage error than DSS$^2$ on both of its feeders, and lower than a retrained TAPINE on two of three reconfiguration sets.

eess.SY↗

Gradient-Free Topology Adaptation for Power Flow Surrogates via In-Context Whitening

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. This degradation is an operator shift. The altered admittance matrix changes the input-to-output map, so identical inputs yield a different output distribution. Existing methods correct this with target-topology data and per-topology gradient steps. We ask whether the correction can instead be made statistical and gradient-free. We propose In-Context Whitening (ICW), which trains an ACPF surrogate in an output space whitened by the base topology's first two moments, and adapts it to an unseen N-1 or N-2 topology by re-estimating that whitening from a few hundred solved cases on the new topology. This adaptation is gradient-free, weight-free, and architecture-agnostic. We prove that among affine whiteners the unique choice that preserves the coordinate-wise semantics of the physical output vector is ZCA whitening, so within efficient invertible corrections, two moments are sufficient. Across the IEEE 30-, 118-, and 300-bus systems under N-1 and N-2 contingencies, ICW reduces overall error by 6$\times$ to 28$\times$ over frozen surrogates (up to 54$\times$ per-quantity under N-2) and cuts worst-bus power-balance mismatch by up to 30$\times$, with consistent gains across three backbones. At deployment scale it matches or beats gradient-based adaptation in accuracy while adapting 21$\times$ to 34$\times$ faster, with a cost that parallelizes on commodity CPU cores rather than requiring one GPU per contingency.

eess.SY↗

Rethinking Neural Width for Alternating Current Optimal Power Flow Proxies

Deep learning proxies for Alternating Current Optimal Power Flow (ACOPF) lack systematic methods for determining architectural size. This paper conducts a constructive thought experiment to answer a fundamental inquiry: how wide must a neural network be to almost accurately approximate the ACOPF manifold? We introduce a Loss-Guided Neural Densification (LG-ND) algorithm that incrementally discovers necessary capacity by expanding only when the current deep neural network topology fails to improve further. Empirical results across various IEEE systems show that LG-ND achieves performance parity with literature baselines using up to ten times fewer neurons per layer. Such architectural minimalism is critical for the formal verification required in safety-critical grid operations.

cs.LG↗