Communities
Connect sessions
AI calendar
Organizations
Join Slack
Contact Sales
Search
Open menu
Home
Papers
2002.04130
Cited By
v1
v2
v3 (latest)
Complexity of Finding Stationary Points of Nonsmooth Nonconvex Functions
10 February 2020
J.N. Zhang
Hongzhou Lin
Stefanie Jegelka
Ali Jadbabaie
S. Sra
Re-assign community
ArXiv (abs)
PDF
HTML
Papers citing
"Complexity of Finding Stationary Points of Nonsmooth Nonconvex Functions"
22 / 22 papers shown
Two-Timescale Gradient Descent Ascent Algorithms for Nonconvex Minimax Optimization
Tianyi Lin
Chi Jin
Michael I. Jordan
645
25
0
28 Jan 2025
Reevaluating Theoretical Analysis Methods for Optimization in Deep Learning
Hoang Tran
Qinzi Zhang
Ashok Cutkosky
426
4
0
01 Jul 2024
Private Zeroth-Order Nonsmooth Nonconvex Optimization
Qinzi Zhang
Hoang Tran
Ashok Cutkosky
311
7
0
27 Jun 2024
Random Scaling and Momentum for Non-smooth Non-convex Optimization
International Conference on Machine Learning (ICML), 2024
Qinzi Zhang
Ashok Cutkosky
318
8
0
16 May 2024
Testing Stationarity Concepts for ReLU Networks: Hardness, Regularity, and Robust Algorithms
Lai Tian
Anthony Man-Cho So
278
2
0
23 Feb 2023
Averaged Method of Multipliers for Bi-Level Optimization without Lower-Level Strong Convexity
International Conference on Machine Learning (ICML), 2023
Risheng Liu
Yaohua Liu
Wei-Ting Yao
Shangzhi Zeng
Jin Zhang
279
35
0
07 Feb 2023
Oracle Complexity of Single-Loop Switching Subgradient Methods for Non-Smooth Weakly Convex Functional Constrained Optimization
Neural Information Processing Systems (NeurIPS), 2023
Yan Huang
Qihang Lin
420
15
0
30 Jan 2023
Convergence of First-Order Algorithms for Meta-Learning with Moreau Envelopes
Konstantin Mishchenko
Slavomír Hanzely
Peter Richtárik
FedML
269
8
0
17 Jan 2023
Faster Gradient-Free Algorithms for Nonsmooth Nonconvex Stochastic Optimization
International Conference on Machine Learning (ICML), 2023
Le‐Yu Chen
Jing Xu
Luo Luo
299
24
0
16 Jan 2023
A Stochastic Proximal Method for Nonsmooth Regularized Finite Sum Optimization
Dounia Lakhmiri
D. Orban
Andrea Lodi
172
0
0
14 Jun 2022
Policy Gradient Method For Robust Reinforcement Learning
International Conference on Machine Learning (ICML), 2022
Yue Wang
Shaofeng Zou
430
100
0
15 May 2022
Minibatch and Momentum Model-based Methods for Stochastic Weakly Convex Optimization
Neural Information Processing Systems (NeurIPS), 2021
Qi Deng
Wenzhi Gao
314
17
0
06 Jun 2021
Adam
+
^+
+
: A Stochastic Method with Adaptive Variance Reduction
Mingrui Liu
Wei Zhang
Francesco Orabona
Tianbao Yang
213
33
0
24 Nov 2020
An Approximation Algorithm for Optimal Subarchitecture Extraction
Adrian de Wynter
304
1
0
16 Oct 2020
On The Convergence of First Order Methods for Quasar-Convex Optimization
Jikai Jin
317
11
0
10 Oct 2020
Improved Analysis of Clipping Algorithms for Non-convex Optimization
Neural Information Processing Systems (NeurIPS), 2020
Bohang Zhang
Jikai Jin
Cong Fang
Liwei Wang
418
118
0
05 Oct 2020
Incremental Without Replacement Sampling in Nonconvex Optimization
Journal of Optimization Theory and Applications (JOTA), 2020
Edouard Pauwels
406
5
0
15 Jul 2020
Projection Robust Wasserstein Distance and Riemannian Optimization
Neural Information Processing Systems (NeurIPS), 2020
Tianyi Lin
Chenyou Fan
Nhat Ho
Marco Cuturi
Sai Li
743
79
0
12 Jun 2020
Convergence of adaptive algorithms for weakly convex constrained optimization
Ahmet Alacaoglu
Yura Malitsky
Volkan Cevher
240
14
0
11 Jun 2020
A mathematical model for automatic differentiation in machine learning
Neural Information Processing Systems (NeurIPS), 2020
Jérôme Bolte
Edouard Pauwels
221
75
0
03 Jun 2020
Can We Find Near-Approximately-Stationary Points of Nonsmooth Nonconvex Functions?
Ohad Shamir
305
17
0
27 Feb 2020
Support Vector Machine Classifier via
L
0
/
1
L_{0/1}
L
0/1
Soft-Margin Loss
IEEE Transactions on Pattern Analysis and Machine Intelligence (TPAMI), 2019
Huajun Wang
Yuanhai Shao
Shenglong Zhou
Ce Zhang
N. Xiu
VLM
343
64
0
16 Dec 2019
1
Page 1 of 1
