mlsanityData to 14 Oct 2026

PGLearn -- An Open-Source Learning Toolkit for Optimal Power Flow

arXiv 2505.22825 ↗First posted 28 May 2025cs.LG cs.AI cs.SYcited by 11

Not on the map. Why?

Abstract (arXiv)

Machine Learning (ML) techniques for Optimal Power Flow (OPF) problems have recently garnered significant attention, reflecting a broader trend of leveraging ML to approximate and/or accelerate the resolution of complex optimization problems. These developments are necessitated by the increased volatility and scale in energy production for modern and future grids. However, progress in ML for OPF is hindered by the lack of standardized datasets and evaluation metrics, from generating and solving OPF instances, to training and benchmarking machine learning models. To address this challenge, this paper introduces PGLearn, a comprehensive suite of standardized datasets and evaluation tools for ML and OPF. PGLearn provides datasets that are representative of real-life operating conditions, by explicitly capturing both global and local variability in the data generation, and by, for the first time, including time series data for several large-scale systems. In addition, it supports multiple OPF formulations, including AC, DC, and second-order cone formulations. Standardized datasets are made publicly available to democratize access to this field, reduce the burden of data generation, and enable the fair comparison of various methodologies. PGLearn also includes a robust toolkit for training, evaluating, and benchmarking machine learning models for OPF, with the goal of standardizing performance evaluation across the field. By promoting open, standardized datasets and evaluation metrics, PGLearn aims at democratizing and accelerating research and innovation in machine learning applications for optimal power flow problems. Datasets are available for download at https://www.huggingface.co/PGLearn.

Key facts. Cited by 11 papers in the map (data through 14 Oct 2026). Builds on 22 of its 48 references that are in the map. First posted on arXiv 28 May 2025.

Builds on

22 of 48 references.

References · 22

  1. 2019Differentiable Convex Optimization Layerscited by 465
  2. 2021DC3: A learning method for optimization with hard constraintscited by 184
  3. 2015Parallelizing the dual revised simplex methodcited by 89
  4. 2020Lagrangian Duality for Constrained Deep Learningcited by 74
  5. 2019The Power Grid Library for Benchmarking AC Optimal Power Flow Algorithmscited by 65
  6. 2024Clarabel: An interior-point solver for conic programs with quadratic objectivescited by 44
  7. 2022JuMP 1.0: Recent improvements to a modeling language for mathematical optimizationcited by 37
  8. 2023End-to-End Feasible Optimization Proxies for Large-Scale Economic Dispatchcited by 35
  9. 2017PowerModels.jl: An Open-Source Framework for Exploring Power Flow Formulationscited by 33
  10. 2021Learning Optimization Proxies for Large-Scale Security-Constrained Economic Dispatchcited by 29
  11. 2024OPFData: Large-scale datasets for AC optimal power flow with topological perturbationscited by 24
  12. 2021OPF-Learn: An Open-Source Framework for Creating Representative AC Optimal Power Flow Datasetscited by 18
10 more
  1. 2016AC Power Flow Data in MATPOWER and QCQP Format: iTesla, RTE Snapshots, and PEGASEcited by 17
  2. 2024Learning Constrained Optimization with Deep Augmented Lagrangian Methodscited by 16
  3. 2023Dual Conic Proxies for AC Optimal Power Flowcited by 11
  4. 2024Dual Lagrangian Learning for Conic Optimizationcited by 11
  5. 2019Learning an Optimally Reduced Formulation of OPF through Meta-optimizationcited by 8
  6. 2021Data-Driven Time Series Reconstruction for Modern Power Systems Researchcited by 7
  7. 2023Real-Time Risk Analysis with Optimization Proxiescited by 5
  8. 2019Proving Global Optimality of ACOPF Solutionscited by 3
  9. 2022Bucketized Active Sampling for Learning ACOPFcited by 3
  10. 2023Learning Lagrangian Multipliers for the Travelling Salesman Problemcited by 3

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2025: 6; 2026: 5.

11 papers.