On the Complexity of Finding Small Subgradients in Nonsmooth Optimization

21 September 2022

Papers citing "On the Complexity of Finding Small Subgradients in Nonsmooth Optimization"

6 / 6 papers shown

Title
Random Scaling and Momentum for Non-smooth Non-convex Optimization Qinzi Zhang Ashok Cutkosky 19 4 0 16 May 2024
Testing Stationarity Concepts for ReLU Networks: Hardness, Regularity, and Robust Algorithms Lai Tian Anthony Man-Cho So 33 2 0 23 Feb 2023
Optimal Stochastic Non-smooth Non-convex Optimization through Online-to-Non-convex Conversion Ashok Cutkosky Harsh Mehta Francesco Orabona 25 32 0 07 Feb 2023
Oracle Complexity of Single-Loop Switching Subgradient Methods for Non-Smooth Weakly Convex Functional Constrained Optimization Yan Huang Qihang Lin 15 5 0 30 Jan 2023
Faster Gradient-Free Algorithms for Nonsmooth Nonconvex Stochastic Optimization Le‐Yu Chen Jing Xu Luo Luo 17 15 0 16 Jan 2023
Gradient-Free Methods for Deterministic and Stochastic Nonsmooth Nonconvex Optimization Tianyi Lin Zeyu Zheng Michael I. Jordan 47 50 0 12 Sep 2022