paper-with-me

Papers

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

2026-07-14 · Ayushi Jolotia, Parikshit Pareek arxiv

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.

📄 PDF Abstract BibTeX arXiv:2607.12241

Code (0)

등록된 구현이 없습니다.

Similar Papers 제목 키워드 기반

Accelerated DC loadflow solver for topology optimization

2025-01-29 · Nico Westerbeck, Joost van Dijk, Jan Viebahn, Christian Merz 외

We present a massively parallel solver that accelerates DC loadflow computations for power grid topology optimization tasks. Our approach leverages low-rank updates of the Power Transfer Distribution Factors (PTDFs) to r…

Diversity

MxGPS: Multiplex Graph Transformers for a Power Grid Foundation Model

2026-07-15 · Charilaos Papaioannou, Ioannis Tsantilas, Dimitris Giannakakos, Vasilis Michalakopoulos 외 arxiv

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…

DisRFM: Polar Riemannian Flow Matching for Structure-Preserving Graph Domain Adaptation

2026-01-31 · Yingxu Wang, Xinwang Liu, Mengzhu Wang, Siyang Gao 외 arxiv

Graph Domain Adaptation (GDA) aims to transfer graph classifiers across domains with both semantic and topological shifts. Existing Euclidean adversarial methods face two challenges: Structural Degeneration, where domain…

Representation LearningGRAPH DOMAIN ADAPTATION

A Meta-Learning Approach to the Optimal Power Flow Problem Under Topology Reconfigurations

2020-12-21 · Yexiang Chen, Subhash Lakshminarayana, Carsten Maple, H. Vincent Poor

Recently, there has been a surge of interest in adopting deep neural networks (DNNs) for solving the optimal power flow (OPF) problem in power systems. Computing optimal generation dispatch decisions using a trained DNN …

Meta-Learning

Modular Meta-Learning for Power Control via Random Edge Graph Neural Networks

2021-08-04 · Ivana Nikoloska, Osvaldo Simeone

In this paper, we consider the problem of power control for a wireless network with an arbitrarily time-varying topology, including the possible addition or removal of nodes. A data-driven design methodology that leverag…

Meta-Learning