Optimal learning for nonlinear parametric belief models over multidimensional continuous spaces
From MaRDI portal
Publication:4554064
DOI10.1137/17M1129301zbMATH Open1404.62023WikidataQ129003289 ScholiaQ129003289MaRDI QIDQ4554064FDOQ4554064
Authors: Xinyu He, Yangzhou Hu, Warren Powell 
Publication date: 7 November 2018
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Recommendations
- Optimal learning with local nonlinear parametric models over continuous designs
- Optimal learning with a local parametric belief model
- Optimal Learning for Stochastic Optimization with Nonlinear Parametric Belief Models
- Convergence rates of efficient global optimization algorithms
- Optimal learning for sequential sampling with non-parametric beliefs
Statistical ranking and selection procedures (62F07) Approximation methods and heuristics in mathematical programming (90C59) Stochastic programming (90C15)
Cites Work
- UOBYQA: unconstrained optimization by quadratic approximation
- Generalized Poisson Models and their Applications in Insurance and Finance
- Stochastic approximation methods for constrained and unconstrained systems
- Introduction to Stochastic Search and Optimization
- Iterative learning control for deterministic systems
- Finite-time analysis of the multiarmed bandit problem
- Approximate Dynamic Programming
- Constrained global optimization of expensive black box functions using radial basis functions
- Stochastic Estimation of the Maximum of a Regression Function
- Handbooks in operations research and management science: Simulation
- A survey on metaheuristics for stochastic combinatorial optimization
- The knowledge-gradient policy for correlated normal beliefs
- SO-MI: a surrogate model algorithm for computationally expensive nonlinear mixed-integer black-box global optimization problems
- Simulation budget allocation for further enhancing the efficiency of ordinal optimization
- Bayesian look ahead one-stage sampling allocations for selection of the best population
- The knowledge-gradient algorithm for sequencing experiments in drug discovery
- A Knowledge-Gradient Policy for Sequential Information Collection
- Simulated annealing in the presence of noise
- Simulation allocation for determining the best design in the presence of correlated sampling
- Geometry of interpolation sets in derivative free optimization
- ORBIT: Optimization by Radial Basis Function Interpolation in Trust-Regions
- Convergence results for single-step on-policy reinforcement-learning algorithms
- Adaptation and tracking in system identification - a survey
- Title not available (Why is that?)
- A comparison of evolution strategies with other direct search methods in the presence of noise
- A method of trust region type for minimizing noisy functions
- The Correlated Knowledge Gradient for Simulation Optimization of Continuous Parameters using Gaussian Process Regression
- Optimal Learning for Stochastic Optimization with Nonlinear Parametric Belief Models
- Learning to Optimize via Posterior Sampling
- On the solution of stochastic optimization and variational problems in imperfect information regimes
- A direct search algorithm for optimization with noisy function evaluations
- On stable learning in dynamic oligopolies
- Sequential sampling to myopically maximize the expected value of information
- Optimal Learning in Experimental Design Using the Knowledge Gradient Policy with Application to Characterizing Nanoemulsion Stability
- Title not available (Why is that?)
- Why are Normal Distributions Normal?
- Dynamic Sampling Allocation and Design Selection
Cited In (4)
Uses Software
This page was built for publication: Optimal learning for nonlinear parametric belief models over multidimensional continuous spaces
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4554064)
