Cover Image

Toward a Unified Theory of Gradient Descent under Generalized Smoothness

Fuente: arXiv

Saved in:

Bibliographic Details
Main Author:	Tyurin, Alexander
Format:	Preprint
Published:	2024
Subjects:	Optimization and Control
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Near-Optimal Convergence of Accelerated Gradient Methods under Generalized and $(L_0, L_1)$-Smoothness
by: Tyurin, Alexander
Published: (2025)

Gradient Descent as a Perceptron Algorithm: Understanding Dynamics and Implicit Acceleration
by: Tyurin, Alexander
Published: (2025)

Generalized Stochastic Gradient Descent with Momentum Methods for Smooth Optimization
by: Wang, Zimeng, et al.
Published: (2026)

Gradient Descent for Convex and Smooth Noisy Optimization
by: Hu, Feifei, et al.
Published: (2024)

Optimality in Decentralized Optimization under Bandwidth Constraints
by: Tyurin, Alexander
Published: (2026)

Decentralized Relaxed Smooth Optimization with Gradient Descent Methods
by: Jiang, Zhanhong, et al.
Published: (2025)

Linear Convergence Rate in Convex Setup is Possible! Gradient Descent Method Variants under $(L_0,L_1)$-Smoothness
by: Lobanov, Aleksandr, et al.
Published: (2024)

Tight Time Complexities in Parallel Stochastic Optimization with Arbitrary Computation Dynamics
by: Tyurin, Alexander
Published: (2024)

On the Optimal Time Complexities in Decentralized Stochastic Asynchronous Optimization
by: Tyurin, Alexander, et al.
Published: (2024)

Scalable Distributed Stochastic Optimization via Bidirectional Compression: Beyond Pessimistic Limits
by: Begunov, Grigory, et al.
Published: (2026)

Nonlinearly Preconditioned Gradient Methods under Generalized Smoothness
by: Oikonomidis, Konstantinos, et al.
Published: (2025)

High-Probability Guarantees for Random Zeroth-Order Gradient Descent on Smooth Functions
by: Ye, Haishan
Published: (2026)

Improving the Worst-Case Bidirectional Communication Complexity for Nonconvex Distributed Optimization under Function Similarity
by: Gruntkowska, Kaja, et al.
Published: (2024)

Tighter Performance Theory of FedExProx
by: Anyszka, Wojciech, et al.
Published: (2024)

Proving the Limited Scalability of Centralized Distributed Optimization via a New Lower Bound Construction
by: Tyurin, Alexander
Published: (2025)

A Computation and Communication Efficient Method for Distributed Nonconvex Problems in the Partial Participation Setting
by: Tyurin, Alexander, et al.
Published: (2022)

Local SGD and Federated Averaging Through the Lens of Time Complexity
by: Fradin, Adrien, et al.
Published: (2025)

Gradient-Variation Online Learning under Generalized Smoothness
by: Xie, Yan-Feng, et al.
Published: (2024)

Inertial Bregman Proximal Gradient under Partial Smoothness
by: Godeme, Jean-Jacques
Published: (2025)

Asynchronous Policy Gradient Aggregation for Efficient Distributed Reinforcement Learning
by: Tyurin, Alexander, et al.
Published: (2025)

Convergence of Steepest Descent and Adam under Non-Uniform Smoothness
by: Vaswani, Sharan, et al.
Published: (2026)

Natural Gradient Descent for Control
by: Esmzad, Ramin, et al.
Published: (2025)

Stochastic Smoothed Gradient Descent Ascent for Federated Minimax Optimization
by: Shen, Wei, et al.
Published: (2023)

Using Stochastic Gradient Descent to Smooth Nonconvex Functions: Analysis of Implicit Graduated Optimization
by: Sato, Naoki, et al.
Published: (2023)

A Mirror Descent Perspective of Smoothed Sign Descent
by: Wang, Shuyang, et al.
Published: (2024)

Investigating Variance Definitions for Mirror Descent with Relative Smoothness
by: Hendrikx, Hadrien
Published: (2024)

Interpretable Gradient Descent for Kalman Gain
by: Belabbas, M. A., et al.
Published: (2025)

Freya PAGE: First Optimal Time Complexity for Large-Scale Nonconvex Finite-Sum Optimization with Heterogeneous Asynchronous Computations
by: Tyurin, Alexander, et al.
Published: (2024)

Quadratic Gradient: A Unified Framework Bridging Gradient Descent and Newton-Type Methods by Synthesizing Hessians and Gradients
by: Chiang, John
Published: (2022)

The Randomized Block Coordinate Descent Method in the Hölder Smooth Setting
by: Maia, Leandro Farias, et al.
Published: (2024)

Scaling Laws for Gradient Descent and Sign Descent for Linear Bigram Models under Zipf's Law
by: Kunstner, Frederik, et al.
Published: (2025)

Faster Convergence of Stochastic Accelerated Gradient Descent under Interpolation
by: Mishkin, Aaron, et al.
Published: (2024)

Stochastic Adaptive Gradient Descent Without Descent
by: Aujol, Jean-François, et al.
Published: (2025)

Accelerated Gradient Descent by Concatenation of Stepsize Schedules
by: Zhang, Zehao, et al.
Published: (2024)

Composing Optimized Stepsize Schedules for Gradient Descent
by: Grimmer, Benjamin, et al.
Published: (2024)

Last-Iterate Convergence of Anchored Gradient Descent
by: Cai, Yang, et al.
Published: (2026)

Riemannian Inexact Gradient Descent for Quadratic Discrimination
by: Talwar, Uday, et al.
Published: (2025)

A Single-Loop Smoothed Gradient Descent-Ascent Algorithm for Nonconvex-Concave Min-Max Problems
by: Zhang, Jiawei, et al.
Published: (2020)

Local Curvature Descent: Squeezing More Curvature out of Standard and Polyak Gradient Descent
by: Richtárik, Peter, et al.
Published: (2024)

Anytime Acceleration of Gradient Descent
by: Zhang, Zihan, et al.
Published: (2024)