Improved Exploiting Higher Order Smoothness in Derivative-free Optimization and Continuous Bandit

Abstract

We consider β-smooth (satisfies the generalized Holder condition with parameter β > 2) stochastic convex optimization problem with zero-order one-point oracle. The best known result was arXiv:2006.07862: E [f(xN) - f(x*)] = O (n2γ Nβ-1β ) in γ-strongly convex case, where n is the dimension. In this paper we improve this bound: E [f(xN) - f(x*)] = O (n2-1βγ Nβ-1β ).

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…