A Knowledge-Gradient Policy for Sequential Information Collection

From MaRDI portal
Publication:3399249

DOI10.1137/070693424zbMath1274.62155OpenAlexW2072302356MaRDI QIDQ3399249

Warren B. Powell, Peter I. Frazier, Savas Dayanik

Publication date: 29 September 2009

Published in: SIAM Journal on Control and Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/070693424



Related Items

On parallel policies for ranking and selection problems, Tracking global optima in dynamic environments with efficient global optimization, Top-\(\kappa\) selection with pairwise comparisons, Solving Large-Scale Fixed-Budget Ranking and Selection Problems, Dynamic Sampling Allocation and Design Selection, Optimal Learning for Nonlinear Parametric Belief Models Over Multidimensional Continuous Spaces, Perspectives of approximate dynamic programming, Bayesian Optimization with Expensive Integrands, A Fully Sequential Elimination Procedure for Indifference-Zone Ranking and Selection with Tight Bounds on Probability of Correct Selection, Ranking and Selection with Covariates for Personalized Decision Making, Dynamic Sampling Allocation Under Finite Simulation Budget for Feasibility Determination, Practical Nonparametric Sampling Strategies for Quantile-Based Ordinal Optimization, Dynamic Programming for Response-Adaptive Dose-Finding Clinical Trials, Optimal Learning in Experimental Design Using the Knowledge Gradient Policy with Application to Characterizing Nanoemulsion Stability, Optimal Learning for Stochastic Optimization with Nonlinear Parametric Belief Models, Technical note—Knowledge gradient for selection with covariates: Consistency and computation, Ranking and selection for pairwise comparison, Sequential selection for accelerated life testing via approximate Bayesian inference, Information theory for ranking and selection, Multi-fidelity Bayesian optimization to solve the inverse Stefan problem, Asymptotic optimality of myopic ranking and selection procedures, Convergence rate analysis for optimal computing budget allocation algorithms, On the Convergence Rates of Expected Improvement Methods, ON THE IDENTIFICATION AND MITIGATION OF WEAKNESSES IN THE KNOWLEDGE GRADIENT POLICY FOR MULTI-ARMED BANDITS, Optimal Learning in Linear Regression with Combinatorial Feature Selection, Scalable Bayesian optimization with randomized prior networks, Adaptive Simulation Selection for the Discovery of the Ground State Line of Binary Alloys with a Limited Computational Budget, Multi-fidelity cost-aware Bayesian optimization, Finite-Time Analysis for the Knowledge-Gradient Policy, Tractable Sampling Strategies for Ordinal Optimization, A unified framework for stochastic optimization, A Knowledge Gradient Policy for Sequencing Experiments to Identify the Structure of RNA Molecules Using a Sparse Additive Belief Model, Optimal Online Learning for Nonlinear Belief Models Using Discrete Priors, Simple Bayesian Algorithms for Best-Arm Identification, Bayesian sequential data collection for stochastic simulation calibration, Optimal Learning with Local Nonlinear Parametric Models over Continuous Designs, Surrogate-based sequential Bayesian experimental design using non-stationary Gaussian processes, Learning Enabled Constrained Black-Box Optimization, Unnamed Item, Sequential design of computer experiments for the estimation of a probability of failure, Navigating the protein fitness landscape with Gaussian processes, Bayesian Optimization via Simulation with Pairwise Sampling and Correlated Prior Beliefs, Bayesian model calibration and optimization of surfactant-polymer flooding, Expected improvement for expensive optimization: a review, Refined knowledge-gradient policy for learning probabilities, Pareto set estimation with guaranteed probability of correct selection, Hyperparameter optimization for recommender systems through Bayesian optimization, Optimal learning with non-Gaussian rewards, Optimal learning for sequential sampling with non-parametric beliefs, Optimal learning with a local parametric belief model, Learning to Optimize via Information-Directed Sampling, The Local Time Method for Targeting and Selection, Evaluating Gaussian process metamodels and sequential designs for noisy level set estimation, Multifidelity Monte Carlo Estimation with Adaptive Low-Fidelity Models, A supermartingale approach to Gaussian process based sequential design of experiments, Efficient Sampling Allocation Procedures for Optimal Quantile Selection, Selecting the Best Alternative Based on Its Quantile, Nested-Batch-Mode Learning and Stochastic Optimization with An Application to Sequential MultiStage Testing in Materials Science, Optimal budget allocation policy for tabu search in stochastic simulation optimization, Simulation Optimization: A Review and Exploration in the New Era of Cloud Computing and Big Data, Knockout-Tournament Procedures for Large-Scale Ranking and Selection in Parallel Computing Environments