Imagen de Portada

New Lower Bounds for Stochastic Non-Convex Optimization through Divergence Decomposition

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Saad, El Mehdi, Lee, Wei-Cheng, Orabona, Francesco
Formato:	Preprint
Publicado:	2025
Materias:	Machine Learning Optimization and Control
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

A Finite-Time Analysis of TD Learning with Linear Function Approximation without Projections or Strong Convexity
por: Lee, Wei-Cheng, et al.
Publicado: (2025)

Optimal Stochastic Non-smooth Non-convex Optimization through Online-to-Non-convex Conversion
por: Cutkosky, Ashok, et al.
Publicado: (2023)

A Note on How to Remove the $\ln\ln T$ Term from the Squint Bound
por: Orabona, Francesco
Publicado: (2026)

A Best-of-Both-Worlds Proof for Tsallis-INF without Fenchel Conjugates
por: Lee, Wei-Cheng, et al.
Publicado: (2025)

Dual Averaging Converges for Nonconvex Smooth Stochastic Optimization
por: Liu, Tuo, et al.
Publicado: (2025)

ATA: Adaptive Task Allocation for Efficient Resource Management in Distributed Machine Learning
por: Maranjyan, Artavazd, et al.
Publicado: (2025)

A Modern Introduction to Online Learning
por: Orabona, Francesco
Publicado: (2019)

Provable Complexity Improvement of AdaGrad over SGD: Upper and Lower Bounds in Stochastic Non-Convex Optimization
por: Jiang, Ruichen, et al.
Publicado: (2024)

New Perspectives on the Polyak Stepsize: Surrogate Functions and Negative Results
por: Orabona, Francesco, et al.
Publicado: (2025)

Stochastic Difference-of-Convex Optimization with Momentum
por: Chayti, El Mahdi, et al.
Publicado: (2025)

An Equivalence Between Static and Dynamic Regret Minimization
por: Jacobsen, Andrew, et al.
Publicado: (2024)

Lower Bounds and Optimal Algorithms for Non-Smooth Convex Decentralized Optimization over Time-Varying Networks
por: Kovalev, Dmitry, et al.
Publicado: (2024)

Achieving Better Local Regret Bound for Online Non-Convex Bilevel Optimization
por: Jia, Tingkai, et al.
Publicado: (2026)

Online Non-Stationary Stochastic Quasar-Convex Optimization
por: Pun, Yuen-Man, et al.
Publicado: (2024)

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

Lower Bounds and Proximally Anchored SGD for Non-Convex Minimization Under Unbounded Variance
por: Fazla, Arda, et al.
Publicado: (2026)

Complexity Lower Bounds of Adaptive Gradient Algorithms for Non-convex Stochastic Optimization under Relaxed Smoothness
por: Crawshaw, Michael, et al.
Publicado: (2025)

Lower Complexity Bounds for Nonconvex-Strongly-Convex Bilevel Optimization with First-Order Oracles
por: Ji, Kaiyi
Publicado: (2025)

Bayesian Optimization for Non-Convex Two-Stage Stochastic Optimization Problems
por: Buckingham, Jack M., et al.
Publicado: (2024)

The Price of Adaptivity in Stochastic Convex Optimization
por: Carmon, Yair, et al.
Publicado: (2024)

On Linear Convergence in Smooth Convex-Concave Bilinearly-Coupled Saddle-Point Optimization: Lower Bounds and Optimal Algorithms
por: Kovalev, Dmitry, et al.
Publicado: (2024)

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

Optimal Rates for Robust Stochastic Convex Optimization
por: Gao, Changyu, et al.
Publicado: (2024)

Bilevel Optimization with Lower-Level Uniform Convexity: Theory and Algorithm
por: Wu, Yuman, et al.
Publicado: (2026)

Tight Lower Bounds under Asymmetric High-Order Hölder Smoothness and Uniform Convexity
por: Bai, Cedar Site, et al.
Publicado: (2024)

Tight Bounds for Online Convex Optimization with Adversarial Constraints
por: Sinha, Abhishek, et al.
Publicado: (2024)

Non-Asymptotic Optimization and Generalization Bounds for Stochastic Gauss-Newton in Overparameterized Models
por: Cayci, Semih
Publicado: (2025)

Beyond the Ideal: Analyzing the Inexact Muon Update
por: Shulgin, Egor, et al.
Publicado: (2025)

The Sample Complexity of Parameter-Free Stochastic Convex Optimization
por: Lawrence, Jared, et al.
Publicado: (2025)

Stochastic Weakly Convex Optimization Beyond Lipschitz Continuity
por: Gao, Wenzhi, et al.
Publicado: (2024)

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

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

Single Point-Based Distributed Zeroth-Order Optimization with a Non-Convex Stochastic Objective Function
por: Mhanna, Elissa, et al.
Publicado: (2024)

Stochastic Optimization with Random Search
por: Chayti, El Mahdi, et al.
Publicado: (2025)

High Probability Complexity Bounds for Non-Smooth Stochastic Optimization with Heavy-Tailed Noise
por: Gorbunov, Eduard, et al.
Publicado: (2021)

Universal Online Convex Optimization Meets Second-order Bounds
por: Zhang, Lijun, et al.
Publicado: (2021)

Stochastic Weakly Convex Optimization Under Heavy-Tailed Noises
por: Zhu, Tianxi, et al.
Publicado: (2025)

Accelerated Rates between Stochastic and Adversarial Online Convex Optimization
por: Sachs, Sarah, et al.
Publicado: (2023)

Decentralized Non-convex Stochastic Optimization with Heterogeneous Variance
por: Chen, Hongxu, et al.
Publicado: (2026)

A Stochastic Quasi-Newton Method for Non-convex Optimization with Non-uniform Smoothness
por: Sun, Zhenyu, et al.
Publicado: (2024)