114 citations · 664 across the 92 of their papers we have counts for
10 papers · 1 filter
Zeroth-order non-convex learning via hierarchical dual averaging
Amélie Héliou, Matthieu Martin, Panayotis Mertikopoulos +1
We propose a hierarchical version of dual averaging for zeroth-order online non-convex optimization - i.e., learning processes where, at each stage, the optimizer is facing an unkn…
A heuristic for estimating Nash equilibria in first-price auctions with correlated values
Benjamin Heymann, Panayotis Mertikopoulos
Our paper concerns the computation of Nash equilibria of first-price auctions with correlated values. While there exist several equilibrium computation methods for auctions with in…
Adaptive first-order methods revisited: Convex optimization without Lipschitz requirements
Kimon Antonakopoulos, Panayotis Mertikopoulos
We propose a new family of adaptive first-order methods for a class of convex minimization problems that may fail to be Lipschitz continuous or smooth in the standard sense. Specif…
Distributed stochastic optimization with large delays
Zhengyuan Zhou, Panayotis Mertikopoulos, Nicholas Bambos +2
One of the most widely used methods for solving large-scale stochastic optimization problems is distributed asynchronous stochastic gradient descent (DASGD), a family of algorithms…
The Last-Iterate Convergence Rate of Optimistic Mirror Descent in Stochastic Variational Inequalities
Waïss Azizian, Franck Iutzeler, Jérôme Malick +1
In this paper, we analyze the local convergence rate of optimistic mirror descent methods in stochastic variational inequalities, a class of optimization problems with important ap…
Learning in nonatomic games, Part I: Finite action spaces and population games
Saeed Hadikhanloo, Rida Laraki, Panayotis Mertikopoulos +1
We examine the long-run behavior of a wide range of dynamics for learning in nonatomic games, in both discrete and continuous time. The class of dynamics under consideration includ…