Robust sample average approximation
From MaRDI portal
Abstract: Sample average approximation (SAA) is a widely popular approach to data-driven decision-making under uncertainty. Under mild assumptions, SAA is both tractable and enjoys strong asymptotic performance guarantees. Similar guarantees, however, do not typically hold in finite samples. In this paper, we propose a modification of SAA, which we term Robust SAA, which retains SAA's tractability and asymptotic properties and, additionally, enjoys strong finite-sample performance guarantees. The key to our method is linking SAA, distributionally robust optimization, and hypothesis testing of goodness-of-fit. Beyond Robust SAA, this connection provides a unified perspective enabling us to characterize the finite sample and asymptotic guarantees of various other data-driven procedures that are based upon distributionally robust optimization. This analysis provides insight into the practical performance of these various methods in real applications. We present examples from inventory management and portfolio allocation, and demonstrate numerically that our approach outperforms other data-driven approaches in these applications.
Recommendations
- Robust Stochastic Approximation Approach to Stochastic Programming
- Data-driven robust optimization
- Sample average approximation with heavier tails. I: Non-asymptotic bounds with weak assumptions and stochastic constraints
- Technical note -- Data-driven newsvendor problem: performance of the sample average approximation
- Sample average approximation method for chance constrained programming: Theory and applications
Cites work
- scientific article; zbMATH DE number 995813 (Why is no real title available?)
- scientific article; zbMATH DE number 1818892 (Why is no real title available?)
- scientific article; zbMATH DE number 3962966 (Why is no real title available?)
- scientific article; zbMATH DE number 1332320 (Why is no real title available?)
- scientific article; zbMATH DE number 1354815 (Why is no real title available?)
- scientific article; zbMATH DE number 605729 (Why is no real title available?)
- scientific article; zbMATH DE number 708500 (Why is no real title available?)
- scientific article; zbMATH DE number 2107836 (Why is no real title available?)
- scientific article; zbMATH DE number 2121076 (Why is no real title available?)
- scientific article; zbMATH DE number 3257962 (Why is no real title available?)
- scientific article; zbMATH DE number 3314852 (Why is no real title available?)
- scientific article; zbMATH DE number 3335523 (Why is no real title available?)
- scientific article; zbMATH DE number 3383043 (Why is no real title available?)
- A generalized approach to portfolio optimization: improving performance by constraining portfolio norms
- An introduction to support vector machines and other kernel-based learning methods.
- Applications of second-order cone programming
- Comparing distributions
- Conditional value-at-risk in portfolio optimization: coherent but fragile
- Data-driven robust optimization
- Designing approximation schemes for stochastic optimization problems, in particular for stochastic programs with recourse
- Distributionally Robust Convex Optimization
- Distributionally robust optimization under moment uncertainty with application to data-driven problems
- Epi‐consistency of convex stochastic programs
- Geometric algorithms and combinatorial optimization.
- Introduction to stochastic programming.
- Lectures on modern convex optimization. Analysis, algorithms, and engineering applications
- Likelihood robust optimization for data-driven problems
- Models for minimax stochastic linear optimization problems with risk aversion
- Monte Carlo bounding techniques for determinig solution quality in stochastic programs
- Multivariate Convex Orderings, Dependence, and Stochastic Equality
- Note on the Kolmogorov statistic in the discrete case
- On Choosing and Bounding Probability Metrics
- On a data-driven method for staffing large call centers
- On distributionally robust chance-constrained linear programs
- On duality theory of conic linear problems.
- On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming
- Optimal Inequalities in Probability Theory: A Convex Optimization Approach
- Real Analysis and Probability
- Ridge Regression: Biased Estimation for Nonorthogonal Problems
- Robust Mean-Covariance Solutions for Stochastic Optimization
- The Oxford dictionary of statistical terms.
- The data-driven newsvendor problem: new bounds and insights
- The elements of statistical learning. Data mining, inference, and prediction
- The minimax approach to stochastic programming and an illustrative application
- The sample average approximation method for stochastic discrete optimization
Cited in
(55)- On the heavy-tail behavior of the distributionally robust newsvendor
- The empirical likelihood approach to quantifying uncertainty in sample average approximation
- An online reinforcement learning approach to charging and order-dispatching optimization for an e-hailing electric vehicle fleet
- Distributionally robust optimization for engineering design under uncertainty
- A study of distributionally robust mixed-integer programming with Wasserstein metric: on the value of incomplete data
- Recovering best statistical guarantees via the empirical divergence-based distributionally robust optimization
- A Pareto dominance principle for data-driven optimization
- Risk-averse two-stage stochastic program with distributional ambiguity
- Residuals-based distributionally robust optimization with covariate information
- Integrated strategic energy mix and energy generation planning with multiple sustainability criteria and hierarchical stakeholders
- Calibration of distributionally robust empirical optimization models
- When can we improve on sample average approximation for stochastic optimization?
- Liner ship bunkering and sailing speed planning with uncertain demand
- Regularized methods for a two-stage robust production planning problem and its sample average approximation
- Regularized sample average approximation for high-dimensional stochastic optimization under low-rankness
- An accelerated stochastic extragradient-like algorithm with new stepsize rules for stochastic variational inequalities
- Technical note -- Data-driven newsvendor problem: performance of the sample average approximation
- Conic programming reformulations of two-stage distributionally robust linear programs over Wasserstein balls
- Bootstrap robust prescriptive analytics
- Distributionally robust stochastic programs with side information based on trimmings
- Kernel density estimation based distributionally robust mean-CVaR portfolio optimization
- Debiasing in-sample policy performance for small-data, large-scale optimization
- Distributionally Robust Stochastic Dual Dynamic Programming
- Risk and complexity in scenario optimization
- Robust recycling facility location with clustering
- Sample complexity of sample average approximation for conditional stochastic optimization
- Stochastic Optimization with Decision-Dependent Distributions
- Data-driven robust mean-CVaR portfolio selection under distribution ambiguity
- Sample average approximation with heavier tails. I: Non-asymptotic bounds with weak assumptions and stochastic constraints
- Data-driven stochastic optimization for distributional ambiguity with integrated confidence region
- Diametrical risk minimization: theory and computations
- Bias reduction in sample-based optimization
- Distributionally Robust Two-Stage Stochastic Programming
- Robust Markov Decision Processes with Data-Driven, Distance-Based Ambiguity Sets
- Robust Actuarial Risk Analysis
- Robust analysis in stochastic simulation: computation and performance guarantees
- KDE distributionally robust portfolio optimization with higher moment coherent risk
- Distributionally robust optimization. A review on theory and applications
- Rejoinder: New Objectives for Policy Learning
- A modified exchange algorithm for distributional robust optimization and applications in risk management
- On Monte-Carlo methods in convex stochastic optimization
- Computationally Efficient Approximations for Distributionally Robust Optimization Under Moment and Wasserstein Ambiguity
- Distributionally robust optimization with correlated data from vector autoregressive processes
- A study of data-driven distributionally robust optimization with incomplete joint data under finite support
- Multi-stage distributionally robust convex stochastic optimization with Bayesian-type ambiguity sets
- Optimization-based calibration of simulation input models
- Controlling risk and demand ambiguity in newsvendor models
- A stochastic projection and contraction algorithm with inertial effects for stochastic variational inequalities
- Out-of-sample utility bounds for empirically optimal portfolios in a single-period investment problem
- Frameworks and results in distributionally robust optimization
- Data perturbations in stochastic generalized equations: statistical robustness in static and sample average approximated models
- Partition-based distributionally robust optimization via optimal transport with order cone constraints
- Distributionally Robust Inventory Control When Demand Is a Martingale
- On a conservative partition refinement (CPR) method for a class of two-stage stochastic programming problems
- A stochastic Nesterov's smoothing accelerated method for general nonsmooth constrained stochastic composite convex optimization
This page was built for publication: Robust sample average approximation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1785199)
