Complete expected improvement converges to an optimal budget allocation

DOI10.1017/APR.2019.9MaRDI QIDQ5203897zbMATH OpenOpenAlexFDO

Authors Ye Chen, Ilya O. Ryzhov

Publication date 9 December 2019

Published in Advances in Applied Probability (Search for Journal in Brave)

Full work available at URL https://www.cambridge.org/core/services/aop-cambridge-core/content/view/5F61B13648DDAED930B5AB0889B5D134/S0001867819000090a.pdf/complete_expected_improvement_converges_to_an_optimal_budget_allocation.pdf

zbMATH Keywords

expected improvementlarge deviations rateoptimal learningranking and selection

Mathematics Subject Classification ID

Bayesian problems; characterization of Bayes procedures (62C10) Statistical ranking and selection procedures (62F07) Applications of statistics to economics (62P20)

Recommendations

• On the convergence rates of expected improvement methods
• Dynamic sampling allocation and design selection
• Sequential sampling to myopically maximize the expected value of information
• Consistency of sequential Bayesian sampling policies
• Convergence rates of efficient global optimization algorithms

Cites work

• A fully sequential procedure for indifference-zone selection in simulation
• A Single-Sample Multiple Decision Procedure for Ranking Means of Normal Populations with known Variances
• Efficient global optimization of expensive black-box functions
• scientific article; zbMATH DE number 3178145 (Why is no real title available?)
• scientific article; zbMATH DE number 3357742 (Why is no real title available?)
• Learning to optimize via posterior sampling
• Multi-armed bandit allocation indices. With a foreword by Peter Whittle.
• Myopic Allocation Policy With Asymptotically Optimal Sampling Rate
• On the convergence rates of expected improvement methods
• Optimal learning in linear regression with combinatorial feature selection
• Selecting a selection procedure
• Sequential sampling to myopically maximize the expected value of information
• Simple Bayesian algorithms for best-arm identification
• Simulation budget allocation for further enhancing the efficiency of ordinal optimization
• Stochastically Constrained Ranking and Selection via SCORE

Cited in

(11)

• Optimal budget allocation policy for tabu search in stochastic simulation optimization
• Optimal computing budget allocation for regression with gradient information
• On the convergence rates of expected improvement methods
• Rapid Discrete Optimization via Simulation with Gaussian Markov Random Fields
• Sequential selection for accelerated life testing via approximate Bayesian inference
• On the finite-sample statistical validity of adaptive fully sequential procedures
• Using cache or credit for parallel ranking and selection
• Contextual ranking and selection with Gaussian processes and optimal computing budget allocation
• Sequential Selection for Minimizing the Variance with Application to Crystallization Experiments
• Ranking and selection with two-stage decision
• Dice and slice simulation optimization for high-dimensional discrete problems

Describes a project that uses

Uses Software

• EGO

This page was built for publication: Complete expected improvement converges to an optimal budget allocation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5203897)