Efficient Active Learning Strategies for Computer Experiments
From MaRDI portal
No records found.
Cites work
- A Hierarchical Expected Improvement Method for Bayesian Optimization
- A Knowledge-Gradient Policy for Sequential Information Collection
- A sequential maximum projection design framework for computer experiments with inert factors
- Active Learning for Deep Gaussian Process Surrogates
- An efficient surrogate model for emulation and physics extraction of large eddy simulations
- Analysis of variance designs for model output
- Bayesian optimization
- Bayesian optimization in a billion dimensions via random embeddings
- Bayesian optimization of functional output in inverse problems
- Bayesian Optimization Via Barrier Functions
- Distance-Distributed Design for Gaussian Process Surrogates
- Efficient global optimization of expensive black-box functions
- Exploratory designs for computational experiments
- scientific article; zbMATH DE number 1425054 (Why is no real title available?)
- Maximum One-Factor-At-A-Time Designs for Screening in Computer Experiments
- Maximum projection designs for computer experiments
- Meshfree approximation methods with Matlab. With CD-ROM.
- Scikit-learn: machine learning in Python
- Sequential Designs for Filling Output Spaces
- Sequential Optimization in Locally Important Dimensions
- Sequentially refined Latin hypercube designs: reusing every point
- The design and analysis of computer experiments
- THE DESIGN OF OPTIMUM MULTIFACTORIAL EXPERIMENTS
This page was built for publication: Efficient Active Learning Strategies for Computer Experiments
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7309071)
