Cover Image

Gradient Descent for Convex and Smooth Noisy Optimization

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Hu, Feifei, Gerber, Mathieu
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

Adaptive Accelerated Gradient Descent Methods for Convex Optimization
by: Xu, Zeyi, et al.
Published: (2026)

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

Adaptive Accelerated Gradient Method for Smooth Convex Optimization
by: Wang, Zepeng, et al.
Published: (2025)

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

The Sample Complexity of Gradient Descent in Stochastic Convex Optimization
by: Livni, Roi
Published: (2024)

Perturbed Gradient Descent via Convex Quadratic Approximation for Nonconvex Bilevel Optimization
by: Abolfazli, Nazanin, et al.
Published: (2025)

A New Inexact Gradient Descent Method with Applications to Nonsmooth Convex Optimization
by: Khanh, Pham Duy, et al.
Published: (2023)

Stochastic Non-Smooth Convex Optimization with Unbounded Gradients
by: Kovalev, Dmitry
Published: (2026)

Convergence Analysis of Noisy Distributed Gradient Descent for Non-convex Optimization -- Saddle Point Escape
by: Qin, Lei, 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)

An Accelerated Gradient Method for Convex Smooth Simple Bilevel Optimization
by: Cao, Jincheng, et al.
Published: (2024)

Rapid Overfitting of Multi-Pass Stochastic Gradient Descent in Stochastic Convex Optimization
by: Vansover-Hager, Shira, et al.
Published: (2025)

Fast and Accurate Estimation of Low-Rank Matrices from Noisy Measurements via Preconditioned Non-Convex Gradient Descent
by: Zhang, Gavin, et al.
Published: (2023)

Toward a Unified Theory of Gradient Descent under Generalized Smoothness
by: Tyurin, Alexander
Published: (2024)

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

More Optimal Fractional-Order Stochastic Gradient Descent for Non-Convex Optimization Problems
by: Partohaghighi, Mohammad, et al.
Published: (2025)

Effective Dimension Aware Fractional-Order Stochastic Gradient Descent for Convex Optimization Problems
by: Partohaghighi, Mohammad, et al.
Published: (2025)

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

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

A Proximal Descent Method for Minimizing Weakly Convex Optimization
by: Liao, Feng-Yi, et al.
Published: (2025)

Det-CGD: Compressed Gradient Descent with Matrix Stepsizes for Non-Convex Optimization
by: Li, Hanmin, et al.
Published: (2023)

Revisiting Stochastic Gradient Descent for Strongly Convex Objectives: Tight Uniform-in-Time Bounds
by: Chen, Kang, et al.
Published: (2025)

A Smooth Approximation Framework for Weakly Convex Optimization
by: Deng, Qi, et al.
Published: (2025)

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

Noisy Pairwise-Comparison Random Search for Smooth Nonconvex Optimization
by: Bakkali, Taha El, et al.
Published: (2026)

On Convergence of Incremental Gradient for Non-Convex Smooth Functions
by: Koloskova, Anastasia, et al.
Published: (2023)

Convex Synthesis of First-Order Methods for Time-Varying Smooth Strongly Convex Optimization
by: Van Scoy, Bryan, et al.
Published: (2026)

Lipschitz-Free Mirror Descent Methods for Non-Smooth Optimization Problems
by: Yuan, Bowen, et al.
Published: (2025)

Tight Analysis of Difference-of-Convex Algorithm (DCA) Improves Convergence Rates for Proximal Gradient Descent
by: Rotaru, Teodor, et al.
Published: (2025)

Smooth Quasar-Convex Optimization with Constraints
by: Martínez-Rubio, David
Published: (2025)

Accelerated Distance-adaptive Methods for Hölder Smooth and Convex Optimization
by: Ren, Yijin, et al.
Published: (2025)

A Proximal Method for Composite Optimization with Smooth and Convex Components
by: Uzun, Samet, et al.
Published: (2025)

Projected Gradient Descent for Constrained Decision-Dependent Optimization
by: Wang, Zifan, et al.
Published: (2025)

Distributed Stochastic Optimization for Non-Smooth and Weakly Convex Problems under Heavy-Tailed Noise
by: Hu, Jun, et al.
Published: (2025)

Universal Gradient Methods for Stochastic Convex Optimization
by: Rodomanov, Anton, et al.
Published: (2024)

Solving Convex Smooth Function Constrained Optimization Is Almost As Easy As Unconstrained Optimization
by: Zhang, Zhe, et al.
Published: (2022)

A Gradient Sampling Algorithm for Noisy Nonsmooth Optimization
by: Berahas, Albert S., et al.
Published: (2026)

Stochastic Decentralized Optimization of Non-Smooth Convex and Convex-Concave Problems over Time-Varying Networks
by: Divilkovskiy, Maxim, et al.
Published: (2025)

Prediction-Correction Algorithm for Time-Varying Smooth Non-Convex Optimization
by: Iwakiri, Hidenori, et al.
Published: (2024)

Stochastic Non-Smooth Non-Convex Optimization with Decision-Dependent Distributions
by: Liu, Chengchang, et al.
Published: (2026)