Image de couverture de livre

On Linear Convergence in Smooth Convex-Concave Bilinearly-Coupled Saddle-Point Optimization: Lower Bounds and Optimal Algorithms

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Kovalev, Dmitry, Borodich, Ekaterina
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

Lower Bounds and Optimal Algorithms for Non-Smooth Convex Decentralized Optimization over Time-Varying Networks
par: Kovalev, Dmitry, et autres
Publié: (2024)

Nesterov Finds GRAAL: Optimal and Adaptive Gradient Method for Convex Optimization
par: Borodich, Ekaterina, et autres
Publié: (2025)

Non-Euclidean SGD for Structured Optimization: Unified Analysis and Improved Rates
par: Kovalev, Dmitry, et autres
Publié: (2025)

Stochastic Non-Smooth Convex Optimization with Unbounded Gradients
par: Kovalev, Dmitry
Publié: (2026)

Optimal Projection-Free Adaptive SGD for Matrix Optimization
par: Kovalev, Dmitry
Publié: (2026)

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

Linear Convergence of a Unified Primal--Dual Algorithm for Convex--Concave Saddle Point Problems with Quadratic Growth
par: Melcher, Cody, et autres
Publié: (2025)

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

Convergence Analysis of Hessian-Damped Tikhonov Regularized Dynamics with Oscillation Control for Convex-Concave Bilinear Saddle Point Problems
par: Zhang, Bohan, et autres
Publié: (2026)

A Modular Algorithm for Non-Stationary Online Convex-Concave Optimization
par: Meng, Qing-xin, et autres
Publié: (2025)

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

Understanding Gradient Orthogonalization for Deep Learning via Non-Euclidean Trust-Region Optimization
par: Kovalev, Dmitry
Publié: (2025)

Generalized Optimistic Methods for Convex-Concave Saddle Point Problems
par: Jiang, Ruichen, et autres
Publié: (2022)

Tight Lower Bounds under Asymmetric High-Order Hölder Smoothness and Uniform Convexity
par: Bai, Cedar Site, et autres
Publié: (2024)

A Simple, Optimal and Efficient Algorithm for Online Exp-Concave Optimization
par: Wang, Yi-Han, et autres
Publié: (2025)

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

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

Complexity Lower Bounds of Adaptive Gradient Algorithms for Non-convex Stochastic Optimization under Relaxed Smoothness
par: Crawshaw, Michael, et autres
Publié: (2025)

A General Tikhonov Regularized Second-Order Dynamical System for Convex-Concave Bilinear Saddle Point Problems
par: Zhang, Bohan, et autres
Publié: (2026)

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

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

SGD with Adaptive Preconditioning: Unified Analysis and Momentum Acceleration
par: Kovalev, Dmitry
Publié: (2025)

Bilevel Optimization with Lower-Level Uniform Convexity: Theory and Algorithm
par: Wu, Yuman, et autres
Publié: (2026)

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

Adam-SHANG: A Convergent Adam-Type Method for Stochastic Smooth Convex Optimization
par: Yu, Yaxin, et autres
Publié: (2026)

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

A Stochastic-Gradient-based Interior-Point Algorithm for Solving Smooth Bound-Constrained Optimization Problems
par: Curtis, Frank E., et autres
Publié: (2023)

New Lower Bounds for Stochastic Non-Convex Optimization through Divergence Decomposition
par: Saad, El Mehdi, et autres
Publié: (2025)

Negative Momentum for Convex-Concave Optimization
par: Shugart, Henry, et autres
Publié: (2026)

A Near-Optimal Single-Loop Stochastic Algorithm for Convex Finite-Sum Coupled Compositional Optimization
par: Wang, Bokun, et autres
Publié: (2023)

Optimal Algorithms for Online Convex Optimization with Adversarial Constraints
par: Sinha, Abhishek, et autres
Publié: (2023)

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

Robust Bond Portfolio Construction via Convex-Concave Saddle Point Optimization
par: Luxenberg, Eric, et autres
Publié: (2022)

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

Smooth Quasar-Convex Optimization with Constraints
par: Martínez-Rubio, David
Publié: (2025)

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

Lower Complexity Bounds for Nonconvex-Strongly-Convex Bilevel Optimization with First-Order Oracles
par: Ji, Kaiyi
Publié: (2025)

Asymmetric Perturbation in Solving Bilinear Saddle-Point Optimization
par: Abe, Kenshi, et autres
Publié: (2025)

Convergence of Clipped-SGD for Convex $(L_0,L_1)$-Smooth Optimization with Heavy-Tailed Noise
par: Chezhegov, Savelii, et autres
Publié: (2025)

Optimal Decentralized Smoothed Online Convex Optimization
par: Bhuyan, Neelkamal, et autres
Publié: (2024)