Подписаться
Georgios Piliouras
Georgios Piliouras
Google DeepMind, Singapore University of Technology and Design
Подтвержден адрес электронной почты в домене google.com - Главная страница
Название
Процитировано
Процитировано
Год
First-order methods almost always avoid strict saddle points
JD Lee, I Panageas, G Piliouras, M Simchowitz, MI Jordan, B Recht
Mathematical programming 176 (1), 311-337, 2019
3492019
Optimistic mirror descent in saddle-point problems: Going the extra (gradient) mile
M Panayotis, B Lecouat, H Zenati, CS Foo, V Chandrasekhar, G Piliouras
ICLR, 2019
339*2019
Cycles in adversarial regularized learning
P Mertikopoulos, C Papadimitriou, G Piliouras
ACM-SIAM Symposium on Discrete Algorithms (SODA), 2018., 2017
3362017
Multiplicative updates outperform generic no-regret learning in congestion games
R Kleinberg, G Piliouras, É Tardos
Proceedings of the forty-first annual ACM symposium on Theory of computing …, 2009
1922009
Gradient descent converges to minimizers: The case of non-isolated critical points
I Panageas, G Piliouras
Proceedings of the 2017 ACM Conference on Innovations in Theoretical …, 2016
181*2016
Multiplicative Weights Update in Zero-Sum Games
JP Bailey, G Piliouras
Proceedings of the 2018 ACM Conference on Economics and Computation, 321-338, 2018
1462018
{\alpha}-Rank: Multi-Agent Evaluation by Evolution
S Omidshafiei, C Papadimitriou, G Piliouras, K Tuyls, M Rowland, ...
Scientific Reports (9), 2019
1292019
Multiplicative Weights Update with Constant Step-Size in Congestion Games: Convergence, Limit Cycles and Chaos
G Palaiopanos, I Panageas, G Piliouras
31st Annual Conference on Neural Information Processing Systems, 2017
1292017
Incentives in Ethereum's Hybrid Casper Protocol
V Buterin, D Reijsbergen, S Leonardos, G Piliouras
IEEE International Conference on Blockchain and Cryptocurrency (ICBC) 2019, 2019
1172019
Global Convergence of Multi-Agent Policy Gradient in Markov Potential Games
S Leonardos, W Overman, I Panageas, G Piliouras
arXiv preprint arXiv:2106.01969, 2021
1162021
Optimization Despite Chaos: Convex Relaxations to Complex Limit Sets via Poincaré Recurrence
G Piliouras, JS Shamma
ACM-SIAM Symposium on Discrete Algorithms (SODA 14), 2014
952014
The unusual effectiveness of averaging in GAN training
Y Yazici, CS Foo, S Winkler, KH Yap, G Piliouras, V Chandrasekhar
arXiv preprint arXiv:1806.04498, 2018
87*2018
From Poincaré recurrence to convergence in imperfect information games: Finding equilibrium via regularization
J Perolat, R Munos, JB Lespiau, S Omidshafiei, M Rowland, P Ortega, ...
International Conference on Machine Learning, 8525-8535, 2021
802021
Weighted Voting on the Blockchain: Improving Consensus in Proof of Stake Protocols
S Leonardos, D Reijsbergen, G Piliouras
IEEE International Conference on Blockchain and Cryptocurrency (ICBC) 2019, 2019
792019
Beyond the Nash equilibrium barrier
R Kleinberg, K Ligett, G Piliouras, E Tardos
Symposium on Innovations in Computer Science (ICS), 2011
782011
Risk sensitivity of price of anarchy under uncertainty
G Piliouras, E Nikolova, JS Shamma
ACM Transactions on Economics and Computation (TEAC) 5 (1), 1-27, 2016
712016
From Nash Equilibria to Chain Recurrent Sets: An Algorithmic Solution Concept for Game Theory
C Papadimitriou, G Piliouras
Entropy 20 (10), 782, 2018
69*2018
Finite regret and cycles with fixed step-size via alternating gradient descent-ascent
JP Bailey, G Gidel, G Piliouras
Conference on Learning Theory, 391-407, 2020
652020
Vortices Instead of Equilibria in MinMax Optimization: Chaos and Butterfly Effects of Online Learning in Zero-Sum Games
YK Cheung, G Piliouras
COLT 2019, 2019
642019
Scaling up Mean Field Games with Online Mirror Descent
J Perolat, S Perrin, R Elie, M Laurière, G Piliouras, M Geist, K Tuyls, ...
arXiv preprint arXiv:2103.00623, 2021
632021
В данный момент система не может выполнить эту операцию. Повторите попытку позднее.
Статьи 1–20