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. 2402.02569
  4. Cited By
On the Complexity of Finite-Sum Smooth Optimization under the
  Polyak-Łojasiewicz Condition

On the Complexity of Finite-Sum Smooth Optimization under the Polyak-Łojasiewicz Condition

4 February 2024
Yunyan Bai
Yuxing Liu
Luo Luo
ArXivPDFHTML

Papers citing "On the Complexity of Finite-Sum Smooth Optimization under the Polyak-Łojasiewicz Condition"

3 / 3 papers shown
Title
GradSkip: Communication-Accelerated Local Gradient Methods with Better
  Computational Complexity
GradSkip: Communication-Accelerated Local Gradient Methods with Better Computational Complexity
A. Maranjyan
M. Safaryan
Peter Richtárik
32
13
0
28 Oct 2022
On the Complexity of Decentralized Smooth Nonconvex Finite-Sum Optimization
On the Complexity of Decentralized Smooth Nonconvex Finite-Sum Optimization
Luo Luo
Yunyan Bai
Lesi Chen
Yuxing Liu
Haishan Ye
21
8
0
25 Oct 2022
Linear Convergence of Gradient and Proximal-Gradient Methods Under the
  Polyak-Łojasiewicz Condition
Linear Convergence of Gradient and Proximal-Gradient Methods Under the Polyak-Łojasiewicz Condition
Hamed Karimi
J. Nutini
Mark W. Schmidt
119
1,198
0
16 Aug 2016
1