Fast Optimal Power Flow With Guarantees via an Unsupervised Generative Model
Bibliographic record
Abstract
Climate change concerns are driving the widespread integration of renewable generation sources, storage systems, electric vehicles and diverse consumer loads. Inherent variabilities of these power entities introduce uncertainties that affect the economical operations and integrity of the electrical grid. Thus, optimal power flow (OPF) studies must be conducted at high granularity in order to account for these fluctuations. However, due to the non-convex nature of the OPF problem, solving it in real-time still remains an open challenge. In this paper, a novel data-driven approach that combines generative learning, information theory and domain knowledge is proposed to enable real-time OPF studies. In order to train this model, onlyfeasibledatapoints are necessary - not optimal values. Once trained, the time required to compute the solution is extremely fast and falls within the sub-second range. No information pertaining to the topology or power flow equations is required once the model is trained. Theoretical guarantees on optimality and feasibility of the solutions generated by the proposed ML model are established. Comprehensive practical and comparative studies conducted demonstrate the efficacy of the proposed data-driven approach for solving OPF in real-time.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.002 | 0.007 |
| Meta-epidemiology (narrow) | 0.001 | 0.001 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.001 | 0.001 |
| Scholarly communication | 0.001 | 0.002 |
| Open science | 0.002 | 0.002 |
| Research integrity | 0.001 | 0.002 |
| Insufficient payload (model declined to judge) | 0.002 | 0.001 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".