Image de couverture de livre

Escaping Saddle Points for Nonsmooth Weakly Convex Functions via Perturbed Proximal Algorithms

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Huang, Minhui, Zhu, Weiming
Format:	Preprint
Publié:	2021
Sujets:	Machine Learning Optimization and Control
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Hessian-guided Perturbed Wasserstein Gradient Flows for Escaping Saddle Points
par: Yamamoto, Naoya, et autres
Publié: (2025)

Proximal Point Method for Online Saddle Point Problem
par: Meng, Qing-xin, et autres
Publié: (2024)

Efficiently Escaping Saddle Points under Generalized Smoothness via Self-Bounding Regularity
par: Cao, Daniel Yiming, et autres
Publié: (2025)

Efficiently Escaping Saddle Points for Policy Optimization
par: Khorasani, Sadegh, et autres
Publié: (2023)

On Linear Convergence in Smooth Convex-Concave Bilinearly-Coupled Saddle-Point Optimization: Lower Bounds and Optimal Algorithms
par: Kovalev, Dmitry, et autres
Publié: (2024)

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

Inertial Newton Algorithms Avoiding Strict Saddle Points
par: Castera, Camille
Publié: (2021)

Single-Loop Stochastic Algorithms for Difference of Max-Structured Weakly Convex Functions
par: Hu, Quanqi, et autres
Publié: (2024)

Simultaneous Learning and Optimization via Misspecified Saddle Point Problems
par: Ahmadi, Mohammad Mahdi, et autres
Publié: (2025)

Federated Composite Saddle Point Optimization
par: Bai, Site, et autres
Publié: (2023)

A Proximal Modified Quasi-Newton Method for Nonsmooth Regularized Optimization
par: Diouane, Youssef, et autres
Publié: (2024)

Quantization Avoids Saddle Points in Distributed Optimization
par: Bo, Yanan, et autres
Publié: (2024)

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)

Improved Last-Iterate Convergence of Shuffling Gradient Methods for Nonsmooth Convex Optimization
par: Liu, Zijian, et autres
Publié: (2025)

Convergence Analysis of the PAGE Stochastic Algorithm for Weakly Convex Finite-Sum Optimization
par: Condat, Laurent, et autres
Publié: (2025)

Private Algorithms for Stochastic Saddle Points and Variational Inequalities: Beyond Euclidean Geometry
par: Bassily, Raef, et autres
Publié: (2024)

Damped Proximal Augmented Lagrangian Method for weakly-Convex Problems with Convex Constraints
par: Dahal, Hari, et autres
Publié: (2023)

Stochastic Weakly Convex Optimization Under Heavy-Tailed Noises
par: Zhu, Tianxi, et autres
Publié: (2025)

Linearly Convergent Algorithms for Nonsmooth Problems with Unknown Smooth Pieces
par: Zhang, Zhe, et autres
Publié: (2025)

Faster Gradient-Free Algorithms for Nonsmooth Nonconvex Stochastic Optimization
par: Chen, Lesi, et autres
Publié: (2023)

Clipped Gradient Methods for Nonsmooth Convex Optimization under Heavy-Tailed Noise: A Refined Analysis
par: Liu, Zijian
Publié: (2025)

Exploring New Frontiers in Vertical Federated Learning: the Role of Saddle Point Reformulation
par: Beznosikov, Aleksandr, et autres
Publié: (2026)

Online Min-Max Optimization: From Individual Regrets to Cumulative Saddle Points
par: Vyas, Abhijeet, et autres
Publié: (2026)

Curvature-Adaptive Perturbation and Subspace Descent for Robust Saddle Point Escape in High-Dimensional Optimization
par: Katende, Ronald, et autres
Publié: (2024)

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

Functionally Constrained Algorithm Solves Convex Simple Bilevel Problems
par: Zhang, Huaqing, et autres
Publié: (2024)

A Proximal Variable Smoothing for Nonsmooth Minimization Involving Weakly Convex Composite with MIMO Application
par: Kume, Keita, et autres
Publié: (2024)

Enhancing Stability of Physics-Informed Neural Network Training Through Saddle-Point Reformulation
par: Bylinkin, Dmitry, et autres
Publié: (2025)

An Algorithm with Optimal Dimension-Dependence for Zero-Order Nonsmooth Nonconvex Stochastic Optimization
par: Kornowski, Guy, et autres
Publié: (2023)

Mirror Descent Algorithms with Nearly Dimension-Independent Rates for Differentially-Private Stochastic Saddle-Point Problems
par: González, Tomás, et autres
Publié: (2024)

From Saddle Points Toward Global Minima: A Newton-Type Method on Wasserstein Space
par: Lascu, Razvan-Andrei, et autres
Publié: (2026)

Projective Proximal Gradient Descent for A Class of Nonconvex Nonsmooth Optimization Problems: Fast Convergence Without Kurdyka-Lojasiewicz (KL) Property
par: Yang, Yingzhen, et autres
Publié: (2023)

Zeroth-Order Methods for Stochastic Nonconvex Nonsmooth Composite Optimization
par: Chen, Ziyi, et autres
Publié: (2025)

Stochastic Weakly Convex Optimization Beyond Lipschitz Continuity
par: Gao, Wenzhi, et autres
Publié: (2024)

Compressed Proximal Federated Learning for Non-Convex Composite Optimization on Heterogeneous Data
par: Qiu, Pu, et autres
Publié: (2026)

Stabilized Proximal-Point Methods for Federated Optimization
par: Jiang, Xiaowen, et autres
Publié: (2024)

Deterministic Nonsmooth Nonconvex Optimization
par: Jordan, Michael I., et autres
Publié: (2023)

The ADMM-PINNs Algorithmic Framework for Nonsmooth PDE-Constrained Optimization: A Deep Learning Approach
par: Song, Yongcun, et autres
Publié: (2023)

Distributed Saddle-Point Problems: Lower Bounds, Near-Optimal and Robust Algorithms
par: Beznosikov, Aleksandr, et autres
Publié: (2020)

Variance Reduction and Low Sample Complexity in Stochastic Optimization via Proximal Point Method
par: Liang, Jiaming
Publié: (2024)