activity
20162025
most citedFirst-order Methods Almost Always Avoid Saddle Points

76 citations · 296 across the 67 of their papers we have counts for

collaborators
Showing 2018Show all

5 papers · 1 filter

math.DS2018

Family of chaotic maps from game theory

Thiparat Chotibut, Fryderyk Falniowski, Michal Misiurewicz +1

From a two-agent, two-strategy congestion game where both agents apply the multiplicative weights update algorithm, we obtain a two-parameter family of maps of the unit square to i…

cs.LG2018

Optimistic mirror descent in saddle-point problems: Going the extra (gradient) mile

Panayotis Mertikopoulos, Bruno Lecouat, Houssam Zenati +3

Owing to their connection with generative adversarial networks (GANs), saddle-point problems have recently attracted considerable interest in machine learning and beyond. By necess…

stat.ML2018

The Unusual Effectiveness of Averaging in GAN Training

Yasin Yazıcı, Chuan-Sheng Foo, Stefan Winkler +3

We examine two different techniques for parameter averaging in GAN training. Moving Average (MA) computes the time-average of parameters, whereas Exponential Moving Average (EMA) c…

cs.CR2018

Rethinking Blockchain Security: Position Paper

Vincent Chia, Pieter Hartel, Qingze Hum +5

Blockchain technology has become almost as famous for incidents involving security breaches as for its innovative potential. We shed light on the prevalence and nature of these inc…

cs.GT2018

Wealth Inequality and the Price of Anarchy

Kurtuluş Gemici, Elias Koutsoupias, Barnabé Monnot +2

Price of anarchy quantifies the degradation of social welfare in games due to the lack of a centralized authority that can enforce the optimal outcome. At its antipodes, mechanism…