Sample Average Approximation with Adaptive Importance Sampling

Andreas Waechter, Jeremy C Staum, Alvaro Maggiar, Mingbin Feng

Research output: Book/ReportOther report

Abstract

We study sample average approximations under adaptive importance sampling in which the sample densities may depend on previous random samples. Based on a generic uniform law of large numbers, we establish uniform convergence of the sample average approximation to the true function. We obtain convergence of the optimal value and optimal solutions of the sample average approximation. The relevance of this result is demonstrated in the context of the convergence analysis of a randomized optimization algorithm.

Available at optimization-online.org
Original languageEnglish (US)
Number of pages13
StatePublished - 2017

Fingerprint Dive into the research topics of 'Sample Average Approximation with Adaptive Importance Sampling'. Together they form a unique fingerprint.

Cite this