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. 2009.13016
  4. Cited By
Escaping Saddle-Points Faster under Interpolation-like Conditions

Escaping Saddle-Points Faster under Interpolation-like Conditions

28 September 2020
Abhishek Roy
Krishnakumar Balasubramanian
Saeed Ghadimi
P. Mohapatra
ArXivPDFHTML

Papers citing "Escaping Saddle-Points Faster under Interpolation-like Conditions"

2 / 2 papers shown
Title
Zeroth-Order Algorithms for Nonconvex Minimax Problems with Improved
  Complexities
Zeroth-Order Algorithms for Nonconvex Minimax Problems with Improved Complexities
Zhongruo Wang
Krishnakumar Balasubramanian
Shiqian Ma
Meisam Razaviyayn
21
25
0
22 Jan 2020
First-order Methods Almost Always Avoid Saddle Points
First-order Methods Almost Always Avoid Saddle Points
J. Lee
Ioannis Panageas
Georgios Piliouras
Max Simchowitz
Michael I. Jordan
Benjamin Recht
ODL
95
83
0
20 Oct 2017
1