ResearchTrend.AI
  • Papers
  • Communities
  • Events
  • Blog
  • Pricing
Papers
Communities
Social Events
Terms and Conditions
Pricing
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2025 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 2002.04130
  4. Cited By
Complexity of Finding Stationary Points of Nonsmooth Nonconvex Functions
v1v2v3 (latest)

Complexity of Finding Stationary Points of Nonsmooth Nonconvex Functions

10 February 2020
J.N. Zhang
Hongzhou Lin
Stefanie Jegelka
Ali Jadbabaie
S. Sra
ArXiv (abs)PDFHTML

Papers citing "Complexity of Finding Stationary Points of Nonsmooth Nonconvex Functions"

13 / 13 papers shown
Title
Two-Timescale Gradient Descent Ascent Algorithms for Nonconvex Minimax Optimization
Two-Timescale Gradient Descent Ascent Algorithms for Nonconvex Minimax Optimization
Tianyi Lin
Chi Jin
Michael I. Jordan
150
8
0
28 Jan 2025
Private Zeroth-Order Nonsmooth Nonconvex Optimization
Private Zeroth-Order Nonsmooth Nonconvex Optimization
Qinzi Zhang
Hoang Tran
Ashok Cutkosky
106
4
0
27 Jun 2024
Convergence of First-Order Algorithms for Meta-Learning with Moreau
  Envelopes
Convergence of First-Order Algorithms for Meta-Learning with Moreau Envelopes
Konstantin Mishchenko
Slavomír Hanzely
Peter Richtárik
FedML
71
6
0
17 Jan 2023
Policy Gradient Method For Robust Reinforcement Learning
Policy Gradient Method For Robust Reinforcement Learning
Yue Wang
Shaofeng Zou
132
77
0
15 May 2022
Minibatch and Momentum Model-based Methods for Stochastic Weakly Convex
  Optimization
Minibatch and Momentum Model-based Methods for Stochastic Weakly Convex Optimization
Qi Deng
Wenzhi Gao
77
14
0
06 Jun 2021
Adam$^+$: A Stochastic Method with Adaptive Variance Reduction
Adam+^++: A Stochastic Method with Adaptive Variance Reduction
Mingrui Liu
Wei Zhang
Francesco Orabona
Tianbao Yang
55
28
0
24 Nov 2020
An Approximation Algorithm for Optimal Subarchitecture Extraction
An Approximation Algorithm for Optimal Subarchitecture Extraction
Adrian de Wynter
75
1
0
16 Oct 2020
Improved Analysis of Clipping Algorithms for Non-convex Optimization
Improved Analysis of Clipping Algorithms for Non-convex Optimization
Bohang Zhang
Jikai Jin
Cong Fang
Liwei Wang
126
92
0
05 Oct 2020
Incremental Without Replacement Sampling in Nonconvex Optimization
Incremental Without Replacement Sampling in Nonconvex Optimization
Edouard Pauwels
61
5
0
15 Jul 2020
Convergence of adaptive algorithms for weakly convex constrained
  optimization
Convergence of adaptive algorithms for weakly convex constrained optimization
Ahmet Alacaoglu
Yura Malitsky
Volkan Cevher
61
10
0
11 Jun 2020
A mathematical model for automatic differentiation in machine learning
A mathematical model for automatic differentiation in machine learning
Jérôme Bolte
Edouard Pauwels
82
68
0
03 Jun 2020
Can We Find Near-Approximately-Stationary Points of Nonsmooth Nonconvex
  Functions?
Can We Find Near-Approximately-Stationary Points of Nonsmooth Nonconvex Functions?
Ohad Shamir
56
17
0
27 Feb 2020
Support Vector Machine Classifier via $L_{0/1}$ Soft-Margin Loss
Support Vector Machine Classifier via L0/1L_{0/1}L0/1​ Soft-Margin Loss
Huajun Wang
Yuanhai Shao
Shenglong Zhou
Ce Zhang
N. Xiu
VLM
47
52
0
16 Dec 2019
1