Online Program Home
My Program

Abstract Details

Activity Number: 98
Type: Invited
Date/Time: Monday, August 1, 2016 : 8:30 AM to 10:20 AM
Sponsor: Section on Physical and Engineering Sciences
Abstract #317983
Title: On the Convergence Rates of Expected Improvement Methods
Author(s): llya O. Ryzhov*
Companies: University of Maryland
Keywords: design of experiments ; ranking and selection ; simulation optimization ; optimal learning ; expected improvement ; optimal computing budget allocation
Abstract:

We consider a ranking and selection problem with independent normal observations, and analyze the asymptotic sampling rates of expected improvement (EI) methods in this setting. Such methods often perform well in practice, but a tractable analysis of their convergence rates is difficult due to the nonlinearity and nonconvexity of the functions used in the EI calculations. We present new results indicating that variants of EI produce simulation allocations that are essentially identical (for both known and unknown sampling variance) to those chosen by the optimal computing budget allocation (OCBA) methodology, which is known to yield near-optimal asymptotic performance in R&S. This is the first general equivalence result between EI and OCBA, and provides insight into the good practical performance of EI.


Authors who are presenting talks have a * after their name.

Back to the full JSM 2016 program

 
 
Copyright © American Statistical Association