Fetching the paper…
Reading the bibliography…
This paper considers the problem for finding the $(\delta,\epsilon)$-Goldstein stationary point of Lipschitz continuous objective, which is a rich function class to cover a great number of important applications.
Optimization of lipschitz continuous functions
AA Goldstein · 1977
Earlier work this paper cites.
Optimization and nonsmooth analysis
Frank H Clarke · 1990
Earlier work this paper cites.
Variable selection via nonconcave penalized likelihood and its oracle properties
Jianqing Fan and Runze Li · 2001
Earlier work this paper cites.
Creating superpositions that correspond to efficiently integrable probability distributions
Lov Grover and Terry Rudolph · 2002
Earlier work this paper cites.
Supply chain management integration and implementation: a literature review
Damien Power · 2005
Earlier work this paper cites.
Dynamic asset pricing theory
Darrell Duffie · 2010
Earlier work this paper cites.
Rectified linear units improve restricted boltzmann machines
Vinod Nair and Geoffrey E Hinton · 2010
Earlier work this paper cites.
Quantum computation and quantum information
Michael A Nielsen and Isaac L Chuang · 2010
Earlier work this paper cites.
Nearly unbiased variable selection under minimax concave penalty
Cun-Hui Zhang · 2010
Earlier work this paper cites.
Deep sparse rectifier neural networks
Xavier Glorot, Antoine Bordes, and Yoshua Bengio · 2011
Earlier work this paper cites.
Sparsenet: Coordinate descent with nonconvex penalties
Rahul Mazumder, Jerome H Friedman, and Trevor Hastie · 2011
Earlier work this paper cites.
Randomized smoothing for stochastic optimization
John C Duchi, Peter L Bartlett, and Martin J Wainwright · 2012
Earlier work this paper cites.
On stochastic gradient and subgradient methods with adaptive steplength sequences
Farzad Yousefian, Angelia Nedić, and Uday V Shanbhag · 2012
Earlier work this paper cites.
Discrete optimization via simulation
L Jeff Hong, Barry L Nelson, and Jie Xu · 2015
Earlier work this paper cites.
Quantum speed-ups for solving semidefinite programs
Fernando GSL Brandao and Krysta M Svore · 2017
Earlier work this paper cites.
Quantum recommendation systems
Iordanis Kerenidis and Anupam Prakash · 2017
Earlier work this paper cites.
Random gradient-free minimization of convex functions
Yurii Nesterov and Vladimir Spokoiny · 2017
Earlier work this paper cites.
Quantum arithmetic with the quantum fourier transform
Lidia Ruiz-Perez and Juan Carlos Garcia-Escartin · 2017
Earlier work this paper cites.
Quantum sdp-solvers: Better upper and lower bounds
Joran Van Apeldoorn, András Gilyén, Sander Gribling, and Ronald de Wolf · 2017
Earlier work this paper cites.
Structured evolution with compact architectures for scalable policy optimization
Krzysztof Choromanski, Mark Rowland, Vikas Sindhwani, Richard Turner, and Adrian Weller · 2018
Earlier work this paper cites.
Spider: Near-optimal non-convex optimization via stochastic path-integrated differential estimator
Cong Fang, Chris Junchi Li, Zhouchen Lin, and Tong Zhang · 2018
Cited alongside, same era.
Provably correct automatic sub-differentiation for qualified programs
Sham M Kakade and Jason D Lee · 2018
Cited alongside, same era.
Quantum computing in the nisq era and beyond
John Preskill · 2018
Cited alongside, same era.
Improvements in quantum sdp-solving with applications
Joran Van Apeldoorn and András Gilyén · 2018
Cited alongside, same era.
Quantum sdp solvers: Large speed-ups, optimality, and applications to quantum learning
Fernando GSL Brandão, Amir Kalev, Tongyang Li, Cedric Yen-Yu Lin, Krysta M Svore, and Xiaodi Wu · 2019
Cited alongside, same era.
Do differentiable simulators give better policy gradients?
Hyung Ju Suh, Max Simchowitz, Kaiqing Zhang, and Russ Tedrake · 2022
Later among the works it cites.
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
Later among the works it cites.
Quantum algorithm for estimating volumes of convex bodies
Shouvanik Chakrabarti, Andrew M Childs, Shih-Han Hung, Tongyang Li, Chunhao Wang, and Xiaodi Wu · 2023
Later among the works it cites.
Faster gradient-free algorithms for nonsmooth nonconvex stochastic optimization
Lesi Chen, Jing Xu, and Luo Luo · 2023
Later among the works it cites.
A sublinear-time quantum algorithm for approximating partition functions
Arjan Cornelissen and Yassine Hamoudi · 2023
Later among the works it cites.
Optimal stochastic non-smooth non-convex optimization through online-to-non-convex conversion
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Craig Gidney · 2019
Cited alongside, same era.
Quantum algorithms and lower bounds for convex optimization
Shouvanik Chakrabarti, Andrew M Childs, Tongyang Li, and Xiaodi Wu · 2020
Cited alongside, same era.
No quantum speedup over gradient descent for non-smooth convex optimization
Ankit Garg, Robin Kothari, Praneeth Netrapalli, and Suhail Sherif · 2020
Cited alongside, same era.
Convex optimization using quantum oracles
Joran van Apeldoorn, András Gilyén, Sander Gribling, and Ronald de Wolf · 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
Cited alongside, same era.
Oracle complexity in nonsmooth nonconvex optimization
Guy Kornowski and Ohad Shamir · 2021
Cited alongside, same era.
Page: A simple and optimal probabilistic gradient estimator for nonconvex optimization
Zhize Li, Hongyan Bao, Xiangliang Zhang, and Peter Richtárik · 2021
Cited alongside, same era.
Ashok Cutkosky, Harsh Mehta, and Francesco Orabona · 2023
Later among the works it cites.
Deterministic nonsmooth nonconvex optimization
Michael Jordan, Guy Kornowski, Tianyi Lin, Ohad Shamir, and Manolis Zampetakis · 2023
Later among the works it cites.
Guy Kornowski and Ohad Shamir · 2023
Later among the works it cites.
On quantum speedups for nonconvex optimization via quantum tunneling walks
Yizhou Liu, Weijie J Su, and Tongyang Li · 2023
Later among the works it cites.
Quantum multiplication algorithm based on the convolution theorem
Mehdi Ramezani, Morteza Nikaeen, Farnaz Farman, Seyed Mahmoud Ashrafi, and Alireza Bahrampour · 2023
Later among the works it cites.
Quantum speedups for stochastic optimization
Aaron Sidford and Chenyi Zhang · 2023
Later among the works it cites.
Quantum multi-armed bandits and stochastic linear bandits enjoy logarithmic regrets
Zongqi Wan, Zhijie Zhang, Tongyang Li, Jialin Zhang, and Xiaoming Sun · 2023
Later among the works it cites.
Yulian Wu, Chaowen Guan, Vaneet Aggarwal, and Di Wang · 2023
Later among the works it cites.
Quantum lower bounds for finding stationary points of nonconvex functions
Chenyi Zhang and Tongyang Li · 2023
Later among the works it cites.
Quantum algorithm for online exp-concave optimization
Jianhao He, Chengchang Liu, Xutong Liu, Lvzhou Li, and John CS Lui · 2024
Closest in time.
Decentralized gradient-free methods for stochastic non-smooth non-convex optimization
Zhenwei Lin, Jingfan Xia, Qi Deng, and Luo Luo · 2024
Closest in time.
Zeroth-order methods for constrained nonconvex nonsmooth stochastic optimization
Zhuanghua Liu, Cheng Chen, Luo Luo, and Bryan Kian Hsiang Low · 2024
Closest in time.
An online optimization perspective on first-order and zero-order decentralized nonsmooth nonconvex stochastic optimization
Emre Sahinoglu and Shahin Shahrampour · 2024
Closest in time.
No dimension-free deterministic algorithm computes approximate stationarities of lipschitzians
Lai Tian and Anthony Man-Cho So · 2024
Closest in time.
Quantum algorithms and lower bounds for finite-sum optimization
Yexin Zhang, Chenyi Zhang, Cong Fang, Liwei Wang, and Tongyang Li · 2024
Closest in time.