Fetching the paper…
Reading the bibliography…
We study the oracle complexity of producing $(\delta,\epsilon)$-stationary points of Lipschitz functions, in the sense proposed by Zhang et al.
Optimization of lipschitz continuous functions
AA Goldstein · 1977
Earlier work this paper cites.
Probabilistic computations: Toward a unified measure of complexity
Andrew Chi-Chin Yao · 1977
Earlier work this paper cites.
Problem complexity and method efficiency in optimization
Arkadi Semenovich Nemirovski and David Borisovich Yudin · 1983
Earlier work this paper cites.
Optimization and nonsmooth analysis
Frank H Clarke · 1990
Earlier work this paper cites.
Information-based complexity of convex programming
Arkadi Nemirovski · 1995
Earlier work this paper cites.
How to make the gradients small
Yurii Nesterov · 2012
Earlier work this paper cites.
Convex optimization: Algorithms and complexity
Sébastien Bubeck · 2015
Cited alongside, same era.
Lower bound for randomized first order convex optimization
Blake Woodworth and Nathan Srebro · 2017
Cited alongside, same era.
How to make the gradients small stochastically: Even faster convex and nonconvex sgd
Zeyuan Allen-Zhu · 2018
Cited alongside, same era.
Complexity of finding near-stationary points of convex functions stochastically
Damek Davis and Dmitriy Drusvyatskiy · 2018
Cited alongside, same era.
Lectures on convex optimization , volume 137
Yurii Nesterov · 2018
Cited alongside, same era.
The Complexity of Optimization Beyond Convexity
Yair Carmon · 2020
Cited alongside, same era.
Complexity of finding stationary points of nonconvex nonsmooth functions
Jingzhao Zhang, Hongzhou Lin, Stefanie Jegelka, Suvrit Sra, and Ali Jadbabaie · 2020
Later among the works it cites.
Lower bounds for finding stationary points ii: first-order methods
Yair Carmon, John C Duchi, Oliver Hinder, and Aaron Sidford · 2021
Later among the works it cites.
Damek Davis, Dmitriy Drusvyatskiy, Yin Tat Lee, Swati Padmanabhan, and Guanghao Ye · 2021
Later among the works it cites.
Oracle complexity in nonsmooth nonconvex optimization
Guy Kornowski and Ohad Shamir · 2021
Later among the works it cites.
Gradient-free methods for deterministic and stochastic nonsmooth nonconvex optimization
Tianyi Lin, Zeyu Zheng, and Michael Jordan · 2022
Closest in time.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Lower bounds for finding stationary points i
Yair Carmon, John C Duchi, Oliver Hinder, and Aaron Sidford
Cited in the paper.
Acceleration with a ball optimization oracle
Yair Carmon, Arun Jambulapati, Qijia Jiang, Yujia Jin, Yin Tat Lee, Aaron Sidford, and Kevin Tian
Cited in the paper.
On the finite-time complexity and practical computation of approximate stationarity concepts of lipschitz functions
Lai Tian, Kaiwen Zhou, and Anthony Man-Cho So · 2022
Closest in time.