Modelling human active search in optimizing black-box functions
From MaRDI portal
Publication:2156913
DOI10.1007/s00500-020-05398-2zbMath1491.91100arXiv2003.04275OpenAlexW3093562027MaRDI QIDQ2156913
R. Perego, I. Giordani, A. Candelieri, Andrea Ponti, Francesco Archetti
Publication date: 21 July 2022
Published in: Soft Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2003.04275
Related Items (2)
To the special issue dedicated to the 3rd international conference ``Numerical computations: theory and algorithms -- NUMTA 2019 June 15--21, 2019, Isola Capo Rizzuto, Italy ⋮ On the use of Wasserstein distance in the distributional analysis of human decision making under uncertainty
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Lipschitzian optimization without the Lipschitz constant
- A tutorial on Gaussian process regression: modelling, exploring, and exploiting functions
- Bayesian optimization of pump operations in water distribution systems
- Novel local tuning techniques for speeding up one-dimensional algorithms in expensive global optimization using Lipschitz derivatives
- A review of particle swarm optimization. I: Background and development
- Space-filling curves for numerical approximation and visualization of solutions to systems of nonlinear inequalities with applications in robotics
- Are Humans Bayesian in the Optimization of Black-Box Functions?
- Bayesian Optimization and Data Science
- Information-Theoretic Regret Bounds for Gaussian Process Optimization in the Bandit Setting
- Quantitative Analysis of Human-Model Agreement in Visual Saliency Modeling: A Comparative Study
- Pitfalls and Best Practices in Algorithm Configuration
This page was built for publication: Modelling human active search in optimizing black-box functions
