114 citations · 664 across the 92 of their papers we have counts for
12 papers · 1 filter
The rate of convergence of Bregman proximal methods: Local geometry vs. regularity vs. sharpness
Waïss Azizian, Franck Iutzeler, Jérôme Malick +1
We examine the last-iterate convergence rate of Bregman proximal methods - from mirror descent to mirror-prox and its optimistic variants - as a function of the local geometry indu…
On the convergence of policy gradient methods to Nash equilibria in general stochastic games
Angeliki Giannou, Kyriakos Lotidis, Panayotis Mertikopoulos +1
Learning in stochastic games is a notoriously difficult problem because, in addition to each other's strategic decisions, the players must also contend with the fact that the game…
Explicit Second-Order Min-Max Optimization: Practical Algorithms and Complexity Analysis
Tianyi Lin, Panayotis Mertikopoulos, Michael I. Jordan
We propose and analyze several inexact regularized Newton-type methods for finding a global saddle point of convex-concave unconstrained min-max optimization problems. Compared to…
Survival of dominated strategies under imitation dynamics
Panayotis Mertikopoulos, Yannick Viossat
The literature on evolutionary game theory suggests that pure strategies that are strictly dominated by other pure strategies always become extinct under imitative game dynamics, b…
Learning in Games with Quantized Payoff Observations
Kyriakos Lotidis, Panayotis Mertikopoulos, Nicholas Bambos
This paper investigates the impact of feedback quantization on multi-agent learning. In particular, we analyze the equilibrium convergence properties of the well-known "follow the…
Pick your Neighbor: Local Gauss-Southwell Rule for Fast Asynchronous Decentralized Optimization
Marina Costantini, Nikolaos Liakopoulos, Panayotis Mertikopoulos +1
In decentralized optimization environments, each agent in a network of nodes has its own private function , and nodes communicate with their neighbors to cooperatively…