conftrace_

smoothness condition

7 papers

Explore in graph

Co-occurring keywords · papers mentioning both

convergence rate (3) gradient descent (3) adaptive gradient algorithm (2) non-convex optimization (2) stochastic gradient descent (2) stochastic gradient oracle (1) complexity lower bound (1) nested optimization (1) auxiliary function (1) stopping time (1)

Papers

Armijo Line-search Can Make (Stochastic) Gradient Descent Provably Faster ICML 2025 Complexity Lower Bounds of Adaptive Gradient Algorithms for Non-convex Stochastic Optimization under Relaxed Smoothness ICLR 2025 Optimal Algorithms for Stochastic Bilevel Optimization under Relaxed Smoothness Conditions JMLR 2024 Parameter-Agnostic Optimization under Relaxed Smoothness AISTATS 2024 Beyond Uniform Smoothness: A Stopped Analysis of Adaptive SGD COLT 2023 Convergence of AdaGrad for Non-convex Objectives: Simple Proofs and Relaxed Assumptions COLT 2023 Why Gradient Clipping Accelerates Training: A Theoretical Justification for Adaptivity ICLR 2020