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

Documenti analoghi

• On the Complexity of Decentralized Smooth Nonconvex Finite-Sum Optimization
  di: Luo, Luo, et al.
  Pubblicazione: (2022)
• Faster Stochastic Algorithms for Minimax Optimization under Polyak--Łojasiewicz Conditions
  di: Chen, Lesi, et al.
  Pubblicazione: (2023)
• High-Probability Bounds for SGD under the Polyak-Lojasiewicz Condition with Markovian Noise
  di: Kar, Avik, et al.
  Pubblicazione: (2026)
• A Local Polyak-Lojasiewicz and Descent Lemma of Gradient Descent For Overparametrized Linear Models
  di: Xu, Ziqing, et al.
  Pubblicazione: (2025)
• AdaGrad under Anisotropic Smoothness
  di: Liu, Yuxing, et al.
  Pubblicazione: (2024)