Imagen de Portada

Extragradient Method for $(L_0, L_1)$-Lipschitz Root-finding Problems

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Choudhury, Sayantan, Loizou, Nicolas
Formato:	Preprint
Publicado:	2025
Materias:	Optimization and Control Machine Learning
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Multiplayer Federated Learning: Reaching Equilibrium with Less Communication
por: Yoon, TaeHo, et al.
Publicado: (2025)

Communication-Efficient Gradient Descent-Accent Methods for Distributed Variational Inequalities: Unified Analysis and Local Updates
por: Zhang, Siqi, et al.
Publicado: (2023)

Remove that Square Root: A New Efficient Scale-Invariant Version of AdaGrad
por: Choudhury, Sayantan, et al.
Publicado: (2024)

Methods for Convex $(L_0,L_1)$-Smooth Optimization: Clipping, Acceleration, and Adaptivity
por: Gorbunov, Eduard, et al.
Publicado: (2024)

Stochastic Extragradient with Random Reshuffling: Improved Convergence for Variational Inequalities
por: Emmanouilidis, Konstantinos, et al.
Publicado: (2024)

Extragradient Type Methods for Riemannian Variational Inequality Problems
por: Hu, Zihao, et al.
Publicado: (2023)

Stochastic Newton Proximal Extragradient Method
por: Jiang, Ruichen, et al.
Publicado: (2024)

Low-Rank Extragradient Method for Nonsmooth and Low-Rank Matrix Optimization Problems
por: Garber, Dan, et al.
Publicado: (2022)

Low-Rank Extragradient Methods for Scalable Semidefinite Optimization
por: Garber, Dan, et al.
Publicado: (2024)

Safeguarded Stochastic Polyak Step Sizes for Non-smooth Optimization: Robust Performance Without Small (Sub)Gradients
por: Oikonomou, Dimitris, et al.
Publicado: (2025)

Sharpness-Aware Minimization: General Analysis and Improved Rates
por: Oikonomou, Dimitris, et al.
Publicado: (2025)

Stochastic Polyak Step-sizes and Momentum: Convergence Guarantees and Practical Performance
por: Oikonomou, Dimitris, et al.
Publicado: (2024)

Adaptive Sharpness-Aware Minimization with a Polyak-type Step size: A Theory-Grounded Scheduler
por: Oikonomou, Dimitris, et al.
Publicado: (2026)

Dissipative Gradient Descent Ascent Method: A Control Theory Inspired Algorithm for Min-max Optimization
por: Zheng, Tianqi, et al.
Publicado: (2024)

Two-timescale Extragradient for Finding Local Minimax Points
por: Chae, Jiseok, et al.
Publicado: (2023)

Locally Adaptive Federated Learning
por: Mukherjee, Sohom, et al.
Publicado: (2023)

When is Momentum Extragradient Optimal? A Polynomial-Based Analysis
por: Kim, Junhyung Lyle, et al.
Publicado: (2022)

Stochastic Extragradient with Flip-Flop Shuffling & Anchoring: Provable Improvements
por: Chae, Jiseok, et al.
Publicado: (2024)

Gradient Clipping Beyond Vector Norms: A Spectral Approach for Matrix-Valued Parameters
por: Yukhimchuk, Alexander, et al.
Publicado: (2026)

Near-Optimal Convergence of Accelerated Gradient Methods under Generalized and $(L_0, L_1)$-Smoothness
por: Tyurin, Alexander
Publicado: (2025)

Parameter-Free Non-Ergodic Extragradient Algorithms for Solving Monotone Variational Inequalities
por: Shen, Lingqing, et al.
Publicado: (2026)

Muon with Nesterov Momentum: Heavy-Tailed Noise and (Randomized) Inexact Polar Decomposition
por: Choudhury, Sayantan, et al.
Publicado: (2026)

El0ps: An Exact L0-regularized Problems Solver
por: Guyard, Théo, et al.
Publicado: (2025)

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

Convergence of Clipped-SGD for Convex $(L_0,L_1)$-Smooth Optimization with Heavy-Tailed Noise
por: Chezhegov, Savelii, et al.
Publicado: (2025)

Fast Computation of Optimal Transport via Entropy-Regularized Extragradient Methods
por: Li, Gen, et al.
Publicado: (2023)

MIQCQP reformulation of the ReLU neural networks Lipschitz constant estimation problem
por: Sbihi, Mohammed, et al.
Publicado: (2024)

Mini-Extragradient Methods
por: Liu, Xiaozhi, et al.
Publicado: (2025)

Randomized Block-Coordinate Optimistic Gradient Algorithms for Root-Finding Problems
por: Tran-Dinh, Quoc, et al.
Publicado: (2023)

Regularized Extragradient Methods for Solving Equilibrium Problems on Hadamard Manifolds
por: Sharmaa, Shikher, et al.
Publicado: (2025)

Sign Operator for Coping with Heavy-Tailed Noise in Non-Convex Optimization: High Probability Bounds Under $(L_0, L_1)$-Smoothness
por: Kornilov, Nikita, et al.
Publicado: (2025)

Next-Generation Iterative Algorithms for Large-Scale Min-Max Optimization: Design and Analysis
por: Choudhury, Sayantan
Publicado: (2025)

Revisiting Extragradient-Type Methods -- Part 1: Generalizations and Sublinear Convergence Rates
por: Tran-Dinh, Quoc, et al.
Publicado: (2024)

Can We Remove the Square-Root in Adaptive Gradient Methods? A Second-Order Perspective
por: Lin, Wu, et al.
Publicado: (2024)

Muon Does Not Converge on Convex Lipschitz Functions
por: Parshakova, Tetiana, et al.
Publicado: (2026)

Revisiting Convergence: Shuffling Complexity Beyond Lipschitz Smoothness
por: He, Qi, et al.
Publicado: (2025)

Stochastic Weakly Convex Optimization Beyond Lipschitz Continuity
por: Gao, Wenzhi, et al.
Publicado: (2024)

Improved Scalable Lipschitz Bounds for Deep Neural Networks
por: Syed, Usman, et al.
Publicado: (2025)

Primal Methods for Variational Inequality Problems with Functional Constraints
por: Zhang, Liang, et al.
Publicado: (2024)

Proximal Point Method for Online Saddle Point Problem
por: Meng, Qing-xin, et al.
Publicado: (2024)