Modeling and Active Learning for Experiments with Quantitative-Sequence Factors
From MaRDI portal
Publication:6154003
DOI10.1080/01621459.2022.2123335arXiv2209.02644OpenAlexW4295846637MaRDI QIDQ6154003
Xinwei Deng, Qian Xiao, Abhyuday Mandal, Ya Ping Wang
Publication date: 19 March 2024
Published in: Journal of the American Statistical Association (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2209.02644
global optimizationadaptive designorder-of-addition experimentGaussian process modelsequential experiment
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Comparison of Gaussian process modeling software
- Exploratory designs for computational experiments
- Minimax optimal designs via particle swarm optimization methods
- Cases for the nugget in modeling computer experiments
- A mapping-based universal kriging model for order-of-addition experiments in drug combination studies
- On the limited memory BFGS method for large scale optimization
- Threshold accepting: A general purpose optimization algorithm appearing superior to simulated annealing
- Kriging metamodeling in simulation: a review
- Efficient global optimization of expensive black-box functions
- Orthogonal arrays. Theory and applications
- Uniform projection designs
- Optimal maximin \(L_{1}\)-distance Latin hypercube designs based on good lattice point designs
- Construction of optimal fractional Order-of-Addition designs via block designs
- Single-machine scheduling to minimize the total earliness and tardiness is strongly NP-hard
- The Knowledge-Gradient Policy for Correlated Normal Beliefs
- Numerical Methods and Optimization in Finance
- Experiments
- Design for computer experiments with qualitative and quantitative factors
- Space-filling properties of good lattice point sets
- Nonseparable, Stationary Covariance Functions for Space–Time Data
- Construction of Maximin Distance Designs via Level Permutation and Expansion
- Active Learning Through Sequential Design, With Applications to Detection of Money Laundering
- Maximum projection designs for computer experiments
- Information-Theoretic Regret Bounds for Gaussian Process Optimization in the Bandit Setting
- Construction of maximin distance Latin squares and related Latin hypercube designs
- Adjustment of an Inverse Matrix Corresponding to a Change in One Element of a Given Matrix
- EzGP: Easy-to-Interpret Gaussian Process Models for Computer Experiments with Both Quantitative and Qualitative Factors
- Design of order-of-addition experiments
