Kernel-based methods for bandit convex optimization
From MaRDI portal
Publication:4977962
DOI10.1145/3055399.3055403zbMath1370.90175arXiv1607.03084OpenAlexW2963831922MaRDI QIDQ4977962
Sébastien Bubeck, Yin Tat Lee, Ronen Eldan
Publication date: 17 August 2017
Published in: Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1607.03084
Analysis of algorithms and problem complexity (68Q25) Convex programming (90C25) Learning and adaptive systems in artificial intelligence (68T05) Probabilistic games; gambling (91A60)
Related Items (11)
Stochastic zeroth-order discretizations of Langevin diffusions for Bayesian inference ⋮ Improved exploitation of higher order smoothness in derivative-free optimization ⋮ An Accelerated Method for Derivative-Free Smooth Stochastic Convex Optimization ⋮ Optimal multi-unit mechanisms with private demands ⋮ Non-smooth setting of stochastic decentralized convex optimization problem over time-varying graphs ⋮ Zeroth-order algorithms for nonconvex-strongly-concave minimax problems with improved complexities ⋮ Zeroth-order nonconvex stochastic optimization: handling constraints, high dimensionality, and saddle points ⋮ Technical Note—Nonstationary Stochastic Optimization Under Lp,q-Variation Measures ⋮ Exploratory distributions for convex functions ⋮ Improved regret for zeroth-order adversarial bandit convex optimisation ⋮ Derivative-free optimization methods
This page was built for publication: Kernel-based methods for bandit convex optimization
