4 papers · 1 filter
Adaptive two-points zero-order accelerated methods for stochastic convex optimization problems
Yuriy Dorn, Osman Osmanov, Timofei Loginov +3
We study stochastic convex optimization, where each sampled function can be evaluated at two arbitrary points. Our accelerated method chooses step sizes, batch sizes and smoothing…
Minimax Oracle Call Complexity, Rounds and Admissible Noise in Zeroth-Order Optimization of Highly Smooth Functions
Timofei Loginov, Darina Dvinskikh, Nazarii Tupitsa +3
We study zeroth-order optimization of convex and strongly convex functions with Hölder smoothness of order from values corrupted by random noise with bias independent of the…
Lower Bounds For Gradient-Free Convex Optimization And Convex-Concave Saddle-Point Problems
Yuriy Dorn, Darina Dvinskikh, Timofei Loginov +4
We study the query complexity of optimization with exact scalar-value information. For globally -smooth convex functions on with a minimizer in a Euclidean ball of…
The Complexity of Convex Optimization with Mismatched Geometry
Timofei Loginov, Alexander Gasnikov, Yuriy Dorn +4
Optimal first-order methods on non-Euclidean domains such as the ball pair the prox-function with the norm in which smoothness…