REVIEW 1 cited by
An Optimal Algorithm for Bandit and Zero-Order Convex Optimization with Two-Point Feedback
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
read the original abstract
We consider the closely related problems of bandit convex optimization with two-point feedback, and zero-order stochastic convex optimization with two function evaluations per round. We provide a simple algorithm and analysis which is optimal for convex Lipschitz functions. This improves on \cite{dujww13}, which only provides an optimal result for smooth functions; Moreover, the algorithm and analysis are simpler, and readily extend to non-Euclidean problems. The algorithm is based on a small but surprisingly powerful modification of the gradient estimator.
Forward citations
Cited by 1 Pith paper
-
Accelerated zero-order SGD under high-order smoothness and overparameterized regime
A kernel-based accelerated zero-order SGD method is introduced for convex stochastic optimization under higher-order smoothness and overparameterization, with convergence guarantees under deterministic and stochastic ...
Discussion (0). Continue with ORCID to comment.