General parallel optimization a without metric

MaRDI QIDQ7034373zbMATH OpenFDO

Authors Xuedong Shang, Emilie Kaufmann, Michal Valko

Publication date 31 January 2025

Full work available at URL https://proceedings.mlr.press/v98/xuedong19a.html

zbMATH Keywords

black-box optimizationcontinuously-armed banditsglobal optimization

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Nonconvex programming, global optimization (90C26)

Cites work

• X-armed bandits
• Adaptive-treed bandits
• Asymptotically Minimax Adaptive Estimation. I: Upper Bounds. Optimally Adaptive Estimates
• Bandits and Experts in Metric Spaces
• From bandits to Monte-Carlo tree search: the optimistic principle applied to optimization and planning
• Improved Rates for the Stochastic Continuum-Armed Bandit Problem
• Optimal pointwise adaptive methods in nonparametric estimation
• Pure exploration in multi-armed bandits problems
• Regret and Convergence Bounds for a Class of Continuum-Armed Bandit Problems
• The Continuum-Armed Bandit Problem
• Weighted sums of certain dependent random variables

Cited in

(1)

• A simple parameter-free and adaptive approach to optimization under a minimal local smoothness assumption

This page was built for publication: General parallel optimization a without metric

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7034373)