arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2511.06248cs.LGcs.AI
收藏

面向端到端ACOPF优化代理的约束知情主动学习

Constraint-Informed Active Learning for End-to-End ACOPF Optimization Proxies

University of Texas at Austin, TX, USA(德克萨斯大学奥斯汀分校)

Miao Li, Michael Klamkin, Pascal Van Hentenryck, Wenting Li, Russell Bent

AI总结:

本文提出一种约束知情的主动采样框架,通过主动约束集生成真实多样的训练数据,在同等预算下显著提升端到端ACOPF优化代理的泛化性能。

摘要:

本文研究优化代理,即经过训练以高效预测交流最优潮流(ACOPF)问题最优解的机器学习(ML)模型。尽管前景广阔,优化代理的性能在很大程度上依赖于训练数据质量。为解决这一局限,本文提出一种新颖的面向ACOPF优化代理的主动采样框架,旨在生成真实且多样的训练数据。该框架主动探索反映合理运行现实的多样化、灵活的问题规格。更重要的是,该方法利用优化特有的量(主动约束集),更好地捕捉导致最优解的ACOPF显著特征。数值结果表明,在同等训练预算下,其泛化能力优于现有采样方法,显著推进了可信ACOPF优化代理的实践水平。

英文摘要:

This paper studies optimization proxies, machine learning (ML) models trained to efficiently predict optimal solutions for AC Optimal Power Flow (ACOPF) problems. While promising, optimization proxy performance heavily depends on training data quality. To address this limitation, this paper introduces a novel active sampling framework for ACOPF optimization proxies designed to generate realistic and diverse training data. The framework actively explores varied, flexible problem specifications reflecting plausible operational realities. More importantly, the approach uses optimization-specific quantities (active constraint sets) that better capture the salient features of an ACOPF that lead to the optimal solution. Numerical results show superior generalization over existing sampling methods with an equivalent training budget, significantly advancing the state-of-practice for trustworthy ACOPF optimization proxies.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑