Image de couverture de livre

Fundamental Benefit of Alternating Updates in Minimax Optimization

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Lee, Jaewook, Cho, Hanseul, Yun, Chulhee
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

Convergence and Implicit Bias of Gradient Descent on Continual Linear Classification
par: Jung, Hyunji, et autres
Publié: (2025)

Provable Benefit of Random Permutations over Uniform Sampling in Stochastic Coordinate Descent
par: Kim, Donghwa, et autres
Publié: (2025)

Through the River: Understanding the Benefit of Schedule-Free Methods for Language Model Training
par: Song, Minhak, et autres
Publié: (2025)

Stochastic Extragradient with Flip-Flop Shuffling & Anchoring: Provable Improvements
par: Chae, Jiseok, et autres
Publié: (2024)

Does SGD really happen in tiny subspaces?
par: Song, Minhak, et autres
Publié: (2024)

Incremental Gradient Descent with Small Epoch Counts is Surprisingly Slow on Ill-Conditioned Problems
par: Kim, Yujun, et autres
Publié: (2025)

Nesterov Acceleration with Operator Decomposition
par: Lee, Jaewook, et autres
Publié: (2026)

Gradient Descent with Polyak's Momentum Finds Flatter Minima via Large Catapults
par: Phunyaphibarn, Prin, et autres
Publié: (2023)

SDEs for Minimax Optimization
par: Compagnoni, Enea Monzio, et autres
Publié: (2024)

Nonsmooth Nonconvex-Nonconcave Minimax Optimization: Primal-Dual Balancing and Iteration Complexity Analysis
par: Li, Jiajin, et autres
Publié: (2022)

Scaling Laws of SignSGD in Linear Regression: When Does It Outperform SGD?
par: Kim, Jihwan, et autres
Publié: (2026)

Implicit Bias of Per-sample Adam on Separable Data: Departure from the Full-batch Regime
par: Baek, Beomhan, et autres
Publié: (2025)

Derivative-free Alternating Projection Algorithms for General Nonconvex-Concave Minimax Problems
par: Xu, Zi, et autres
Publié: (2021)

Adaptive Federated Minimax Optimization with Lower Complexities
par: Huang, Feihu, et autres
Publié: (2022)

Effective Bilevel Optimization via Minimax Reformulation
par: Wang, Xiaoyu, et autres
Publié: (2023)

Stochastic Compositional Minimax Optimization with Provable Convergence Guarantees
par: Deng, Yuyang, et autres
Publié: (2024)

Efficient Stochastic Approximation of Minimax Excess Risk Optimization
par: Zhang, Lijun, et autres
Publié: (2023)

Shuffling Gradient-Based Methods for Nonconvex-Concave Minimax Optimization
par: Tran-Dinh, Quoc, et autres
Publié: (2024)

Accelerated Fully First-Order Methods for Bilevel and Minimax Optimization
par: Li, Chris Junchi
Publié: (2024)

Adaptive and Optimal Second-order Optimistic Methods for Minimax Optimization
par: Jiang, Ruichen, et autres
Publié: (2024)

Zeroth-Order primal-dual Alternating Projection Gradient Algorithms for Nonconvex Minimax Problems with Coupled linear Constraints
par: Zhang, Huiling, et autres
Publié: (2024)

Near-Optimal Distributed Minimax Optimization under the Second-Order Similarity
par: Zhou, Qihao, et autres
Publié: (2024)

Two-Timescale Gradient Descent Ascent Algorithms for Nonconvex Minimax Optimization
par: Lin, Tianyi, et autres
Publié: (2024)

Faster Stochastic Algorithms for Minimax Optimization under Polyak--Łojasiewicz Conditions
par: Chen, Lesi, et autres
Publié: (2023)

An Efficient Stochastic Algorithm for Decentralized Nonconvex-Strongly-Concave Minimax Optimization
par: Chen, Lesi, et autres
Publié: (2022)

Less is More: Convergence Benefits of Fewer Data Weight Updates over Longer Horizon
par: Das, Rudrajit, et autres
Publié: (2026)

Zeroth-Order Stochastic Mirror Descent Algorithms for Minimax Excess Risk Optimization
par: Gu, Zhihao, et autres
Publié: (2024)

TiAda: A Time-scale Adaptive Algorithm for Nonconvex Minimax Optimization
par: Li, Xiang, et autres
Publié: (2022)

A Mean-Field Analysis of Neural Stochastic Gradient Descent-Ascent for Functional Minimax Optimization
par: Zhu, Yuchen, et autres
Publié: (2024)

Penalty-Based First-Order Methods for Bilevel Optimization with Minimax and Constrained Lower-Level Problems
par: Shen, Yiyang, et autres
Publié: (2026)

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

Optimization for Neural Operators can Benefit from Width
par: Cisneros-Velarde, Pedro, et autres
Publié: (2025)

Iterative Minimax Games with Coupled Linear Constraints
par: Zhang, Huiling, et autres
Publié: (2022)

Convergence of Distributed Adaptive Optimization with Local Updates
par: Cheng, Ziheng, et autres
Publié: (2024)

Stochastic Zeroth-Order Optimization under Strongly Convexity and Lipschitz Hessian: Minimax Sample Complexity
par: Yu, Qian, et autres
Publié: (2024)

Two-timescale Extragradient for Finding Local Minimax Points
par: Chae, Jiseok, et autres
Publié: (2023)

On Gradient Descent Ascent for Nonconvex-Concave Minimax Problems
par: Lin, Tianyi, et autres
Publié: (2019)

On PI Controllers for Updating Lagrange Multipliers in Constrained Optimization
par: Sohrabi, Motahareh, et autres
Publié: (2024)

Automatic Differentiation of Optimization Algorithms with Time-Varying Updates
par: Mehmood, Sheheryar, et autres
Publié: (2024)

Stochastic Smoothed Gradient Descent Ascent for Federated Minimax Optimization
par: Shen, Wei, et autres
Publié: (2023)