mlsanityData to 7 Oct 2026

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

arXiv 2101.03821 ↗First posted 11 Jan 2021math.OCcited by 2

Not on the map. Why?

Abstract (arXiv)

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: mathbbE left[f(overlinexN) - f(x^*)right] = tildeO left(dfracn2γ N^fracβ-1β right) in γ-strongly convex case, where n is the dimension. In this paper we improve this bound: mathbbE left[f(overlinexN) - f(x^*)right] = tildeO left(dfracn^2-frac1βγ N^fracβ-1β right).

Key facts. Cited by 2 papers in the map (data through 7 Oct 2026). First posted on arXiv 11 Jan 2021.

Builds on

No reference list yet.

Built on by

Cited by year

Citing papers per year: 2022: 1; 2023: 0; 2024: 1.

2 papers.