REVIEW 1 cited by
No-Regret Algorithms for Unconstrained Online Convex Optimization
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
read the original abstract
Some of the most compelling applications of online convex optimization, including online prediction and classification, are unconstrained: the natural feasible set is R^n. Existing algorithms fail to achieve sub-linear regret in this setting unless constraints on the comparator point x^* are known in advance. We present algorithms that, without such prior knowledge, offer near-optimal regret bounds with respect to any choice of x^*. In particular, regret with respect to x^* = 0 is constant. We then prove lower bounds showing that our guarantees are near-optimal in this setting.
Forward citations
Cited by 1 Pith paper
-
A Parameter-Free and Near-Optimal Zeroth-Order Algorithm for Stochastic Convex Optimization
POEM is a parameter-free stochastic zeroth-order method that adapts both step size and smoothing automatically and reaches near-optimal oracle complexity.
Discussion (0). Continue with ORCID to comment.