Distributionally Robust Optimal Power Flow with Contextual Information

• URL: http://arxiv.org/abs/2109.07896v1
• Date: Thu, 16 Sep 2021 11:54:12 GMT
• Title: Distributionally Robust Optimal Power Flow with Contextual Information
• Abstract summary: We develop a distributionally robust chance-constrained formulation of the Optimal Power Flow problem (OPF) We exploit an ambiguity set based on probability trimmings and optimal transport through which the dispatch solution is protected. We show how the power system can substantially benefit from taking into account the well-known statistical dependence between the point forecast of wind power outputs and its associated prediction error.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: In this paper, we develop a distributionally robust chance-constrained formulation of the Optimal Power Flow problem (OPF) whereby the system operator can leverage contextual information. For this purpose, we exploit an ambiguity set based on probability trimmings and optimal transport through which the dispatch solution is protected against the incomplete knowledge of the relationship between the OPF uncertainties and the context that is conveyed by a sample of their joint probability distribution. We provide an exact reformulation of the proposed distributionally robust chance-constrained OPF problem under the popular conditional-value-at-risk approximation. By way of numerical experiments run on a modified IEEE-118 bus network with wind uncertainty, we show how the power system can substantially benefit from taking into account the well-known statistical dependence between the point forecast of wind power outputs and its associated prediction error. Furthermore, the experiments conducted also reveal that the distributional robustness conferred on the OPF solution by our probability-trimmings-based approach is superior to that bestowed by alternative approaches in terms of expected cost and system reliability.

Related papers

• EMFusion: Conditional Diffusion Framework for Trustworthy Frequency Selective EMF Forecasting in Wireless Networks [16.779358331828327]
  This paper introduces EMFusion, a conditional multivariate diffusion-based probabilistic forecasting framework.<n>It integrates diverse contextual factors (e.g., time of day, season, and holidays) while providing explicit uncertainty estimates.<n> Numerical experiments conducted on frequency-selective EMF datasets demonstrate that EMFusion with the contextual information of working hours outperforms the baseline models.
  arXiv  Detail & Related papers  (2025-12-17T04:12:52Z)
• Distribution-Free Stochastic MPC for Joint-in-Time Chance-Constrained Linear Systems [6.170271503640481]
  This work presents a model predictive control (MPC) framework for linear systems subject to joint-in-time chance constraints under unknown disturbance distributions.<n>Unlike existing MPC formulations that rely on parametric or Gaussian assumptions, the proposed method leverages conformal prediction (CP) as a streamlined tool to construct finite-sample confidence regions for the system's error trajectories with minimal computational effort.
  arXiv  Detail & Related papers  (2025-12-11T15:25:02Z)
• Bridging the Gap Between Bayesian Deep Learning and Ensemble Weather Forecasts [100.26854618129039]
  Weather forecasting is fundamentally challenged by the chaotic nature of the atmosphere.<n>Recent advances in Bayesian Deep Learning (BDL) offer a promising but often disconnected alternative.<n>We bridge these paradigms through a unified hybrid BDL framework for ensemble weather forecasting.
  arXiv  Detail & Related papers  (2025-11-18T07:49:52Z)
• Conformal Prediction for Multi-Source Detection on a Network [59.17729745907474]
  We study the multi-source detection problem.<n>Given snapshot observations of node infection status on a graph, estimate the set of source nodes that initiated the propagation.<n>We propose a novel conformal prediction framework that provides statistically valid recall guarantees for source set detection.
  arXiv  Detail & Related papers  (2025-11-12T01:09:56Z)
• COIN: Uncertainty-Guarding Selective Question Answering for Foundation Models with Provable Risk Guarantees [51.5976496056012]
  COIN is an uncertainty-guarding selection framework that calibrates statistically valid thresholds to filter a single generated answer per question.<n>COIN estimates the empirical error rate on a calibration set and applies confidence interval methods to establish a high-probability upper bound on the true error rate.<n>We demonstrate COIN's robustness in risk control, strong test-time power in retaining admissible answers, and predictive efficiency under limited calibration data.
  arXiv  Detail & Related papers  (2025-06-25T07:04:49Z)
• Uncertainty Propagation in the Fast Fourier Transform [6.390468088226495]
  We propose an efficient framework for approximate Bayesian inference using belief propagation and expectation propagation. Our method achieves stable convergence with accurate mean and variance estimates.
  arXiv  Detail & Related papers  (2025-04-14T11:47:42Z)
• Confidence Aware Learning for Reliable Face Anti-spoofing [52.23271636362843]
  We propose a Confidence Aware Face Anti-spoofing model, which is aware of its capability boundary. We estimate its confidence during the prediction of each sample. Experiments show that the proposed CA-FAS can effectively recognize samples with low prediction confidence.
  arXiv  Detail & Related papers  (2024-11-02T14:29:02Z)
• Probabilistic Conformal Prediction with Approximate Conditional Validity [81.30551968980143]
  We develop a new method for generating prediction sets that combines the flexibility of conformal methods with an estimate of the conditional distribution. Our method consistently outperforms existing approaches in terms of conditional coverage.
  arXiv  Detail & Related papers  (2024-07-01T20:44:48Z)
• Probabilistically Plausible Counterfactual Explanations with Normalizing Flows [2.675793767640172]
  We present PPCEF, a novel method for generating probabilistically plausible counterfactual explanations. Our method enforces plausibility by directly optimizing the explicit density function without assuming a particular family of parametrized distributions. PPCEF is a powerful tool for interpreting machine learning models and for improving fairness, accountability, and trust in AI systems.
  arXiv  Detail & Related papers  (2024-05-27T20:24:03Z)
• Uncertainty Quantification via Stable Distribution Propagation [60.065272548502]
  We propose a new approach for propagating stable probability distributions through neural networks. Our method is based on local linearization, which we show to be an optimal approximation in terms of total variation distance for the ReLU non-linearity.
  arXiv  Detail & Related papers  (2024-02-13T09:40:19Z)
• Reliable Federated Disentangling Network for Non-IID Domain Feature [62.73267904147804]
  In this paper, we propose a novel reliable federated disentangling network, termed RFedDis. To the best of our knowledge, our proposed RFedDis is the first work to develop an FL approach based on evidential uncertainty combined with feature disentangling. Our proposed RFedDis provides outstanding performance with a high degree of reliability as compared to other state-of-the-art FL approaches.
  arXiv  Detail & Related papers  (2023-01-30T11:46:34Z)
• 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)
• Data-Driven Approximations of Chance Constrained Programs in Nonstationary Environments [3.126118485851773]
  We study sample average approximations (SAA) of chance constrained programs. We consider a nonstationary variant of this problem, where the random samples are assumed to be independently drawn in a sequential fashion. We propose a novel robust SAA method exploiting information about the Wasserstein distance between the sequence of data-generating distributions and the actual chance constraint distribution.
  arXiv  Detail & Related papers  (2022-05-08T01:01:57Z)
• Probabilistic electric load forecasting through Bayesian Mixture Density Networks [70.50488907591463]
  Probabilistic load forecasting (PLF) is a key component in the extended tool-chain required for efficient management of smart energy grids. We propose a novel PLF approach, framed on Bayesian Mixture Density Networks. To achieve reliable and computationally scalable estimators of the posterior distributions, both Mean Field variational inference and deep ensembles are integrated.
  arXiv  Detail & Related papers  (2020-12-23T16:21:34Z)
• Distributionally Robust Chance Constrained Programming with Generative Adversarial Networks (GANs) [0.0]
  A novel generative adversarial network (GAN) based data-driven distributionally robust chance constrained programming framework is proposed. GAN is applied to fully extract distributional information from historical data in a nonparametric and unsupervised way. The proposed framework is then applied to supply chain optimization under demand uncertainty.
  arXiv  Detail & Related papers  (2020-02-28T00:05:22Z)

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.