REVIEW 1 cited by
A Second-Order Method for Stochastic Bandit Convex Optimisation
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
Signed reviews
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.
Forward citations
Cited by 1 Pith paper
-
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.
Discussion (0). Continue with ORCID to comment.