Papers
Communities
Events
Blog
Pricing
Search
Open menu
Home
Papers
2104.08708
Cited By
Complexity Lower Bounds for Nonconvex-Strongly-Concave Min-Max Optimization
18 April 2021
Haochuan Li
Yi Tian
Jingzhao Zhang
Ali Jadbabaie
Re-assign community
ArXiv
PDF
HTML
Papers citing
"Complexity Lower Bounds for Nonconvex-Strongly-Concave Min-Max Optimization"
9 / 9 papers shown
Title
Two-Timescale Gradient Descent Ascent Algorithms for Nonconvex Minimax Optimization
Tianyi Lin
Chi Jin
Michael I. Jordan
50
6
0
28 Jan 2025
Nonsmooth Nonconvex-Nonconcave Minimax Optimization: Primal-Dual Balancing and Iteration Complexity Analysis
Jiajin Li
Lingling Zhu
Anthony Man-Cho So
46
4
0
17 Jan 2025
Accelerated Stochastic Min-Max Optimization Based on Bias-corrected Momentum
H. Cai
Sulaiman A. Alghunaim
Ali H.Sayed
41
1
0
18 Jun 2024
Optimal Guarantees for Algorithmic Reproducibility and Gradient Complexity in Convex Optimization
Liang Zhang
Junchi Yang
Amin Karbasi
Niao He
16
2
0
26 Oct 2023
TiAda: A Time-scale Adaptive Algorithm for Nonconvex Minimax Optimization
Xiang Li
Junchi Yang
Niao He
19
8
0
31 Oct 2022
Nest Your Adaptive Algorithm for Parameter-Agnostic Nonconvex Minimax Optimization
Junchi Yang
Xiang Li
Niao He
ODL
27
22
0
01 Jun 2022
Federated Minimax Optimization: Improved Convergence Analyses and Algorithms
Pranay Sharma
Rohan Panda
Gauri Joshi
P. Varshney
FedML
19
46
0
09 Mar 2022
Independent Policy Gradient Methods for Competitive Reinforcement Learning
C. Daskalakis
Dylan J. Foster
Noah Golowich
57
158
0
11 Jan 2021
On Solving Minimax Optimization Locally: A Follow-the-Ridge Approach
Yuanhao Wang
Guodong Zhang
Jimmy Ba
29
100
0
16 Oct 2019
1