:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Authors:	Chen, He, Li, Jiajin, So, Anthony Man-Cho
Format:	Preprint
Published:	2024
Subjects:	Optimization and Control Machine Learning
Online Access:	https://arxiv.org/abs/2404.08073
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Nonsmooth Nonconvex-Nonconcave Minimax Optimization: Primal-Dual Balancing and Iteration Complexity Analysis
by: Li, Jiajin, et al.
Published: (2022)

Set Smoothness Unlocks Clarke Hyper-stationarity in Bilevel Optimization
by: Chen, He, et al.
Published: (2025)

Testing Approximate Stationarity Concepts for Piecewise Affine Functions
by: Tian, Lai, et al.
Published: (2025)

$\ell_1$-norm rank-one symmetric matrix factorization has no spurious second-order stationary points
by: Guan, Jiewen, et al.
Published: (2024)

On subdifferential chain rule of matrix factorization and beyond
by: Guan, Jiewen, et al.
Published: (2024)

Doubly Smoothed Optimistic Gradients: A Universal Approach for Smooth Minimax Problems
by: Zheng, Taoli, et al.
Published: (2025)

Revisiting Subgradient Method: Complexity and Convergence Beyond Lipschitz Continuity
by: Li, Xiao, et al.
Published: (2023)

Nonconvex Stochastic Bregman Proximal Gradient Method with Application to Deep Learning
by: Ding, Kuangyu, et al.
Published: (2023)

Primal-Dual Methods for Nonsmooth Nonconvex Optimization with Orthogonality Constraints
by: Zhu, Linglingzhi, et al.
Published: (2026)

Variable Bregman Majorization-Minimization Algorithm and its Application to Dirichlet Maximum Likelihood Estimation
by: Martin, Ségolène, et al.
Published: (2025)

Lower-level Duality Based Reformulation and Majorization Minimization Algorithm for Hyperparameter Optimization
by: Chen, He, et al.
Published: (2024)

Learning to Adapt: In-Context Learning Beyond Stationarity
by: Qin, Zhen, et al.
Published: (2026)

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

Convergence Analysis of the Wasserstein Proximal Algorithm beyond Geodesic Convexity
by: Zhu, Shuailong, et al.
Published: (2025)

An inexact Bregman proximal point method and its acceleration version for unbalanced optimal transport
by: Chen, Xiang, et al.
Published: (2024)

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

The Stochastic Proximal Distance Algorithm
by: Jiang, Haoyu, et al.
Published: (2022)

Stability Evaluation via Distributional Perturbation Analysis
by: Blanchet, Jose, et al.
Published: (2024)

Unifying Distributionally Robust Optimization via Optimal Transport Theory
by: Blanchet, Jose, et al.
Published: (2023)

Computing Competitive Equilibrium for Chores: Linear Convergence and Lightweight Iteration
by: Chen, He, et al.
Published: (2024)

Accelerated Price Adjustment for Fisher Markets with Exact Recovery of Competitive Equilibrium
by: Chen, He, et al.
Published: (2025)

Robust Sublinear Convergence Rates for Iterative Bregman Projections
by: Peyré, Gabriel
Published: (2026)

Beyond Stationarity: Convergence Analysis of Stochastic Softmax Policy Gradient Methods
by: Klein, Sara, et al.
Published: (2023)

Convergence Rate of the Last Iterate of Stochastic Proximal Algorithms
by: Vaidyan, Kevin Kurian Thomas, et al.
Published: (2026)

On the Width Scaling of Neural Optimizers Under Matrix Operator Norms I: Row/Column Normalization and Hyperparameter Transfer
by: Xu, Ruihan, et al.
Published: (2026)

Proximal Interacting Particle Langevin Algorithms
by: Encinar, Paula Cordero, 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)

An Inertial Bregman Proximal DC Algorithm for Generalized DC Programming with Application to Data Completion
by: Pan, Chenjian, et al.
Published: (2024)

A Bregman firmly nonexpansive proximal operator for baryconvex optimization
by: Achab, Mastane
Published: (2024)

The Ball-Proximal (="Broximal") Point Method: a New Algorithm, Convergence Theory, and Applications
by: Gruntkowska, Kaja, et al.
Published: (2025)

Automatic Outlier Rectification via Optimal Transport
by: Blanchet, Jose, et al.
Published: (2024)

Proximal Oracles for Optimization and Sampling
by: Liang, Jiaming, et al.
Published: (2024)

Symmetrizing Bregman Divergence on the Cone of Positive Definite Matrices: Which Mean to Use and Why
by: Sial, Tushar, et al.
Published: (2026)

LoRA Training in the NTK Regime has No Spurious Local Minima
by: Jang, Uijeong, et al.
Published: (2024)

Efficient Single-Loop Stochastic Algorithms for Nonconvex-Concave Minimax Optimization
by: Jiang, Xia, et al.
Published: (2025)

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

Discrete GCBF Proximal Policy Optimization for Multi-agent Safe Optimal Control
by: Zhang, Songyuan, et al.
Published: (2025)

Obtaining Lower Query Complexities through Lightweight Zeroth-Order Proximal Gradient Algorithms
by: Gu, Bin, et al.
Published: (2024)

Joint Cooperative and Non-Cooperative Localization in WSNs with Distributed Scaled Proximal ADMM Algorithms
by: Zhu, Qiaojia, et al.
Published: (2025)

Escaping Saddle Points for Nonsmooth Weakly Convex Functions via Perturbed Proximal Algorithms
by: Huang, Minhui, et al.
Published: (2021)