Papers
Communities
Events
Blog
Pricing
Search
Open menu
Home
Papers
2402.05071
Cited By
Extending the Reach of First-Order Algorithms for Nonconvex Min-Max Problems with Cohypomonotonicity
7 February 2024
Ahmet Alacaoglu
Donghwan Kim
Stephen J. Wright
Re-assign community
ArXiv
PDF
HTML
Papers citing
"Extending the Reach of First-Order Algorithms for Nonconvex Min-Max Problems with Cohypomonotonicity"
10 / 10 papers shown
Title
Stochastic Halpern iteration in normed spaces and applications to reinforcement learning
Mario Bravo
Juan Pablo Contreras
76
3
0
19 Mar 2024
An Inexact Halpern Iteration with Application to Distributionally Robust Optimization
Ling Liang
Zusen Xu
Kim-Chuan Toh
Jia Jie Zhu
100
4
0
08 Feb 2024
Single-Call Stochastic Extragradient Methods for Structured Non-monotone Variational Inequalities: Improved Analysis under Weaker Conditions
S. Choudhury
Eduard A. Gorbunov
Nicolas Loizou
68
13
0
27 Feb 2023
Randomized Block-Coordinate Optimistic Gradient Algorithms for Root-Finding Problems
Quoc Tran-Dinh
Yang Luo
152
8
0
08 Jan 2023
Near-Optimal Algorithms for Making the Gradient Small in Stochastic Minimax Optimization
Le‐Yu Chen
Luo Luo
66
8
0
11 Aug 2022
Independent Policy Gradient Methods for Competitive Reinforcement Learning
C. Daskalakis
Dylan J. Foster
Noah Golowich
196
161
0
11 Jan 2021
Large-Scale Methods for Distributionally Robust Optimization
Daniel Levy
Y. Carmon
John C. Duchi
Aaron Sidford
73
216
0
12 Oct 2020
The limits of min-max optimization algorithms: convergence to spurious non-critical sets
Ya-Ping Hsieh
P. Mertikopoulos
Volkan Cevher
60
83
0
16 Jun 2020
On the convergence of single-call stochastic extra-gradient methods
Yu-Guan Hsieh
F. Iutzeler
J. Malick
P. Mertikopoulos
50
169
0
22 Aug 2019
How To Make the Gradients Small Stochastically: Even Faster Convex and Nonconvex SGD
Zeyuan Allen-Zhu
ODL
68
170
0
08 Jan 2018
1