mlsanityData to 7 Oct 2026

Lower Bound for Randomized First Order Convex Optimization

arXiv 1709.03594 ↗First posted 11 Sep 2017math.OCcited by 9

Not on the map. Why?

Abstract (arXiv)

We provide an explicit construction and direct proof for the lower bound on the number of first order oracle accesses required for a randomized algorithm to minimize a convex Lipschitz function.

Key facts. Cited by 9 papers in the map (data through 7 Oct 2026). First posted on arXiv 11 Sep 2017.

Builds on

No reference list yet.

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2021: 2; 2022: 2; 2023: 3; 2024: 0; 2025: 1; 2026: 1.

9 papers.