Adversarially Robust Learning for Security-Constrained Optimal Power Flow

• URL: http://arxiv.org/abs/2111.06961v1
• Date: Fri, 12 Nov 2021 22:08:10 GMT
• Title: Adversarially Robust Learning for Security-Constrained Optimal Power Flow
• Authors: Priya L. Donti, Aayushya Agarwal, Neeraj Vijay Bedmutha, Larry Pileggi, J. Zico Kolter
• Abstract summary: We tackle the problem of N-k security-constrained optimal power flow (SCOPF) N-k SCOPF is a core problem for the operation of electrical grids. Inspired by methods in adversarially robust training, we frame N-k SCOPF as a minimax optimization problem.
• Score: 55.816266355623085
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: In recent years, the ML community has seen surges of interest in both adversarially robust learning and implicit layers, but connections between these two areas have seldom been explored. In this work, we combine innovations from these areas to tackle the problem of N-k security-constrained optimal power flow (SCOPF). N-k SCOPF is a core problem for the operation of electrical grids, and aims to schedule power generation in a manner that is robust to potentially k simultaneous equipment outages. Inspired by methods in adversarially robust training, we frame N-k SCOPF as a minimax optimization problem - viewing power generation settings as adjustable parameters and equipment outages as (adversarial) attacks - and solve this problem via gradient-based techniques. The loss function of this minimax problem involves resolving implicit equations representing grid physics and operational decisions, which we differentiate through via the implicit function theorem. We demonstrate the efficacy of our framework in solving N-3 SCOPF, which has traditionally been considered as prohibitively expensive to solve given that the problem size depends combinatorially on the number of potential outages.

Related papers

• QCQP-Net: Reliably Learning Feasible Alternating Current Optimal Power Flow Solutions Under Constraints [4.1920378271058425]
  We propose an innovated computational learning ACOPF, where the input is mapped to the ACOPF network in a computationally efficient manner. We show through simulations that our proposed method achieves superior feasibility rate and cost in situations where the existing-based approaches fail.
  arXiv  Detail & Related papers  (2024-01-11T20:17:44Z)
• Optimizing Solution-Samplers for Combinatorial Problems: The Landscape of Policy-Gradient Methods [52.0617030129699]
  We introduce a novel theoretical framework for analyzing the effectiveness of DeepMatching Networks and Reinforcement Learning methods. Our main contribution holds for a broad class of problems including Max-and Min-Cut, Max-$k$-Bipartite-Bi, Maximum-Weight-Bipartite-Bi, and Traveling Salesman Problem. As a byproduct of our analysis we introduce a novel regularization process over vanilla descent and provide theoretical and experimental evidence that it helps address vanishing-gradient issues and escape bad stationary points.
  arXiv  Detail & Related papers  (2023-10-08T23:39:38Z)
• Learning Optimal Power Flow Value Functions with Input-Convex Neural Networks [15.791200937436837]
  The Optimal Power Flow (OPF) problem is integral to power systems, aiming to optimize generation while adhering to dispatch constraints. This research explores machine learning (ML) to learn for faster analysis in the online setting while still allowing for coupling into other convex dependent decision problems.
  arXiv  Detail & Related papers  (2023-10-06T21:48:39Z)
• Energy Regularized RNNs for Solving Non-Stationary Bandit Problems [97.72614340294547]
  We present an energy term that prevents the neural network from becoming too confident in support of a certain action. We demonstrate that our method is at least as effective as methods suggested to solve the sub-problem of Rotting Bandits.
  arXiv  Detail & Related papers  (2023-03-12T03:32:43Z)
• Unsupervised Optimal Power Flow Using Graph Neural Networks [172.33624307594158]
  We use a graph neural network to learn a nonlinear parametrization between the power demanded and the corresponding allocation. We show through simulations that the use of GNNs in this unsupervised learning context leads to solutions comparable to standard solvers.
  arXiv  Detail & Related papers  (2022-10-17T17:30:09Z)
• DC3: A learning method for optimization with hard constraints [85.12291213315905]
  We present Deep Constraint Completion and Correction (DC3), an algorithm to address this challenge. DC3 implicitly completes partial solutions to satisfy equality constraints and unrolls-based corrections to satisfy inequality constraints. We demonstrate the effectiveness of DC3 in both synthetic optimization tasks and the real-world setting of AC optimal power flow.
  arXiv  Detail & Related papers  (2021-04-25T18:21:59Z)
• Learning to Solve AC Optimal Power Flow by Differentiating through Holomorphic Embeddings [17.338923885534193]
  Alternating current optimal power flow (AC-OPF) is one of the fundamental problems in power systems operation. In this paper, we show efficient strategies that circumvent this problem by differentiating through the operations of a power flow solver. We report a 12x increase in speed and a 40% increase in robustness compared to a traditional solver.
  arXiv  Detail & Related papers  (2020-12-16T18:23:51Z)
• Combining Deep Learning and Optimization for Security-Constrained Optimal Power Flow [94.24763814458686]
  Security-constrained optimal power flow (SCOPF) is fundamental in power systems. Modeling of APR within the SCOPF problem results in complex large-scale mixed-integer programs. This paper proposes a novel approach that combines deep learning and robust optimization techniques.
  arXiv  Detail & Related papers  (2020-07-14T12:38:21Z)
• Neural Networks for Encoding Dynamic Security-Constrained Optimal Power Flow [0.0]
  This paper introduces a framework to capture previously intractable optimization constraints and transform them to a mixed-integer linear program. We demonstrate our approach for power system operation considering N-1 security and small-signal stability, showing how it can efficiently obtain cost-optimal solutions.
  arXiv  Detail & Related papers  (2020-03-17T21:01:17Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.