Image de couverture de livre

Spurious Stationarity and Hardness Results for Bregman Proximal-Type Algorithms

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Chen, He, Li, Jiajin, So, Anthony Man-Cho
Format:	Preprint
Publié:	2024
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

Nonsmooth Nonconvex-Nonconcave Minimax Optimization: Primal-Dual Balancing and Iteration Complexity Analysis
par: Li, Jiajin, et autres
Publié: (2022)

Set Smoothness Unlocks Clarke Hyper-stationarity in Bilevel Optimization
par: Chen, He, et autres
Publié: (2025)

Testing Approximate Stationarity Concepts for Piecewise Affine Functions
par: Tian, Lai, et autres
Publié: (2025)

$\ell_1$-norm rank-one symmetric matrix factorization has no spurious second-order stationary points
par: Guan, Jiewen, et autres
Publié: (2024)

On subdifferential chain rule of matrix factorization and beyond
par: Guan, Jiewen, et autres
Publié: (2024)

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

Revisiting Subgradient Method: Complexity and Convergence Beyond Lipschitz Continuity
par: Li, Xiao, et autres
Publié: (2023)

Doubly Smoothed Optimistic Gradients: A Universal Approach for Smooth Minimax Problems
par: Zheng, Taoli, et autres
Publié: (2025)

Primal-Dual Methods for Nonsmooth Nonconvex Optimization with Orthogonality Constraints
par: Zhu, Linglingzhi, et autres
Publié: (2026)

Variable Bregman Majorization-Minimization Algorithm and its Application to Dirichlet Maximum Likelihood Estimation
par: Martin, Ségolène, et autres
Publié: (2025)

Learning to Adapt: In-Context Learning Beyond Stationarity
par: Qin, Zhen, et autres
Publié: (2026)

Convergence Analysis of the Wasserstein Proximal Algorithm beyond Geodesic Convexity
par: Zhu, Shuailong, et autres
Publié: (2025)

Bregman Douglas-Rachford Splitting Method
par: Ma, Shiqian, et autres
Publié: (2025)

An inexact Bregman proximal point method and its acceleration version for unbalanced optimal transport
par: Chen, Xiang, et autres
Publié: (2024)

Lower-level Duality Based Reformulation and Majorization Minimization Algorithm for Hyperparameter Optimization
par: Chen, He, et autres
Publié: (2024)

Online Nonconvex Bilevel Optimization with Bregman Divergences
par: Bohne, Jason, et autres
Publié: (2024)

The Stochastic Proximal Distance Algorithm
par: Jiang, Haoyu, et autres
Publié: (2022)

An Inexact Bregman Proximal Difference-of-Convex Algorithm with Two Types of Relative Stopping Criteria
par: Yang, Lei, et autres
Publié: (2024)

Convergence Rate of the Last Iterate of Stochastic Proximal Algorithms
par: Vaidyan, Kevin Kurian Thomas, et autres
Publié: (2026)

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

Beyond Stationarity: Convergence Analysis of Stochastic Softmax Policy Gradient Methods
par: Klein, Sara, et autres
Publié: (2023)

An Inertial Bregman Proximal DC Algorithm for Generalized DC Programming with Application to Data Completion
par: Pan, Chenjian, et autres
Publié: (2024)

Proximal Interacting Particle Langevin Algorithms
par: Encinar, Paula Cordero, et autres
Publié: (2024)

Stability Evaluation via Distributional Perturbation Analysis
par: Blanchet, Jose, et autres
Publié: (2024)

Unifying Distributionally Robust Optimization via Optimal Transport Theory
par: Blanchet, Jose, et autres
Publié: (2023)

A Bregman firmly nonexpansive proximal operator for baryconvex optimization
par: Achab, Mastane
Publié: (2024)

The Ball-Proximal (="Broximal") Point Method: a New Algorithm, Convergence Theory, and Applications
par: Gruntkowska, Kaja, et autres
Publié: (2025)

Computing Competitive Equilibrium for Chores: Linear Convergence and Lightweight Iteration
par: Chen, He, et autres
Publié: (2024)

Accelerated Price Adjustment for Fisher Markets with Exact Recovery of Competitive Equilibrium
par: Chen, He, et autres
Publié: (2025)

Proximal Oracles for Optimization and Sampling
par: Liang, Jiaming, et autres
Publié: (2024)

LoRA Training in the NTK Regime has No Spurious Local Minima
par: Jang, Uijeong, et autres
Publié: (2024)

On the Width Scaling of Neural Optimizers Under Matrix Operator Norms I: Row/Column Normalization and Hyperparameter Transfer
par: Xu, Ruihan, et autres
Publié: (2026)

Obtaining Lower Query Complexities through Lightweight Zeroth-Order Proximal Gradient Algorithms
par: Gu, Bin, et autres
Publié: (2024)

Joint Cooperative and Non-Cooperative Localization in WSNs with Distributed Scaled Proximal ADMM Algorithms
par: Zhu, Qiaojia, et autres
Publié: (2025)

Escaping Saddle Points for Nonsmooth Weakly Convex Functions via Perturbed Proximal Algorithms
par: Huang, Minhui, et autres
Publié: (2021)

Bregman Linearized Augmented Lagrangian Method for Nonconvex Constrained Stochastic Zeroth-order Optimization
par: Shi, Qiankun, et autres
Publié: (2025)

A Learned Proximal Alternating Minimization Algorithm and Its Induced Network for a Class of Two-block Nonconvex and Nonsmooth Optimization
par: Chen, Yunmei, et autres
Publié: (2024)

Automatic Outlier Rectification via Optimal Transport
par: Blanchet, Jose, et autres
Publié: (2024)

Symmetrizing Bregman Divergence on the Cone of Positive Definite Matrices: Which Mean to Use and Why
par: Sial, Tushar, et autres
Publié: (2026)

Nonnegative Low-rank Matrix Recovery Can Have Spurious Local Minima
par: Zhang, Richard Y.
Publié: (2025)