Kernel-based Methods for Bandit Convex Optimization

DOI10.1145/3453721MaRDI QIDQ5056415zbMATH OpenOpenAlexFDO

Authors Sébastien Bubeck, Ronen Eldan, Yin Tat Lee

Publication date 8 December 2022

Published in Journal of the ACM (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/3453721

zbMATH Keywords

convex optimizationkernel methodsexponential weightsbandit optimization

Mathematics Subject Classification ID

Convex programming (90C25)

Recommendations

• Kernel-based methods for bandit convex optimization
• Kernel estimation and model combination in a bandit problem with covariates
• Stochastic convex optimization with bandit feedback
• Bandit convex optimization in non-stationary environments
• Bandwidth selection in kernel empirical risk minimization via the gradient
• Optimizing Kernel Methods: A Unifying Variational Principle
• Optimal and robust kernel algorithms for passive stochastic approximation
• On convergence of kernel learning estimators

Cited in

(3)

• Zeroth-order random subspace algorithm for non-smooth convex optimization
• Stochastic convex optimization with bandit feedback
• Kernel-based methods for bandit convex optimization

This page was built for publication: Kernel-based Methods for Bandit Convex Optimization

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