Published on Wed Mar 27 2019

A Posteriori Probabilistic Bounds of Convex Scenario Programs with Validation Tests

Chao Shang, Fengqi You

Scenario programs have established themselves as efficient tools towardsdecision-making under uncertainty. To reach a theoretically reliable judgement of risk, one typically needs to collect massive validation samples. We propose new a posteriori bounds for convex scenario programs with validation tests.

0
0
0
Abstract

Scenario programs have established themselves as efficient tools towards decision-making under uncertainty. To assess the quality of scenario-based solutions a posteriori, validation tests based on Bernoulli trials have been widely adopted in practice. However, to reach a theoretically reliable judgement of risk, one typically needs to collect massive validation samples. In this work, we propose new a posteriori bounds for convex scenario programs with validation tests, which are dependent on both realizations of support constraints and performance on out-of-sample validation data. The proposed bounds enjoy wide generality in that many existing theoretical results can be incorporated as particular cases. To facilitate practical use, a systematic approach for parameterizing a posteriori probability bounds is also developed, which is shown to possess a variety of desirable properties allowing for easy implementations and clear interpretations. By synthesizing comprehensive information about support constraints and validation tests, improved risk evaluation can be achieved for randomized solutions in comparison with existing a posteriori bounds. Case studies on controller design of aircraft lateral motion are presented to validate the effectiveness of the proposed a posteriori bounds.

Tue Jun 04 2019
Machine Learning
Scenario approach for minmax optimization with emphasis on the nonconvex case: positive results and caveats
The scenario approach is well-studied in the important case of convex robust optimization problems. We examine how the phenomenon of concentration of measures affects the i.i.d sampling aspect of the scenario approach in high dimensions. We establish a general methodology for extracting estimates for the finite sample behaviour
0
0
0
Thu Jul 08 2021
Machine Learning
Likelihood-Free Frequentist Inference: Bridging Classical Statistics and Machine Learning in Simulation and Uncertainty Quantification
Classicalistical methods are poorly suited for so-called likelihood-free frequentist inference (LFI) settings. New machine learning methods have revolutionized sample efficiency and capacity of LFI methods. Any method that estimates a test statistic, such as the likelihood ratio, can be plugged into this
1
0
0
Wed Dec 12 2018
Machine Learning
Mixed Uncertainty Sets for Robust Combinatorial Optimization
In robust optimization, the uncertainty set is used to model all possible outcomes of uncertain parameters. In this paper, we propose an approach to go beyond the classic setting, by assuming multiple uncertainty sets to be prepared. We show that with regard to out-sample performance, the combination of multiple sets
0
0
0
Mon Jan 06 2020
Machine Learning
Variational Bayesian Methods for Stochastically Constrained System Design Problems
We study system design problems stated as parameterized stochastic programs with a chance-constraint set. We adopt a Bayesian approach that requires the computation of a posterior predictive integral which is usually intractable. For the problem to be a well-defined convex program, we
0
0
0
Tue Mar 09 2021
Machine Learning
A sampling criterion for constrained Bayesian optimization with uncertainties
0
0
0
Mon Dec 19 2011
Machine Learning
Scenario trees and policy selection for multistage stochastic programming using machine learning
We propose a hybrid algorithmic strategy for complex stochastic optimization problems. The strategy combines the use of scenario trees from multistage stochasticallyprogramming with machine learning techniques for learning a policy.
0
0
0