広告

Differentiable Power-Flow Optimization

arXiv cs.AI / 2026/3/31

📰 ニュースIdeas & Deep AnalysisTools & Practical UsageModels & Research

要点

  • The paper introduces Differentiable Power-Flow (DPF), a reformulation of the AC power-flow problem into a differentiable simulation that supports end-to-end gradient propagation from power mismatches to model parameters.
  • DPF aims to address scalability limits of conventional Newton-Raphson AC power-flow methods while improving over purely data-driven surrogates that may lack physical constraint guarantees.
  • The approach is designed to be efficiently computed using GPU acceleration, sparse tensor representations, and batching features in frameworks like PyTorch, providing a scalable alternative to NR.
  • The authors highlight application fit for time-series analysis through reuse of previous solutions, for N-1 contingency analysis via batched processing, and for fast screening via speed plus early stopping.
  • The work is published as an arXiv announcement and includes a link to the authors’ code repository for adoption and experimentation.

Abstract

With the rise of renewable energy sources and their high variability in generation, the management of power grids becomes increasingly complex and computationally demanding. Conventional AC-power-flow simulations, which use the Newton-Raphson (NR) method, suffer from poor scalability, making them impractical for emerging use cases such as joint transmission-distribution modeling and global grid analysis. At the same time, purely data-driven surrogate models lack physical guarantees and may violate fundamental constraints. In this work, we propose Differentiable Power-Flow (DPF), a reformulation of the AC power-flow problem as a differentiable simulation. DPF enables end-to-end gradient propagation from the physical power mismatches to the underlying simulation parameters, thereby allowing these parameters to be identified efficiently using gradient-based optimization. We demonstrate that DPF provides a scalable alternative to NR by leveraging GPU acceleration, sparse tensor representations, and batching capabilities available in modern machine-learning frameworks such as PyTorch. DPF is especially suited as a tool for time-series analyses due to its efficient reuse of previous solutions, for N-1 contingency-analyses due to its ability to process cases in batches, and as a screening tool by leveraging its speed and early stopping capability. The code is available in the authors' code repository.

広告