Image de couverture de livre

Linearly Convergent Algorithms for Nonsmooth Problems with Unknown Smooth Pieces

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Zhang, Zhe, Sra, Suvrit
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

First-Order Methods for Linearly Constrained Bilevel Optimization
par: Kornowski, Guy, et autres
Publié: (2024)

Toward generalizable learning of all (linear) first-order methods via memory augmented Transformers
par: Dutta, Sanchayan, et autres
Publié: (2024)

Cost-Driven Representation Learning for Linear Quadratic Gaussian Control: Part I
par: Tian, Yi, et autres
Publié: (2022)

Cost-Driven Representation Learning for Linear Quadratic Gaussian Control: Part II
par: Tian, Yi, et autres
Publié: (2026)

Implicit Bias in Matrix Factorization and its Explicit Realization in a New Architecture
par: Hou, Yikun, et autres
Publié: (2025)

How to escape sharp minima with random perturbations
par: Ahn, Kwangjun, et autres
Publié: (2023)

Riemannian Bilevel Optimization
par: Dutta, Sanchayan, et autres
Publié: (2024)

Tight Generalization Bounds for Noiseless Inverse Optimization
par: Fatemi, Pouria, et autres
Publié: (2026)

Linear attention is (maybe) all you need (to understand transformer optimization)
par: Ahn, Kwangjun, et autres
Publié: (2023)

Revisiting Frank-Wolfe for Structured Nonconvex Optimization
par: Maskan, Hoomaan, et autres
Publié: (2025)

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

Nonsmooth Implicit Differentiation: Deterministic and Stochastic Convergence Rates
par: Grazzi, Riccardo, et autres
Publié: (2024)

Convergence of Decentralized Stochastic Subgradient-based Methods for Nonsmooth Nonconvex functions
par: Zhang, Siyuan, et autres
Publié: (2024)

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

Anderson Acceleration in Nonsmooth Problems: Local Convergence via Active Manifold Identification
par: Li, Kexin, et autres
Publié: (2024)

Adaptive Matrix Online Learning through Smoothing with Guarantees for Nonsmooth Nonconvex Optimization
par: Jiang, Ruichen, et autres
Publié: (2026)

On the Convergence of Adam-Type Algorithm for Bilevel Optimization under Unbounded Smoothness
par: Gong, Xiaochuan, et autres
Publié: (2025)

Stochastic Smoothed Primal-Dual Algorithms for Nonconvex Optimization with Linear Inequality Constraints
par: Huang, Ruichuan, et autres
Publié: (2025)

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

Bilevel Optimization under Unbounded Smoothness: A New Algorithm and Convergence Analysis
par: Hao, Jie, et autres
Publié: (2024)

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)

Prelimit Coupling and Steady-State Convergence of Constant-stepsize Nonsmooth Contractive SA
par: Zhang, Yixuan, et autres
Publié: (2024)

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

MGDA Converges under Generalized Smoothness, Provably
par: Zhang, Qi, et autres
Publié: (2024)

Linear Convergence of the Frank-Wolfe Algorithm over Product Polytopes
par: Iommazzo, Gabriele, et autres
Publié: (2025)

A Randomized Linearly Convergent Frank-Wolfe-type Method for Smooth Convex Minimization over the Spectrahedron
par: Garber, Dan
Publié: (2025)

Fast Algorithm for Constrained Linear Inverse Problems
par: Sheriff, Mohammed Rayyan, et autres
Publié: (2022)

Low-Rank Extragradient Method for Nonsmooth and Low-Rank Matrix Optimization Problems
par: Garber, Dan, et autres
Publié: (2022)

Low-Rank Mirror-Prox for Nonsmooth and Low-Rank Matrix Optimization Problems
par: Garber, Dan, et autres
Publié: (2022)

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

Improved Rates for Stochastic Variance-Reduced Difference-of-Convex Algorithms
par: Nguyen, Anh Duc, et autres
Publié: (2025)

On Linear Convergence of PI Consensus Algorithm under the Restricted Secant Inequality
par: Chakrabarti, Kushal, et autres
Publié: (2023)

A Single-Loop Smoothed Gradient Descent-Ascent Algorithm for Nonconvex-Concave Min-Max Problems
par: Zhang, Jiawei, et autres
Publié: (2020)

Directional Smoothness and Gradient Methods: Convergence and Adaptivity
par: Mishkin, Aaron, et autres
Publié: (2024)

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

Locally Linear Convergence for Nonsmooth Convex Optimization via Coupled Smoothing and Momentum
par: Baghbadorani, Reza Rahimi, et autres
Publié: (2025)

Predictive Linear Online Tracking for Unknown Targets
par: Tsiamis, Anastasios, et autres
Publié: (2024)

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

Revisiting Convergence: Shuffling Complexity Beyond Lipschitz Smoothness
par: He, Qi, et autres
Publié: (2025)

On Convergence of Incremental Gradient for Non-Convex Smooth Functions
par: Koloskova, Anastasia, et autres
Publié: (2023)