Cover Image

Taming Nonconvex Stochastic Mirror Descent with General Bregman Divergence

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Fatkhullin, Ilyas, He, Niao
Format:	Preprint
Published:	2024
Subjects:	Optimization and Control Machine Learning 90C15, 90C26, 90C15 G.1.6
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Natural Gradient VI: Guarantees for Non-Conjugate Models
by: Sun, Fangyuan, et al.
Published: (2025)

Global Optimality for Constrained Exploration via Penalty Regularization
by: Wolf, Florian, et al.
Published: (2026)

Stochastic Optimization under Hidden Convexity
by: Fatkhullin, Ilyas, et al.
Published: (2023)

Adaptive Stochastic Gradient Descent Ascent Algorithm for Nonconvex Minimax Problems with Decision-Dependent Distributions
by: Gao, Yan, et al.
Published: (2025)

Shuffling the Stochastic Mirror Descent via Dual Lipschitz Continuity and Kernel Conditioning
by: Qiu, Junwen, et al.
Published: (2026)

Zeroth-Order Methods for Nonconvex Stochastic Problems with Decision-Dependent Distributions
by: Hikima, Yuya, et al.
Published: (2024)

Global Solutions to Non-Convex Functional Constrained Problems with Hidden Convexity
by: Fatkhullin, Ilyas, et al.
Published: (2025)

Stochastic convergence of parallel asynchronous adaptive first-order methods
by: Gratton, Serge, et al.
Published: (2026)

Adaptive Conditional Forest Sampling for Spectral Risk Optimisation under Decision-Dependent Uncertainty
by: Kurbucz, Marcell T.
Published: (2026)

Stochastic Gradient Descent Revisited
by: Louzi, Azar
Published: (2024)

Stochastic First-Order Methods with Non-smooth and Non-Euclidean Proximal Terms for Nonconvex High-Dimensional Stochastic Optimization
by: Xie, Yue, et al.
Published: (2024)

A New Random Reshuffling Method for Nonsmooth Nonconvex Finite-sum Optimization
by: Qiu, Junwen, et al.
Published: (2023)

A Structured Proximal Stochastic Variance Reduced Zeroth-order Algorithm
by: Rando, Marco, et al.
Published: (2025)

Boosted Stochastic Frank-Wolfe for Constrained Nonconvex Optimization
by: Nandhan, Navil, et al.
Published: (2026)

A unified convergence theory for adaptive first-order methods in the nonconvex case, including AdaNorm, full and diagonal AdaGrad, Shampoo and Muo
by: Gratton, S., et al.
Published: (2026)

Complexity of Adagrad and other first-order methods for nonconvex optimization problems with bounds constraints
by: Gratton, Serge, et al.
Published: (2024)

Complexity and performance for two classes of noise-tolerant first-order algorithms
by: Gratton, S., et al.
Published: (2022)

On Tackling High-Dimensional Nonconvex Stochastic Optimization via Stochastic First-Order Methods with Non-smooth Proximal Terms and Variance Reduction
by: Xie, Yue, et al.
Published: (2025)

Extended Triangle Inequalities for Nonconvex Box-Constrained Quadratic Programming
by: Anstreicher, Kurt M., et al.
Published: (2025)

A Normal Map-Based Proximal Stochastic Gradient Method: Convergence and Identification Properties
by: Qiu, Junwen, et al.
Published: (2023)

Random Reshuffling with Momentum for Nonconvex Problems: Iteration Complexity and Last Iterate Convergence
by: Qiu, Junwen, et al.
Published: (2024)

Optimization without Retraction on the Random Generalized Stiefel Manifold
by: Vary, Simon, et al.
Published: (2024)

MoSSP: A Momentum-Based Single-Loop Stochastic Penalty Method for Nonconvex Constrained DC-Regularized Optimization
by: Li, Luxuan, et al.
Published: (2026)

An Algebraically Converging Stochastic Gradient Descent Algorithm for Global Optimization
by: Engquist, Björn, et al.
Published: (2022)

A Structured Tour of Optimization with Finite Differences
by: Rando, Marco, et al.
Published: (2025)

OPM, a collection of Optimization Problems in Matlab
by: Gratton, Serge, et al.
Published: (2021)

A reliability-aware randomized simheuristic for the stochastic team orienteering problem
by: Circelli, Michele
Published: (2026)

A Generalized Version of Chung's Lemma and its Applications
by: Jiang, Li, et al.
Published: (2024)

A cutting plane algorithm for globally solving low dimensional k-means clustering problems
by: Ryner, Martin, et al.
Published: (2024)

High Probability Guarantees for Random Reshuffling
by: Yu, Hengxu, et al.
Published: (2023)

$\texttt{skwdro}$: a library for Wasserstein distributionally robust machine learning
by: Vincent, Florian, et al.
Published: (2024)

A Stochastic Quasi-Newton Method in the Absence of Common Random Numbers
by: Menickelly, Matt, et al.
Published: (2023)

Quadratic Programming over Linearly Ordered Fields: Decidability and Attainment of Optimal Solutions
by: Plutenko, Dmytro O.
Published: (2026)

Alternating Iteratively Reweighted $\ell_1$ and Subspace Newton Algorithms for Nonconvex Sparse Optimization
by: Wang, Hao, et al.
Published: (2024)

Convex Mixed-Integer Nonlinear Programs Derived from Generalized Disjunctive Programming using Cones
by: Neira, David E. Bernal, et al.
Published: (2021)

Anisotropic Gaussian Smoothing for Gradient-based Optimization
by: Starnes, Andrew, et al.
Published: (2024)

Adaptive Methods for Multiobjective Unit Commitment
by: Tevruez, Ece, et al.
Published: (2025)

Last-iterate Convergence of ADMM on Multi-affine Quadratic Equality Constrained Problem
by: Chao, Yutong, et al.
Published: (2026)

Zeroth-order gradient estimators for stochastic problems with decision-dependent distributions
by: Hikima, Yuya, et al.
Published: (2025)

A Unifying Convexification Framework for Chance-Constrained Programs via Bilinear Extended Formulations over a Simplex
by: Davarnia, Danial, et al.
Published: (2025)