Certified multifidelity zeroth-order optimization
From MaRDI portal
Publication:6645132
DOI10.1137/23m1591086MaRDI QIDQ6645132
Étienne de Montbrun, Sébastien Gerchinovitz
Publication date: 28 November 2024
Published in: SIAM/ASA Journal on Uncertainty Quantification (Search for Journal in Brave)
Decision theory (91B06) Nonconvex programming, global optimization (90C26) Derivative-free methods and methods using generalized derivatives (90C56) Numerical optimization and variational techniques (65K10) Learning and adaptive systems in artificial intelligence (68T05) Optimal stopping in statistics (62L15)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Global optimization of univariate Lipschitz functions. I: Survey and properties
- Global optimization of univariate Lipschitz functions. II: New algorithms and computational comparison
- Efficient global optimization of expensive black-box functions
- Lipschitzian optimization without the Lipschitz constant
- Introductory lectures on convex optimization. A basic course.
- Convex and stochastic optimization
- Best arm identification in generalized linear bandits
- Optimal algorithms for global optimization in case of unknown Lipschitz constant
- Lipschitz Bandits without the Lipschitz Constant
- The complexity of the computation of the global extremum in a class of multi-extremum problems
- Multi-fidelity optimization via surrogate modelling
- On the Number of Iterations of Piyavskii's Global Optimization Algorithm
- Introduction to Stochastic Search and Optimization
- Survey of Multifidelity Methods in Uncertainty Propagation, Inference, and Optimization
- High-Dimensional Statistics
- Non-convex Optimization for Machine Learning
- An algorithm for finding the absolute extremum of a function
- Nonasymptotic sequential tests for overlapping hypotheses applied to near-optimal arm identification in bandit models
- Bayesian Optimization
- Bandit Algorithms
- From Bandits to Monte-Carlo Tree Search: The Optimistic Principle Applied to Optimization and Planning
- Introduction to Multi-Armed Bandits
- Bandits and Experts in Metric Spaces
- Derivative-free optimization methods
- Multi-fidelity Gaussian Process Bandit Optimisation
- Convergence rates of efficient global optimization algorithms
- A Sequential Method Seeking the Global Maximum of a Function
- Estimation of the efficiency of an absolute-minimum-finding algorithm
- Finite-time analysis of the multiarmed bandit problem
This page was built for publication: Certified multifidelity zeroth-order optimization
