ResearchTrend.AI
  • Communities
  • Connect sessions
  • AI calendar
  • Organizations
  • Join Slack
  • Contact Sales
Papers
Communities
Social Events
Terms and Conditions
Pricing
Contact Sales
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2026 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 2002.11962
  4. Cited By
Can We Find Near-Approximately-Stationary Points of Nonsmooth Nonconvex
  Functions?
v1v2v3 (latest)

Can We Find Near-Approximately-Stationary Points of Nonsmooth Nonconvex Functions?

27 February 2020
Ohad Shamir
ArXiv (abs)PDFHTML

Papers citing "Can We Find Near-Approximately-Stationary Points of Nonsmooth Nonconvex Functions?"

6 / 6 papers shown
Differentially Private Domain Adaptation with Theoretical Guarantees
Differentially Private Domain Adaptation with Theoretical GuaranteesInternational Conference on Machine Learning (ICML), 2023
Raef Bassily
Corinna Cortes
Anqi Mao
M. Mohri
319
0
0
15 Jun 2023
Oracle Complexity of Single-Loop Switching Subgradient Methods for
  Non-Smooth Weakly Convex Functional Constrained Optimization
Oracle Complexity of Single-Loop Switching Subgradient Methods for Non-Smooth Weakly Convex Functional Constrained OptimizationNeural Information Processing Systems (NeurIPS), 2023
Yan Huang
Qihang Lin
430
16
0
30 Jan 2023
Global Convergence of Direct Policy Search for State-Feedback
  $\mathcal{H}_\infty$ Robust Control: A Revisit of Nonsmooth Synthesis with
  Goldstein Subdifferential
Global Convergence of Direct Policy Search for State-Feedback H∞\mathcal{H}_\inftyH∞​ Robust Control: A Revisit of Nonsmooth Synthesis with Goldstein SubdifferentialNeural Information Processing Systems (NeurIPS), 2022
Xing-ming Guo
Bin Hu
247
16
0
20 Oct 2022
A Stochastic Proximal Method for Nonsmooth Regularized Finite Sum
  Optimization
A Stochastic Proximal Method for Nonsmooth Regularized Finite Sum Optimization
Dounia Lakhmiri
D. Orban
Andrea Lodi
174
0
0
14 Jun 2022
Projection Robust Wasserstein Distance and Riemannian Optimization
Projection Robust Wasserstein Distance and Riemannian OptimizationNeural Information Processing Systems (NeurIPS), 2020
Tianyi Lin
Chenyou Fan
Nhat Ho
Marco Cuturi
Sai Li
750
79
0
12 Jun 2020
Complexity of Finding Stationary Points of Nonsmooth Nonconvex Functions
Complexity of Finding Stationary Points of Nonsmooth Nonconvex Functions
J.N. Zhang
Hongzhou Lin
Stefanie Jegelka
Ali Jadbabaie
S. Sra
393
46
0
10 Feb 2020
1
Page 1 of 1