A Knowledge-Gradient Policy for Sequential Information Collection
From MaRDI portal
Publication:3399249
DOI10.1137/070693424zbMATH Open1274.62155OpenAlexW2072302356WikidataQ131617241 ScholiaQ131617241MaRDI QIDQ3399249FDOQ3399249
Authors: Peter I. Frazier, Warren Powell, 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
Recommendations
Bayesian inference (62F15) Statistical ranking and selection procedures (62F07) Sequential statistical design (62L05)
Cited In (77)
- Efficient constitutive parameter identification through optimisation-based techniques: a comparative analysis and novel composite Bayesian optimisation strategy
- Practical Nonparametric Sampling Strategies for Quantile-Based Ordinal Optimization
- Finding the optimal exploration-exploitation trade-off online through Bayesian risk estimation and minimization
- A Hierarchical Expected Improvement Method for Bayesian Optimization
- Taking another step: a simple approach to high-dimensional Bayesian optimization
- Scalable Bayesian optimization with randomized prior networks
- Using cache or credit for parallel ranking and selection
- Technical note—Knowledge gradient for selection with covariates: Consistency and computation
- ON THE IDENTIFICATION AND MITIGATION OF WEAKNESSES IN THE KNOWLEDGE GRADIENT POLICY FOR MULTI-ARMED BANDITS
- Sequential selection for accelerated life testing via approximate Bayesian inference
- Marginal improvement procedures for top-\(m\) selection
- Sequential Model-Based Optimization for Continuous Inputs with Finite Decision Space
- Information theory for ranking and selection
- Multi-fidelity Bayesian optimization to solve the inverse Stefan problem
- Title not available (Why is that?)
- Solving Large-Scale Fixed-Budget Ranking and Selection Problems
- A composite Bayesian optimisation framework for material and structural design
- Optimal learning with local nonlinear parametric models over continuous designs
- On the convergence rates of expected improvement methods
- The knowledge-gradient policy for correlated normal beliefs
- Bayesian optimization via simulation with pairwise sampling and correlated prior beliefs
- Optimal budget allocation policy for tabu search in stochastic simulation optimization
- Dynamic Programming for Response-Adaptive Dose-Finding Clinical Trials
- Optimal learning with non-Gaussian rewards
- The knowledge gradient algorithm for a general class of online learning problems
- The knowledge-gradient algorithm for sequencing experiments in drug discovery
- Bayesian sequential data collection for stochastic simulation calibration
- Learning to optimize via information-directed sampling
- The local time method for targeting and selection
- Information collection on a graph
- Optimal learning in linear regression with combinatorial feature selection
- Navigating the protein fitness landscape with Gaussian processes
- Optimal Learning for Stochastic Optimization with Nonlinear Parametric Belief Models
- A supermartingale approach to Gaussian process based sequential design of experiments
- Surrogate-based sequential Bayesian experimental design using non-stationary Gaussian processes
- Top-\(\kappa\) selection with pairwise comparisons
- Expected improvement for expensive optimization: a review
- Some properties of batch value of information in the selection problem
- Refined knowledge-gradient policy for learning probabilities
- Pareto set estimation with guaranteed probability of correct selection
- On parallel policies for ranking and selection problems
- Hyperparameter optimization for recommender systems through Bayesian optimization
- Optimal learning for sequential sampling with non-parametric beliefs
- Learning Enabled Constrained Black-Box Optimization
- Optimal learning with a local parametric belief model
- Dynamic Sampling Allocation Under Finite Simulation Budget for Feasibility Determination
- Finite-time analysis for the knowledge-gradient policy
- Asymptotic optimality of myopic ranking and selection procedures
- Perspectives of approximate dynamic programming
- Ranking and Selection with Covariates for Personalized Decision Making
- Simple Bayesian algorithms for best-arm identification
- Bayesian model calibration and optimization of surfactant-polymer flooding
- Evaluating Gaussian process metamodels and sequential designs for noisy level set estimation
- Convergence rate analysis for optimal computing budget allocation algorithms
- A knowledge gradient policy for sequencing experiments to identify the structure of RNA molecules using a sparse additive belief model
- Efficient Sampling Allocation Procedures for Optimal Quantile Selection
- Selecting the best alternative based on its quantile
- Hierarchical knowledge gradient for sequential sampling
- Optimal learning for nonlinear parametric belief models over multidimensional continuous spaces
- Simulation optimization: a review and exploration in the new era of cloud computing and big data
- Optimal online learning for nonlinear belief models using discrete priors
- Tracking global optima in dynamic environments with efficient global optimization
- Knockout-tournament procedures for large-scale ranking and selection in parallel computing environments
- Optimal learning in experimental design using the knowledge gradient policy with application to characterizing nanoemulsion stability
- Bayesian Optimization with Expensive Integrands
- Multifidelity Monte Carlo Estimation with Adaptive Low-Fidelity Models
- Sequential design of computer experiments for the estimation of a probability of failure
- Nested-Batch-Mode Learning and Stochastic Optimization with An Application to Sequential MultiStage Testing in Materials Science
- Ranking and selection for pairwise comparison
- Adaptive simulation selection for the discovery of the ground state line of binary alloys with a limited computational budget
- Consistency of sequential Bayesian sampling policies
- Information collection for linear programs with uncertain objective coefficients
- Multi-fidelity cost-aware Bayesian optimization
- A fully sequential elimination procedure for indifference-zone ranking and selection with tight bounds on probability of correct selection
- Tractable sampling strategies for ordinal optimization
- A unified framework for stochastic optimization
- Dynamic sampling allocation and design selection
This page was built for publication: A Knowledge-Gradient Policy for Sequential Information Collection
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3399249)
