2000 character limit reached
A Second-Order Method for Stochastic Bandit Convex Optimisation
Published 10 Feb 2023 in cs.LG, math.OC, and stat.ML | (2302.05371v1)
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} + d3] 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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.
