Scalable Exact Verification of Optimization Proxies for Large-Scale Optimal Power Flow

• URL: http://arxiv.org/abs/2405.06109v1
• Date: Thu, 9 May 2024 21:30:03 GMT
• Title: Scalable Exact Verification of Optimization Proxies for Large-Scale Optimal Power Flow
• Authors: Rahul Nellikkath, Mathieu Tanneau, Pascal Van Hentenryck, Spyros Chatzivasileiadis,
• Abstract summary: This paper proposes a scalable algorithm to compute worst-case violations of NN proxies used for approximating large power systems. It will help build trust in ML models to be deployed in large industry-scale power grids.
• Score: 14.666242596687217
• License: http://creativecommons.org/licenses/by-nc-nd/4.0/
• Abstract: Optimal Power Flow (OPF) is a valuable tool for power system operators, but it is a difficult problem to solve for large systems. Machine Learning (ML) algorithms, especially Neural Networks-based (NN) optimization proxies, have emerged as a promising new tool for solving OPF, by estimating the OPF solution much faster than traditional methods. However, these ML algorithms act as black boxes, and it is hard to assess their worst-case performance across the entire range of possible inputs than an OPF can have. Previous work has proposed a mixed-integer programming-based methodology to quantify the worst-case violations caused by a NN trained to estimate the OPF solution, throughout the entire input domain. This approach, however, does not scale well to large power systems and more complex NN models. This paper addresses these issues by proposing a scalable algorithm to compute worst-case violations of NN proxies used for approximating large power systems within a reasonable time limit. This will help build trust in ML models to be deployed in large industry-scale power grids.

Related papers

• CANOS: A Fast and Scalable Neural AC-OPF Solver Robust To N-1 Perturbations [0.7545833157486899]
  In the simplest setting, Optimal Power Flow (OPF) determines how much power to generate in order to minimize costs. Power grid operators use approximations of the AC-OPF problem because solving the exact problem is prohibitively slow with state-of-the-art solvers. In the present work, we train a deep learning system (CANOS) to predict near-optimal solutions (within 1% of the true AC-OPF cost) without compromising speed.
  arXiv  Detail & Related papers  (2024-03-26T12:47:04Z)
• 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)
• GP CC-OPF: Gaussian Process based optimization tool for Chance-Constrained Optimal Power Flow [54.94701604030199]
  The Gaussian Process (GP) based Chance-Constrained Optimal Flow (CC-OPF) is an open-source Python code for economic dispatch (ED) problem in power grids. The developed tool presents a novel data-driven approach based on the CC-OP model for solving the large regression problem with a trade-off between complexity and accuracy.
  arXiv  Detail & Related papers  (2023-02-16T17:59:06Z)
• Learning to Solve the AC-OPF using Sensitivity-Informed Deep Neural Networks [52.32646357164739]
  We propose a deep neural network (DNN) to solve the solutions of the optimal power flow (ACOPF) The proposed SIDNN is compatible with a broad range of OPF schemes. It can be seamlessly integrated in other learning-to-OPF schemes.
  arXiv  Detail & Related papers  (2021-03-27T00:45:23Z)
• Offline Model-Based Optimization via Normalized Maximum Likelihood Estimation [101.22379613810881]
  We consider data-driven optimization problems where one must maximize a function given only queries at a fixed set of points. This problem setting emerges in many domains where function evaluation is a complex and expensive process. We propose a tractable approximation that allows us to scale our method to high-capacity neural network models.
  arXiv  Detail & Related papers  (2021-02-16T06:04:27Z)
• A Meta-Learning Approach to the Optimal Power Flow Problem Under Topology Reconfigurations [69.73803123972297]
  We propose a DNN-based OPF predictor that is trained using a meta-learning (MTL) approach. The developed OPF-predictor is validated through simulations using benchmark IEEE bus systems.
  arXiv  Detail & Related papers  (2020-12-21T17:39: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)
• High-Fidelity Machine Learning Approximations of Large-Scale Optimal Power Flow [49.2540510330407]
  AC-OPF is a key building block in many power system applications. Motivated by increased penetration of renewable sources, this paper explores deep learning to deliver efficient approximations to the AC-OPF.
  arXiv  Detail & Related papers  (2020-06-29T20:22:16Z)

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.