mlsanityData to 7 Oct 2026

Learning-to-solve unit commitment based on few-shot physics-guided spatial-temporal graph convolution network

arXiv 2405.01200 ↗First posted 2 May 2024eess.SY cs.LG cs.SYcited by 0

Not on the map. Why?

Abstract (arXiv)

This letter proposes a few-shot physics-guided spatial temporal graph convolutional network (FPG-STGCN) to fast solve unit commitment (UC). Firstly, STGCN is tailored to parameterize UC. Then, few-shot physics-guided learning scheme is proposed. It exploits few typical UC solutions yielded via commercial optimizer to escape from local minimum, and leverages the augmented Lagrangian method for constraint satisfaction. To further enable both feasibility and continuous relaxation for integers in learning process, straight-through estimator for Tanh-Sign composition is proposed to fully differentiate the mixed integer solution space. Case study on the IEEE benchmark justifies that, our method bests mainstream learning ways on UC feasibility, and surpasses traditional solver on efficiency.

Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 5 of its 9 references that are in the map. First posted on arXiv 2 May 2024.

Builds on

5 of 9 references.

References · 5

  1. 2017Spatio-Temporal Graph Convolutional Networks: A Deep Learning Framework for Traffic Forecastingcited by 1,125
  2. 2019Understanding Straight-Through Estimator in Training Activation Quantized Neural Netscited by 225
  3. 2020Solving Mixed Integer Programs Using Neural Networkscited by 178
  4. 2019Predicting AC Optimal Power Flows: Combining Deep Learning and Lagrangian Dual Methodscited by 93
  5. 2019Learning to Solve Large-Scale Security-Constrained Unit Commitment Problemscited by 38

Built on by

Not cited yet.