Emmanouil V. Vlatakis-Gkaragkounis

Joshua R. Wang

S. Matthew Weinberg

CoRR, 2024

Smoothed Complexity of SWAP in Local Graph Partitioning.

[BibT_eX]

[DOI]

Xi Chen

Chenghao Guo

Mihalis Yannakakis

Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, 2024

2023

A Quadratic Speedup in Finding Nash Equilibria of Quantum Zero-Sum Games.

[BibT_eX]

[DOI]

Francisca Vasconcelos

Michael I. Jordan

CoRR, 2023

Curvature-Independent Last-Iterate Convergence for Games on Riemannian Manifolds.

[BibT_eX]

[DOI]

CoRR, 2023

Stochastic Methods in Variational Inequalities: Ergodicity, Bias and Refinements.

[BibT_eX]

[DOI]

Yudong Chen

Qiaomin Xie

CoRR, 2023

Chaos persists in large-scale multi-agent learning despite adaptive learning rates.

[BibT_eX]

[DOI]

Christos H. Papadimitriou

CoRR, 2023

The Computational Complexity of Multi-player Concave Games and Kakutani Fixed Points.

[BibT_eX]

[DOI]

Manolis Zampetakis

Proceedings of the 24th ACM Conference on Economics and Computation, 2023

Algorithms and Complexity for Computing Nash Equilibria in Adversarial Team Games.

[BibT_eX]

[DOI]

Ioannis Anagnostides

Stephen McAleer

Proceedings of the 24th ACM Conference on Economics and Computation, 2023

Exploiting hidden structures in non-convex games for convergence to Nash equilibrium.

[BibT_eX]

[DOI]

Iosif Sakos

Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023

Towards convergence to Nash equilibria in two-team zero-sum games.

[BibT_eX]

[DOI]

Proceedings of the Eleventh International Conference on Learning Representations, 2023

Efficiently Computing Nash Equilibria in Adversarial Team Markov Games.

[BibT_eX]

[DOI]

Ioannis Anagnostides

Stelios Andrew Stavroulakis

Vaggos Chatziafratis

Proceedings of the Eleventh International Conference on Learning Representations, 2023

2022

Beyond Worst-Case Analysis of Optimization in the Era of Machine Learning

[BibT_eX]

[DOI]

PhD thesis, 2022

First-Order Algorithms for Min-Max Optimization in Geodesic Metric Spaces.

[BibT_eX]

[DOI]

Michael I. Jordan

Tianyi Lin

Proceedings of the Advances in Neural Information Processing Systems 35: Annual Conference on Neural Information Processing Systems 2022, 2022

On the convergence of policy gradient methods to Nash equilibria in general stochastic games.

[BibT_eX]

[DOI]

Kyriakos Lotidis

Proceedings of the Advances in Neural Information Processing Systems 35: Annual Conference on Neural Information Processing Systems 2022, 2022

Near-Optimal Statistical Query Lower Bounds for Agnostically Learning Intersections of Halfspaces with Gaussian Marginals.

[BibT_eX]

[DOI]

Daniel J. Hsu

Clayton Hendrick Sanford

Rocco A. Servedio

Proceedings of the Conference on Learning Theory, 2-5 July 2022, London, UK., 2022

2021

Teamwork makes von Neumann work: Min-Max Optimization in Two-Team Zero-Sum Games.

[BibT_eX]

[DOI]

CoRR, 2021

From Learning with Partial Information to Bandits: Only Strict Nash Equilibria are Stable.

[BibT_eX]

[DOI]

CoRR, 2021

Solving Min-Max Optimization with Hidden Structure via Gradient Descent Ascent.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, 2021

The convergence rate of regularized learning in games: From bandits and uncertainty to optimism and beyond.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, 2021

On the Approximation Power of Two-Layer Networks of Random ReLUs.

[BibT_eX]

[DOI]

Daniel Hsu

Clayton Sanford

Rocco A. Servedio

Proceedings of the Conference on Learning Theory, 2021

Survival of the strictest: Stable and unstable equilibria under regularized learning with partial information.

[BibT_eX]

[DOI]

Proceedings of the Conference on Learning Theory, 2021

Reconstructing weighted voting schemes from partial information about their power indices.

[BibT_eX]

[DOI]

Huck Bennett

Anindya De

Rocco A. Servedio

Proceedings of the Conference on Learning Theory, 2021

2020

Smoothed complexity of local max-cut and binary max-CSP.

[BibT_eX]

[DOI]

Xi Chen

Chenghao Guo

Mihalis Yannakakis

Xinzhi Zhang

Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing, 2020

No-Regret Learning and Mixed Nash Equilibria: They Do Not Mix.

[BibT_eX]

[DOI]

Thanasis Lianeas

Proceedings of the Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020, 2020

Optimal Private Median Estimation under Minimal Distributional Assumptions.

[BibT_eX]

[DOI]

Christos Tzamos

Ilias Zadik

Proceedings of the Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020, 2020

2019

Poincaré Recurrence, Cycles and Spurious Equilibria in Gradient-Descent-Ascent for Non-Convex Non-Concave Zero-Sum Games.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 32: Annual Conference on Neural Information Processing Systems 2019, 2019

Efficiently avoiding saddle points with zero order methods: No gradients required.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 32: Annual Conference on Neural Information Processing Systems 2019, 2019

2018

Pattern Search Multidimensional Scaling.

[BibT_eX]

[DOI]

Georgios Paraskevopoulos

Efthymios Tzinis