Image de couverture de livre

On exploration of an interior mirror descent flow for stochastic nonconvex constrained problem

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Ding, Kuangyu, Toh, Kim-Chuan
Format:	Preprint
Publié:	2025
Sujets:	Optimization and Control Machine Learning
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Nonconvex Stochastic Bregman Proximal Gradient Method with Application to Deep Learning
par: Ding, Kuangyu, et autres
Publié: (2023)

Developing Lagrangian-based Methods for Nonsmooth Nonconvex Optimization
par: Xiao, Nachuan, et autres
Publié: (2024)

Optimization Hyper-parameter Laws for Large Language Models
par: Xie, Xingyu, et autres
Publié: (2024)

An accelerated first-order regularized momentum descent ascent algorithm for stochastic nonconvex-concave minimax problems
par: Zhang, Huiling, et autres
Publié: (2023)

Stochastic Bregman Subgradient Methods for Nonsmooth Nonconvex Optimization Problems
par: Ding, Kuangyu, et autres
Publié: (2024)

Memory-Efficient 4-bit Preconditioned Stochastic Optimization
par: Li, Jingyang, et autres
Publié: (2024)

Learning mirror maps in policy mirror descent
par: Alfano, Carlo, et autres
Publié: (2024)

On the efficient computation of proximal operators of affine-constrained nonconvex functions
par: Hou, Di, et autres
Publié: (2026)

Manifold constrained steepest descent
par: Yang, Kaiwei, et autres
Publié: (2026)

The inexact power augmented Lagrangian method for constrained nonconvex optimization
par: Bodard, Alexander, et autres
Publié: (2024)

Block majorization-minimization with diminishing radius for constrained nonsmooth nonconvex optimization
par: Lyu, Hanbaek, et autres
Publié: (2020)

Learning Graph Laplacian with MCP
par: Zhang, Yangjing, et autres
Publié: (2020)

Global minimisation of nonconvex functions by generalising the mirror descent method
par: Millán, Reinier Díaz, et autres
Publié: (2024)

Mirror descent for constrained stochastic control problems
par: Sethi, Deven, et autres
Publié: (2025)

A stochastic smoothing framework for nonconvex-nonconcave min-sum-max problems with applications to Wasserstein distributionally robust optimization
par: Liu, Wei, et autres
Publié: (2025)

Newton-CG methods for nonconvex unconstrained optimization with Hölder continuous Hessian
par: He, Chuan, et autres
Publié: (2023)

Long-time dynamics and universality of nonconvex gradient descent
par: Han, Qiyang
Publié: (2025)

Avoiding strict saddle points of nonconvex regularized problems
par: Bai, Luwei, et autres
Publié: (2024)

New logarithmic step size for stochastic gradient descent
par: Shamaee, M. Soheil, et autres
Publié: (2024)

Adam-family Methods for Nonsmooth Optimization with Convergence Guarantees
par: Xiao, Nachuan, et autres
Publié: (2023)

LoCo: Low-Bit Communication Adaptor for Large-scale Model Training
par: Xie, Xingyu, et autres
Publié: (2024)

Accelerating nuclear-norm regularized low-rank matrix optimization through Burer-Monteiro decomposition
par: Lee, Ching-pei, et autres
Publié: (2022)

A single-loop SPIDER-type stochastic subgradient method for expectation-constrained nonconvex nonsmooth optimization
par: Liu, Wei, et autres
Publié: (2025)

Projected gradient methods for nonconvex and stochastic smooth optimization: new complexities and auto-conditioned stepsizes
par: Lan, Guanghui, et autres
Publié: (2024)

Stochastic Subgradient Methods with Guaranteed Global Stability in Nonsmooth Nonconvex Optimization
par: Xiao, Nachuan, et autres
Publié: (2023)

A safe exploration approach to constrained Markov decision processes
par: Ni, Tingting, et autres
Publié: (2023)

Convergence of continuous-time stochastic gradient descent with applications to deep neural networks
par: Lugosi, Gabor, et autres
Publié: (2024)

A stochastic gradient descent algorithm with random search directions
par: Gbaguidi, Eméric
Publié: (2025)

General framework for online-to-nonconvex conversion: Schedule-free SGD is also effective for nonconvex optimization
par: Ahn, Kwangjun, et autres
Publié: (2024)

Convergence of stochastic gradient descent under a local Lojasiewicz condition for deep neural networks
par: An, Jing, et autres
Publié: (2023)

On the B-subdifferential of proximal operators of affine-constrained $\ell_1$ regularizer
par: Li, Xudong, et autres
Publié: (2025)

Non-convergence to global minimizers for Adam and stochastic gradient descent optimization and constructions of local minimizers in the training of artificial neural networks
par: Jentzen, Arnulf, et autres
Publié: (2024)

Adam with model exponential moving average is effective for nonconvex optimization
par: Ahn, Kwangjun, et autres
Publié: (2024)

A randomized algorithm for nonconvex minimization with inexact evaluations and complexity guarantees
par: Li, Shuyao, et autres
Publié: (2023)

Tractable hierarchies of convex relaxations for polynomial optimization on the nonnegative orthant
par: Mai, Ngoc Hoang Anh, et autres
Publié: (2022)

Flattened one-bit stochastic gradient descent: compressed distributed optimization with controlled variance
par: Stollenwerk, Alexander, et autres
Publié: (2024)

Convergence of SGD with momentum in the nonconvex case: A time window-based analysis
par: Qiu, Junwen, et autres
Publié: (2024)

Alignment of large language models with constrained learning
par: Zhang, Botong, et autres
Publié: (2025)

Riemannian coordinate descent algorithms on matrix manifolds
par: Han, Andi, et autres
Publié: (2024)

Learning solutions to some toy constrained optimization problems in infinite dimensional Hilbert spaces
par: Mandal, Pinak
Publié: (2024)