ResearchTrend.AI
Greedy Adversarial Equilibrium: An Efficient Alternative to Nonconvex-Nonconcave Min-Max Optimization

Greedy Adversarial Equilibrium: An Efficient Alternative to Nonconvex-Nonconcave Min-Max Optimization

Oren Mangoubi
Nisheeth K. Vishnoi
ArXivPDFHTML

Papers citing "Greedy Adversarial Equilibrium: An Efficient Alternative to Nonconvex-Nonconcave Min-Max Optimization"

5 / 5 papers shown
Title
The Limit Points of (Optimistic) Gradient Descent in Min-Max Optimization
The Limit Points of (Optimistic) Gradient Descent in Min-Max Optimization
C. Daskalakis
Ioannis Panageas
48
255
0
11 Jul 2018
Local Saddle Point Optimization: A Curvature Exploitation Approach
Local Saddle Point Optimization: A Curvature Exploitation Approach
Leonard Adolphs
Hadi Daneshmand
Aurelien Lucchi
Thomas Hofmann
111
107
0
15 May 2018
Training GANs with Optimism
Training GANs with Optimism
C. Daskalakis
Andrew Ilyas
Vasilis Syrgkanis
Haoyang Zeng
137
517
0
31 Oct 2017
Towards Deep Learning Models Resistant to Adversarial Attacks
Towards Deep Learning Models Resistant to Adversarial Attacks
Aleksander Madry
Aleksandar Makelov
Ludwig Schmidt
Dimitris Tsipras
Adrian Vladu
SILM
OOD
257
12,029
0
19 Jun 2017
Optimization, Learning, and Games with Predictable Sequences
Optimization, Learning, and Games with Predictable Sequences
Alexander Rakhlin
Karthik Sridharan
83
379
0
08 Nov 2013

We use cookies and other tracking technologies to improve your browsing experience on our website, to show you personalized content and targeted ads, to analyze our website traffic, and to understand where our visitors are coming from. See our policy.