FMOPF: Latent Flow Matching with Constraint-Aware Interaction Priors for AC Optimal Power Flow

• URL: http://arxiv.org/abs/2607.22788v1
• Date: Fri, 24 Jul 2026 12:49:09 GMT
• Title: FMOPF: Latent Flow Matching with Constraint-Aware Interaction Priors for AC Optimal Power Flow
• Abstract summary: AC optimal power flow determines the minimum-cost generation dispatch under nonlinear power balance constraints.<n>This paper presents FMOPF, a framework that resolves the conflation of two tasks within a single model.<n>Experiments on four IEEE test systems demonstrate that FMOPF provides the most effective Newton-Raphson warm starts.
• Score: 4.037525873726113
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: AC optimal power flow determines the minimum-cost generation dispatch under nonlinear power balance constraints and is solved thousands of times daily in electricity market operations. Learning a direct mapping from load conditions to OPF solutions can accelerate this computation, yet with deepening renewable penetration, a single optimal dispatch is no longer sufficient. Operators require a characterization of the distribution of feasible near-optimal solutions for risk quantification, sensitivity analysis, and multi-objective trade-off assessment. Supervised neural networks provide fast point predictions but cannot capture this conditional distribution. Diffusion-based generative models can sample diverse solutions in principle, yet existing methods operating in the raw state space exhibit degraded solution quality and fail to scale beyond medium-sized systems. We identify the root cause as the conflation of two distinct tasks within a single model. Compressing the high-dimensional OPF solution manifold is one task, and learning the conditional mapping from loads to that manifold is another. This paper presents FMOPF, a framework that resolves this conflation by decoupling compression from generation through latent flow matching and by explicitly modeling load-state coupling through a Constraint-Aware Interaction Prior Network. Experiments on four IEEE test systems demonstrate that FMOPF provides the most effective Newton-Raphson warm starts, achieves the lowest tail risk among generative methods, and is the first such method to scale to systems with several hundred buses while preserving full feasibility. Ablation studies confirm that the latent generation pipeline is a necessary condition for physical feasibility and that the interaction prior functions as a late-stage tail-risk controller.

Related papers

• Generative Nested Sampling of Atomistic Thermodynamic Landscapes [37.547720439639015]
  Flow-based nested sampling has removed the bottleneck for gravitational-wave (GW) inference.<n>We show that LJ disks in PBC reduce energy evaluations by over two orders of magnitude and wall-clock time by roughly one third.<n>For LJ disks in PBC, the algorithm reduces energy evaluations by over two orders of magnitude and wall-clock time by roughly one third.
  arXiv  Detail & Related papers  (2026-09-02T22:21:10Z)
• Multi-Fidelity Flow Matching: Cascaded Refinement of PDE Solutions [6.144605787421899]
  Multi-Fidelity Flow Matching is a cascade refinement framework for PDE solutions.<n>We exploit this in Multi-Fidelity Flow Matching (MFFM), a cascade refinement framework for PDE solutions.<n>MFFM is a learned analog of multigrid refinement that reaches the finest grid in $L$ deterministic network evaluations per query.
  arXiv  Detail & Related papers  (2026-05-15T16:02:18Z)
• InjectFlow: Weak Guides Strong via Orthogonal Injection for Flow Matching [1.974921946982281]
  Flow Matching (FM) has emerged as a leading approach for high-fidelity visual generation.<n>FM models are sensitive to dataset biases, which cause severe semantic degradation when generating out-of-distribution or minority-class samples.<n>We introduce InjectFlow, a novel, training-free method by injecting semantics during the initial velocity field.
  arXiv  Detail & Related papers  (2026-03-19T11:07:14Z)
• FALCON: Few-step Accurate Likelihoods for Continuous Flows [78.37361800856583]
  We propose Few-step Accurate Likelihoods for Continuous Flows (FALCON), which allows for few-step sampling with a likelihood accurate enough for importance sampling applications.<n>We show FALCON outperforms state-of-the-art normalizing flow models for molecular Boltzmann sampling and is two orders of magnitude faster than the equivalently performing CNF model.
  arXiv  Detail & Related papers  (2025-12-10T18:47:25Z)
• Joint Distillation for Fast Likelihood Evaluation and Sampling in Flow-based Models [100.28111930893188]
  Some of today's best generative models still require hundreds to thousands of neural function evaluations to compute a single likelihood.<n>We present fast flow joint distillation (F2D2), a framework that simultaneously reduces the number of NFEs required for both sampling and likelihood evaluation by two orders of magnitude.<n>F2D2 is modular, compatible with existing flow-based few-step sampling models, and requires only an additional divergence prediction head.
  arXiv  Detail & Related papers  (2025-12-02T10:48:20Z)
• Generative Modeling with Continuous Flows: Sample Complexity of Flow Matching [60.37045080890305]
  We provide the first analysis of the sample complexity for flow-matching based generative models.<n>We decompose the velocity field estimation error into neural-network approximation error, statistical error due to the finite sample size, and optimization error due to the finite number of optimization steps for estimating the velocity field.
  arXiv  Detail & Related papers  (2025-12-01T05:14:25Z)
• Optimal Control Meets Flow Matching: A Principled Route to Multi-Subject Fidelity [35.95129874095729]
  Text-to-image (T2I) models excel on single-entity prompts but struggle with multi-subject descriptions.<n>We introduce the first theoretical framework with principled optimizable objective for steering sampling dynamics toward multi-subject fidelity.
  arXiv  Detail & Related papers  (2025-10-02T17:59:58Z)
• DiffusionNFT: Online Diffusion Reinforcement with Forward Process [99.94852379720153]
  Diffusion Negative-aware FineTuning (DiffusionNFT) is a new online RL paradigm that optimize diffusion models directly on the forward process via flow matching.<n>DiffusionNFT is up to $25times$ more efficient than FlowGRPO in head-to-head comparisons, while being CFG-free.
  arXiv  Detail & Related papers  (2025-09-19T16:09:33Z)
• Optimal Transceiver Design in Over-the-Air Federated Distillation [34.09979141255862]
  We study the transceiver design in terms of the learning convergence rate and the power constraints.<n>We propose a novel approach to find the optimal receiver beam vector for over-the-air aggregation.<n>Results show that the proposed over-the-air approach achieves a significant reduction in communication with only a minor compromise in testing accuracy.
  arXiv  Detail & Related papers  (2025-07-21T05:37:08Z)
• Improving and generalizing flow-based generative models with minibatch optimal transport [90.01613198337833]
  We introduce the generalized conditional flow matching (CFM) technique for continuous normalizing flows (CNFs) CFM features a stable regression objective like that used to train the flow in diffusion models but enjoys the efficient inference of deterministic flow models. A variant of our objective is optimal transport CFM (OT-CFM), which creates simpler flows that are more stable to train and lead to faster inference.
  arXiv  Detail & Related papers  (2023-02-01T14:47:17Z)
• Data-Driven Stochastic AC-OPF using Gaussian Processes [54.94701604030199]
  Integrating a significant amount of renewables into a power grid is probably the most a way to reduce carbon emissions from power grids slow down climate change. This paper presents an alternative data-driven approach based on the AC power flow equations that can incorporate uncertainty inputs. The GP approach learns a simple yet non-constrained data-driven approach to close this gap to the AC power flow equations.
  arXiv  Detail & Related papers  (2022-07-21T23:02:35Z)
• Combining Deep Learning and Optimization for Security-Constrained Optimal Power Flow [94.24763814458686]
  Security-constrained optimal power flow (SCOPF) is fundamental in power systems. Modeling of APR within the SCOPF problem results in complex large-scale mixed-integer programs. This paper proposes a novel approach that combines deep learning and robust optimization techniques.
  arXiv  Detail & Related papers  (2020-07-14T12:38:21Z)
• DeepOPF: A Feasibility-Optimized Deep Neural Network Approach for AC Optimal Power Flow Problems [25.791128241015684]
  We develop a Deep Neural Network (DNN) approach, called DeepOPF, for solving AC-OPF problems in a fraction of the time used by conventional solvers. We show that DeepOPF speeds up the computing time by up to two orders of magnitude as compared to a state-of-the-art solver.
  arXiv  Detail & Related papers  (2020-07-02T10:26:46Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.