A regularized online Newton method achieves polylogarithmic regret in convex bandits with linear vanishing noise under quadratic growth.
A Second-Order Method for Stochastic Bandit Convex Optimisation
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
abstract
We introduce a simple and efficient algorithm for unconstrained zeroth-order stochastic convex bandits and prove its regret is at most $(1 + r/d)[d^{1.5} \sqrt{n} + d^3] polylog(n, d, r)$ where $n$ is the horizon, $d$ the dimension and $r$ is the radius of a known ball containing the minimiser of the loss.
citation-role summary
method 1
citation-polarity summary
fields
math.OC 1years
2025 1verdicts
CONDITIONAL 1roles
method 1polarities
use method 1representative citing papers
citing papers explorer
-
A Regularized Online Newton Method for Stochastic Convex Bandits with Linear Vanishing Noise
A regularized online Newton method achieves polylogarithmic regret in convex bandits with linear vanishing noise under quadratic growth.