Learning to Solve Two-Stage Stochastic Unit Commitment Problems with Quality Guarantees

arXiv:2609.18859 · eess.SY, cs.SY, math.OC · Submitted 2026-09-16 · Read on arXiv

eess.SY, cs.SY, math.OC

Submitted: 2026-09-16

Updated: 2026-09-16

Comments: 11 pages, 2 figures, 3 tables, 1 algorithm. Submitted to IEEE Transactions on Power Systems

License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/

Terminology

Unit Commitment — 15× in this paper
Benchmark — 14× in this paper · explained in 2 episodes
Accuracy — 8× in this paper · explained in 1 episode
Stochastic Unit Commitment — 6× in this paper
Input Convex Neural Network — 5× in this paper
Aggregation — 4× in this paper · explained in 1 episode
Embeddings — 4× in this paper · explained in 2 episodes
Extensive Form — 2× in this paper
Adam — 1× in this paper · explained in 2 episodes
Computational overhead — 1× in this paper · explained in 2 episodes
Consistency — 1× in this paper · explained in 3 episodes
Core — 1× in this paper · explained in 2 episodes
Deep Reinforcement Learning — 1× in this paper · explained in 2 episodes
Direct Current — 1× in this paper
Failure Modes — 1× in this paper · explained in 3 episodes
Hamming Distance — 1× in this paper · explained in 2 episodes
Iterative Refinement — 1× in this paper · explained in 3 episodes
Linear Programming — 1× in this paper
Loss Function — 1× in this paper · explained in 2 episodes
Physical Constraints — 1× in this paper · explained in 7 episodes
Reinforcement Learning — 1× in this paper · explained in 4 episodes
Under the Sample Average Approximation — 1× in this paper

Sources

Neural Two-Stage Stochastic Optimization for Solving Unit Commitment Problem

Related papers