Pages that link to "Item:Q3399249"
From MaRDI portal
The following pages link to A Knowledge-Gradient Policy for Sequential Information Collection (Q3399249):
Displaying 50 items.
- Perspectives of approximate dynamic programming (Q333093) (← links)
- Sequential design of computer experiments for the estimation of a probability of failure (Q693305) (← links)
- Optimal learning for sequential sampling with non-parametric beliefs (Q742143) (← links)
- Optimal learning with a local parametric belief model (Q746825) (← links)
- Top-\(\kappa\) selection with pairwise comparisons (Q1634303) (← links)
- A unified framework for stochastic optimization (Q1719609) (← links)
- Bayesian sequential data collection for stochastic simulation calibration (Q1735194) (← links)
- Refined knowledge-gradient policy for learning probabilities (Q1785627) (← links)
- Bayesian model calibration and optimization of surfactant-polymer flooding (Q2009830) (← links)
- Expected improvement for expensive optimization: a review (Q2022176) (← links)
- Pareto set estimation with guaranteed probability of correct selection (Q2030571) (← links)
- Hyperparameter optimization for recommender systems through Bayesian optimization (Q2033691) (← links)
- Evaluating Gaussian process metamodels and sequential designs for noisy level set estimation (Q2058770) (← links)
- Optimal budget allocation policy for tabu search in stochastic simulation optimization (Q2108143) (← links)
- Surrogate-based sequential Bayesian experimental design using non-stationary Gaussian processes (Q2237721) (← links)
- A supermartingale approach to Gaussian process based sequential design of experiments (Q2325344) (← links)
- Tracking global optima in dynamic environments with efficient global optimization (Q2630219) (← links)
- Multi-fidelity cost-aware Bayesian optimization (Q2693418) (← links)
- Optimal learning with non-Gaussian rewards (Q2806349) (← links)
- A Fully Sequential Elimination Procedure for Indifference-Zone Ranking and Selection with Tight Bounds on Probability of Correct Selection (Q2931710) (← links)
- Optimal Learning in Experimental Design Using the Knowledge Gradient Policy with Application to Characterizing Nanoemulsion Stability (Q2945155) (← links)
- On the Convergence Rates of Expected Improvement Methods (Q2957473) (← links)
- Optimal Learning in Linear Regression with Combinatorial Feature Selection (Q2960366) (← links)
- Dynamic Sampling Allocation and Design Selection (Q3186646) (← links)
- Optimal Learning with Local Nonlinear Parametric Models over Continuous Designs (Q3303989) (← links)
- Optimal Learning for Nonlinear Parametric Belief Models Over Multidimensional Continuous Spaces (Q4554064) (← links)
- Optimal Learning for Stochastic Optimization with Nonlinear Parametric Belief Models (Q4586173) (← links)
- Adaptive Simulation Selection for the Discovery of the Ground State Line of Binary Alloys with a Limited Computational Budget (Q4604867) (← links)
- Finite-Time Analysis for the Knowledge-Gradient Policy (Q4610155) (← links)
- Learning to Optimize via Information-Directed Sampling (Q4969321) (← links)
- The Local Time Method for Targeting and Selection (Q4971570) (← links)
- Efficient Sampling Allocation Procedures for Optimal Quantile Selection (Q4995067) (← links)
- Selecting the Best Alternative Based on Its Quantile (Q4995094) (← links)
- Knockout-Tournament Procedures for Large-Scale Ranking and Selection in Parallel Computing Environments (Q5031020) (← links)
- On parallel policies for ranking and selection problems (Q5036417) (← links)
- (Q5053250) (← links)
- Solving Large-Scale Fixed-Budget Ranking and Selection Problems (Q5060777) (← links)
- Bayesian Optimization with Expensive Integrands (Q5071110) (← links)
- Ranking and Selection with Covariates for Personalized Decision Making (Q5084611) (← links)
- Dynamic Sampling Allocation Under Finite Simulation Budget for Feasibility Determination (Q5084669) (← links)
- Practical Nonparametric Sampling Strategies for Quantile-Based Ordinal Optimization (Q5085988) (← links)
- Dynamic Programming for Response-Adaptive Dose-Finding Clinical Trials (Q5086016) (← links)
- Tractable Sampling Strategies for Ordinal Optimization (Q5131546) (← links)
- A Knowledge Gradient Policy for Sequencing Experiments to Identify the Structure of RNA Molecules Using a Sparse Additive Belief Model (Q5137960) (← links)
- Optimal Online Learning for Nonlinear Belief Models Using Discrete Priors (Q5144779) (← links)
- Simple Bayesian Algorithms for Best-Arm Identification (Q5144786) (← links)
- Learning Enabled Constrained Black-Box Optimization (Q5153491) (← links)
- Navigating the protein fitness landscape with Gaussian processes (Q5170991) (← links)
- Multifidelity Monte Carlo Estimation with Adaptive Low-Fidelity Models (Q5237167) (← links)
- Nested-Batch-Mode Learning and Stochastic Optimization with An Application to Sequential MultiStage Testing in Materials Science (Q5254790) (← links)
