Distance-Distributed Design for Gaussian Process Surrogates
From MaRDI portal
Cites work
- A Comparison of Three Methods for Selecting Values of Input Variables in the Analysis of Output from a Computer Code
- A Limited Memory Algorithm for Bound Constrained Optimization
- A new and flexible method for constructing designs for computer experiments
- Analysis methods for computer experiments: how to assess and what counts?
- Batch sequential designs for computer experiments
- Bayesian calibration of computer models. (With discussion)
- Combining Field Data and Computer Simulations for Calibration and Prediction
- Convergence rates of efficient global optimization algorithms
- Design and analysis of computer experiments. With comments and a rejoinder by the authors
- Design of computer experiments: space filling and beyond
- Efficient global optimization of expensive black-box functions
- Exploratory designs for computational experiments
- Global sensitivity analysis: The primer
- Latin hypercubes and space-filling designs
- Minimax optimal designs via particle swarm optimization methods
- Practical Heteroscedastic Gaussian Process Modeling for Large Simulation Experiments
- Replication or Exploration? Sequential Design for Stochastic Simulation Experiments
- The design and analysis of computer experiments.
Cited in
(5)- Active Learning for Deep Gaussian Process Surrogates
- Efficient kriging using interleaved lattice-based designs with low fill and high separation distance properties
- Improved convergence rate of nested simulation with LSE on sieve
- Efficient Active Learning Strategies for Computer Experiments
- An Adjacency-Adaptive Gaussian Process Method for Sample Efficient Response Surface Modeling and Test-Point Acquisition
This page was built for publication: Distance-Distributed Design for Gaussian Process Surrogates
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6631860)
