We study zeroth-order optimization of convex and strongly convex functions with H\"older smoothness of order $\beta>2$ from values corrupted by random noise with bias independent of the method's random directions, a Lipschitz systematic error and a bounded adversarial error. We measure the number of function evaluation...
Т. В. Логінов, D. Dvinskikh, Nazarii Tupitsa et al.· 0 citations
We combine CaCuTe with sequential subspace optimization (SESOP) for smooth convex minimization under Lipschitz continuity of the Hessian. The resulting method, CaCuSESOP, achieves the global rate $O(k^{-2})$ with a fixed number of Hessian--vector products per iteration, while removing key limitations of classical SESOP...
We study zeroth-order optimization of convex and strongly convex functions with H\"older smoothness of order $\beta>2$ from values corrupted by random noise with bias independent of the method's random directions, a Lipschitz systematic error and a bounded adversarial error. We measure the number of function evaluation...
Т. В. Логінов, D. Dvinskikh, Nazarii Tupitsa et al.· 0 citations
We study the query complexity of optimization with exact scalar-value information. For globally $L$-smooth convex functions on $\mathbb R^d$ with a minimizer in a Euclidean ball of radius $R$, we prove the lower bound $\Omega(d\min\{d,\sqrt{LR^2/\varepsilon}\})$ for adaptive randomized algorithms in the stated accuracy...
Y. Dorn, D. Dvinskikh, Т. В. Логінов et al.· 0 citations
It is shown that for this mismatched problem the minimax value of the gap is of order $LR^2/N^3$ up to logarithmic factors, for deterministic and for randomized methods alike, and already in dimension proportional to the number of queries.
Т. В. Логінов, A. Gasnikov, Yuriy Dorn et al.· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.