Cover Image

Nonconvex Stochastic Bregman Proximal Gradient Method with Application to Deep Learning

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Ding, Kuangyu, Li, Jingyang, Toh, Kim-Chuan
Format:	Preprint
Published:	2023
Subjects:	Optimization and Control Machine Learning
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Stochastic Bregman Subgradient Methods for Nonsmooth Nonconvex Optimization Problems
by: Ding, Kuangyu, et al.
Published: (2024)

Developing Lagrangian-based Methods for Nonsmooth Nonconvex Optimization
by: Xiao, Nachuan, et al.
Published: (2024)

Memory-Efficient 4-bit Preconditioned Stochastic Optimization
by: Li, Jingyang, et al.
Published: (2024)

On exploration of an interior mirror descent flow for stochastic nonconvex constrained problem
by: Ding, Kuangyu, et al.
Published: (2025)

Stochastic Subgradient Methods with Guaranteed Global Stability in Nonsmooth Nonconvex Optimization
by: Xiao, Nachuan, et al.
Published: (2023)

Inexact Bregman Proximal Gradient Method and its Inertial Variant with Absolute and Partial Relative Stopping Criteria
by: Yang, Lei, et al.
Published: (2021)

Optimization Hyper-parameter Laws for Large Language Models
by: Xie, Xingyu, et al.
Published: (2024)

A Bregman Proximal Stochastic Gradient Method with Extrapolation for Nonconvex Nonsmooth Problems
by: Wang, Qingsong, et al.
Published: (2024)

Bregman Linearized Augmented Lagrangian Method for Nonconvex Constrained Stochastic Zeroth-order Optimization
by: Shi, Qiankun, et al.
Published: (2025)

Compressed Decentralized Momentum Stochastic Gradient Methods for Nonconvex Optimization
by: Liu, Wei, et al.
Published: (2025)

Online Nonconvex Bilevel Optimization with Bregman Divergences
by: Bohne, Jason, et al.
Published: (2024)

An Inexact Bregman Proximal Difference-of-Convex Algorithm with Two Types of Relative Stopping Criteria
by: Yang, Lei, et al.
Published: (2024)

Learning Graph Laplacian with MCP
by: Zhang, Yangjing, et al.
Published: (2020)

Spurious Stationarity and Hardness Results for Bregman Proximal-Type Algorithms
by: Chen, He, et al.
Published: (2024)

On the Convergence of Adaptive Gradient Methods for Nonconvex Optimization
by: Zhou, Dongruo, et al.
Published: (2018)

Faster Gradient-Free Algorithms for Nonsmooth Nonconvex Stochastic Optimization
by: Chen, Lesi, et al.
Published: (2023)

Adam-family Methods for Nonsmooth Optimization with Convergence Guarantees
by: Xiao, Nachuan, et al.
Published: (2023)

On the Stochastic (Variance-Reduced) Proximal Gradient Method for Regularized Expected Reward Optimization
by: Liang, Ling, et al.
Published: (2024)

Proximal Operators of Sorted Nonconvex Penalties
by: Gagneux, Anne, et al.
Published: (2025)

Accelerated Gradient Methods for Sparse Statistical Learning with Nonconvex Penalties
by: Yang, Kai, et al.
Published: (2020)

Adaptive Lipschitz-Free Conditional Gradient Methods for Stochastic Composite Nonconvex Optimization
by: Yuan, Ganzhao
Published: (2026)

Shuffling Gradient-Based Methods for Nonconvex-Concave Minimax Optimization
by: Tran-Dinh, Quoc, et al.
Published: (2024)

Stochastic Newton Proximal Extragradient Method
by: Jiang, Ruichen, et al.
Published: (2024)

Zeroth-Order Methods for Stochastic Nonconvex Nonsmooth Composite Optimization
by: Chen, Ziyi, et al.
Published: (2025)

Projective Proximal Gradient Descent for A Class of Nonconvex Nonsmooth Optimization Problems: Fast Convergence Without Kurdyka-Lojasiewicz (KL) Property
by: Yang, Yingzhen, et al.
Published: (2023)

Fast Two-Time-Scale Stochastic Gradient Method with Applications in Reinforcement Learning
by: Zeng, Sihan, et al.
Published: (2024)

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

On Penalty Methods for Nonconvex Bilevel Optimization and First-Order Stochastic Approximation
by: Kwon, Jeongyeol, et al.
Published: (2023)

Convergence of Decentralized Stochastic Subgradient-based Methods for Nonsmooth Nonconvex functions
by: Zhang, Siyuan, et al.
Published: (2024)

Bregman Douglas-Rachford Splitting Method
by: Ma, Shiqian, et al.
Published: (2025)

Nonconvex Stochastic Optimization under Heavy-Tailed Noises: Optimal Convergence without Gradient Clipping
by: Liu, Zijian, et al.
Published: (2024)

Stochastic Bregman Proximal Gradient Method Revisited: Kernel Conditioning and Painless Variance Reduction
by: Zhang, Junyu
Published: (2024)

A Hybrid Subgradient Method for Nonsmooth Nonconvex Bilevel Optimization
by: Xiao, Nachuan, et al.
Published: (2025)

A Quadratically Convergent Alternating Projection Method for Nonconvex Sets
by: Xiao, Nachuan, et al.
Published: (2025)

LoCo: Low-Bit Communication Adaptor for Large-scale Model Training
by: Xie, Xingyu, et al.
Published: (2024)

A Regularized Newton Method for Nonconvex Optimization with Global and Local Complexity Guarantees
by: Zhou, Yuhao, et al.
Published: (2025)

Revisiting Inexact Fixed-Point Iterations for Min-Max Problems: Stochasticity and Structured Nonconvexity
by: Alacaoglu, Ahmet, et al.
Published: (2024)

Stochastic Gradient Methods with Preconditioned Updates
by: Sadiev, Abdurakhmon, et al.
Published: (2022)

On Gradient Descent Ascent for Nonconvex-Concave Minimax Problems
by: Lin, Tianyi, et al.
Published: (2019)

A Unified Theory of Stochastic Proximal Point Methods without Smoothness
by: Richtárik, Peter, et al.
Published: (2024)