Metraipolis › archive › dc_ab2cddc2b9cb
Learning to Fix: Optimisation-Aware Machine Learning for Accelerated Unit Commitment — arXiv:2609.39396
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2609.39396
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-07T16:05:16.955Z
- SHA-256 of the archived text
ee06115a802e3e7c3dc3ba7318feba24218306695b4359832fca526b20fab8c0- Stable URL of this page
https://metraipolis.com/documento/dc_ab2cddc2b9cb
How to cite
Learning to Fix: Optimisation-Aware Machine Learning for Accelerated Unit Commitment — arXiv:2609.39396 — arXiv (en), https://arxiv.org/abs/2609.39396 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_ab2cddc2b9cb (Metraipolis archive dc_ab2cddc2b9cb, sha256 ee06115a802e3e7c3dc3ba7318feba24218306695b4359832fca526b20fab8c0)
BibTeX
@misc{dcab2cddc2b9cb,
title = {Learning to Fix: Optimisation-Aware Machine Learning for Accelerated Unit Commitment — arXiv:2609.39396},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2609.39396},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_ab2cddc2b9cb; sha256 ee06115a802e3e7c3dc3ba7318feba24218306695b4359832fca526b20fab8c0},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.39396. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
Unit Commitment is a computationally demanding mixed-integer linear optimisation problem requiring many binary commitment decisions across a scheduling horizon. To reduce this computational burden, machine learning approaches can predict a subset of these decisions, thereby shrinking the search space explored by the optimisation solver. Existing confidence-based approaches determine which variables to fix based on user-defined probability thresholds, which are agnostic to the downstream optimisation problem. We address this limitation by introducing an optimisation-aware framework that yields generator-specific confidence thresholds based on the impact of fixing errors on Unit Commitment solution quality. This approach won first place in the 2025 EPRI AI-ccelerating Unit Commitment competition. The proposed framework achieves a mean optimality gap below 0.5% while also delivering an average speed-up of more than 20x. It therefore provides a general mechanism for translating probabilistic predictions into controlled reductions of mixed-integer search spaces, directly linking learning decisions to their downstream computational and economic consequences. Tema degli esploratori: calcolo e infrastrutture (retro-catalogo arXiv: annunci del 2026-10-01 in eess.SY). Categorie arXiv: Systems and Control (eess.SY). Pagina del lavoro: https://arxiv.org/abs/2609.39396 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito). Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina. Letto il 2026-10-07T15:38:32.025Z dalla pagina https://arxiv.org/catchup/eess.SY/2026-10-01?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).