Online data assimilation in distributionally robust optimization
Authors:
- 1 December 2018
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1961-1966
Abstract
This paper considers a class of real-time decision making problems to minimize the expected value of a function that depends on a random variable ξ under an unknown distribution P. In this process, samples of ξ are collected sequentially in real time, and the decisions are made, using the real-time data, to guarantee out-of-sample performance. We approach this problem in a distributionally robust optimization framework and propose a novel Online Data Assimilation Algorithm for this purpose. This algorithm guarantees the out-of-sample performance in high probability, and gradually improves the quality of the data-driven decisions by incorporating the streaming data. We show that the Online Data Assimilation Algorithm guarantees convergence under the streaming data, and a criteria for termination of the algorithm after certain number of data has been collected.Keywords
All Related Versions
This publication has 6 references indexed in Scilit:
- Data-driven distributed optimization using Wasserstein ambiguity sets2017
- On the rate of convergence in Wasserstein distance of the empirical measureProbability Theory and Related Fields, 2014
- Lectures on Stochastic Programming: Modeling and Theory, Second Edition2014
- Robust Optimization2009
- Convex Optimization2004
- An extension of the frank and Wolfe method of feasible directionsMathematical Programming, 1974