Copertina

Stochastic Extragradient with Flip-Flop Shuffling & Anchoring: Provable Improvements

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autori principali:	Chae, Jiseok, Yun, Chulhee, Kim, Donghwan
Natura:	Preprint
Pubblicazione:	2024
Soggetti:	Machine Learning Optimization and Control
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

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

Stochastic Newton Proximal Extragradient Method
di: Jiang, Ruichen, et al.
Pubblicazione: (2024)

Incremental Gradient Descent with Small Epoch Counts is Surprisingly Slow on Ill-Conditioned Problems
di: Kim, Yujun, et al.
Pubblicazione: (2025)

Provable Benefit of Random Permutations over Uniform Sampling in Stochastic Coordinate Descent
di: Kim, Donghwa, et al.
Pubblicazione: (2025)

Fundamental Benefit of Alternating Updates in Minimax Optimization
di: Lee, Jaewook, et al.
Pubblicazione: (2024)

Does SGD really happen in tiny subspaces?
di: Song, Minhak, et al.
Pubblicazione: (2024)

Convergence and Implicit Bias of Gradient Descent on Continual Linear Classification
di: Jung, Hyunji, et al.
Pubblicazione: (2025)

Scaling Laws of SignSGD in Linear Regression: When Does It Outperform SGD?
di: Kim, Jihwan, et al.
Pubblicazione: (2026)

Revisiting Inexact Fixed-Point Iterations for Min-Max Problems: Stochasticity and Structured Nonconvexity
di: Alacaoglu, Ahmet, et al.
Pubblicazione: (2024)

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

Learning to Shuffle: Block Reshuffling and Reversal Schemes for Stochastic Optimization
di: Nguyen, Lam M., et al.
Pubblicazione: (2026)

Provable Complexity Improvement of AdaGrad over SGD: Upper and Lower Bounds in Stochastic Non-Convex Optimization
di: Jiang, Ruichen, et al.
Pubblicazione: (2024)

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

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

Implicit Bias of Per-sample Adam on Separable Data: Departure from the Full-batch Regime
di: Baek, Beomhan, et al.
Pubblicazione: (2025)

Gradient Descent with Polyak's Momentum Finds Flatter Minima via Large Catapults
di: Phunyaphibarn, Prin, et al.
Pubblicazione: (2023)

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

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

Extragradient Method for $(L_0, L_1)$-Lipschitz Root-finding Problems
di: Choudhury, Sayantan, et al.
Pubblicazione: (2025)

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

Stochastic Compositional Minimax Optimization with Provable Convergence Guarantees
di: Deng, Yuyang, et al.
Pubblicazione: (2024)

On the Provable Suboptimality of Momentum SGD in Nonstationary Stochastic Optimization
di: Sahu, Sharan, et al.
Pubblicazione: (2026)

Through the River: Understanding the Benefit of Schedule-Free Methods for Language Model Training
di: Song, Minhak, et al.
Pubblicazione: (2025)

A Provably Convergent Plug-and-Play Framework for Stochastic Bilevel Optimization
di: Chu, Tianshu, et al.
Pubblicazione: (2025)

Armijo Line-search Can Make (Stochastic) Gradient Descent Provably Faster
di: Vaswani, Sharan, et al.
Pubblicazione: (2025)

A primal-dual perspective for distributed TD-learning
di: Lim, Han-Dong, et al.
Pubblicazione: (2023)

On the Last-Iterate Convergence of Shuffling Gradient Methods
di: Liu, Zijian, et al.
Pubblicazione: (2024)

Shuffling Momentum Gradient Algorithm for Convex Optimization
di: Tran, Trang H., et al.
Pubblicazione: (2024)

Provably Efficient Infinite-Horizon Average-Reward Reinforcement Learning with Linear Function Approximation
di: Chae, Woojin, et al.
Pubblicazione: (2024)

Mitigating Gradient Bias in Multi-objective Learning: A Provably Convergent Stochastic Approach
di: Fernando, Heshan, et al.
Pubblicazione: (2022)

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

Shuffling Gradient-Based Methods for Nonconvex-Concave Minimax Optimization
di: Tran-Dinh, Quoc, et al.
Pubblicazione: (2024)

Shuffling Heuristic in Variational Inequalities: Establishing New Convergence Guarantees
di: Medyakov, Daniil, et al.
Pubblicazione: (2025)

Linear attention is (maybe) all you need (to understand transformer optimization)
di: Ahn, Kwangjun, et al.
Pubblicazione: (2023)

Improved Last-Iterate Convergence of Shuffling Gradient Methods for Nonsmooth Convex Optimization
di: Liu, Zijian, et al.
Pubblicazione: (2025)

Adjusted Shuffling SARAH: Advancing Complexity Analysis via Dynamic Gradient Weighting
di: Nguyen, Duc Toan, et al.
Pubblicazione: (2025)

Stochastic-Constrained Stochastic Optimization with Markovian Data
di: Kim, Yeongjong, et al.
Pubblicazione: (2023)

Empirical Risk Minimization with Shuffled SGD: A Primal-Dual Perspective and Improved Bounds
di: Cai, Xufeng, et al.
Pubblicazione: (2023)

Shuffling the Data, Stretching the Step-size: Sharper Bias in constant step-size SGD
di: Emmanouilidis, Konstantinos, et al.
Pubblicazione: (2026)

Provably Convergent Federated Trilevel Learning
di: Jiao, Yang, et al.
Pubblicazione: (2023)