The knowledge-gradient algorithm for sequencing experiments in drug discovery
From MaRDI portal
Recommendations
- The knowledge-gradient policy for correlated normal beliefs
- A knowledge gradient policy for sequencing experiments to identify the structure of RNA molecules using a sparse additive belief model
- Molecular discovery by optimal sequential search
- Hierarchical knowledge gradient for sequential sampling
- A Knowledge-Gradient Policy for Sequential Information Collection
Cited in
(22)- Optimal learning with local nonlinear parametric models over continuous designs
- Molecular discovery by optimal sequential search
- Optimal information blending with measurements in the \(L^{2}\) sphere
- Optimal learning in linear regression with combinatorial feature selection
- Optimal Learning for Stochastic Optimization with Nonlinear Parametric Belief Models
- Bayesian exploration for approximate dynamic programming
- Optimal learning for sequential sampling with non-parametric beliefs
- Optimal learning with a local parametric belief model
- G-SELC: optimization by sequential elimination of level combinations using genetic algorithms and Gaussian processes
- Finite-time analysis for the knowledge-gradient policy
- Perspectives of approximate dynamic programming
- Bayes Optimal Informer Sets for Early-Stage Drug Discovery
- Efficient simulation budget allocation for contextual ranking and selection with quadratic models
- Ranking and Selection with Covariates for Personalized Decision Making
- A knowledge gradient policy for sequencing experiments to identify the structure of RNA molecules using a sparse additive belief model
- Optimal learning for nonlinear parametric belief models over multidimensional continuous spaces
- Review of large-scale simulation optimization
- Optimal learning in experimental design using the knowledge gradient policy with application to characterizing nanoemulsion stability
- Nested-Batch-Mode Learning and Stochastic Optimization with An Application to Sequential MultiStage Testing in Materials Science
- Lower bounds on the noiseless worst-case complexity of efficient global optimization
- Approximate Bayesian inference for simulation and optimization
- A bi-objective optimization based acquisition strategy for batch Bayesian global optimization
This page was built for publication: The knowledge-gradient algorithm for sequencing experiments in drug discovery
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2899126)
