Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDEmmanouil V. Vlatakis-Gkaragkounis
Person information
- affiliation: University of California, Berkeley, Simons Institute for the Theory of Computing,, CA, USA
- affiliation (PhD 2022): Columbia University, Computer Science Department, New York City, NY, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c19]Xi Chen, Chenghao Guo, Emmanouil V. Vlatakis-Gkaragkounis, Mihalis Yannakakis:
Smoothed Complexity of SWAP in Local Graph Partitioning. SODA 2024: 5057-5083- [i24]Guru Guruganesh, Yoav Kolumbus, Jon Schneider, Inbal Talgam-Cohen, Emmanouil-Vasileios Vlatakis-Gkaragkounis, Joshua R. Wang, S. Matthew Weinberg:
Contracting with a Learning Agent. CoRR abs/2401.16198 (2024) - 2023
- [c18]Fivos Kalogiannis, Ioannis Anagnostides, Ioannis Panageas, Emmanouil V. Vlatakis-Gkaragkounis
, Vaggos Chatziafratis, Stelios Andrew Stavroulakis:
Efficiently Computing Nash Equilibria in Adversarial Team Markov Games. ICLR 2023 - [c17]Fivos Kalogiannis, Ioannis Panageas, Emmanouil V. Vlatakis-Gkaragkounis:
Towards convergence to Nash equilibria in two-team zero-sum games. ICLR 2023 - [c16]Iosif Sakos, Emmanouil V. Vlatakis-Gkaragkounis, Panayotis Mertikopoulos, Georgios Piliouras:
Exploiting hidden structures in non-convex games for convergence to Nash equilibrium. NeurIPS 2023 - [c15]Ioannis Anagnostides, Fivos Kalogiannis, Ioannis Panageas, Emmanouil-Vasileios Vlatakis-Gkaragkounis, Stephen McAleer:
Algorithms and Complexity for Computing Nash Equilibria in Adversarial Team Games. EC 2023: 89 - [c14]Christos H. Papadimitriou, Emmanouil-Vasileios Vlatakis-Gkaragkounis, Manolis Zampetakis:
The Computational Complexity of Multi-player Concave Games and Kakutani Fixed Points. EC 2023: 1045 - [i23]Ioannis Anagnostides, Fivos Kalogiannis, Ioannis Panageas, Emmanouil-Vasileios Vlatakis-Gkaragkounis, Stephen McAleer:
Algorithms and Complexity for Computing Nash Equilibria in Adversarial Team Games. CoRR abs/2301.02129 (2023) - [i22]Xi Chen, Chenghao Guo, Emmanouil V. Vlatakis-Gkaragkounis, Mihalis Yannakakis:
Smoothed Complexity of SWAP in Local Graph Partitioning. CoRR abs/2305.15804 (2023) - [i21]Emmanouil V. Vlatakis-Gkaragkounis, Lampros Flokas, Georgios Piliouras:
Chaos persists in large-scale multi-agent learning despite adaptive learning rates. CoRR abs/2306.01032 (2023) - [i20]Emmanouil V. Vlatakis-Gkaragkounis, Angeliki Giannou, Yudong Chen, Qiaomin Xie:
Stochastic Methods in Variational Inequalities: Ergodicity, Bias and Refinements. CoRR abs/2306.16502 (2023) - [i19]Yang Cai, Michael I. Jordan, Tianyi Lin, Argyris Oikonomou, Emmanouil V. Vlatakis-Gkaragkounis:
Curvature-Independent Last-Iterate Convergence for Games on Riemannian Manifolds. CoRR abs/2306.16617 (2023) - [i18]Francisca Vasconcelos, Emmanouil-Vasileios Vlatakis-Gkaragkounis, Panayotis Mertikopoulos, Georgios Piliouras, Michael I. Jordan:
A Quadratic Speedup in Finding Nash Equilibria of Quantum Zero-Sum Games. CoRR abs/2311.10859 (2023) - [i17]Iosif Sakos, Emmanouil V. Vlatakis-Gkaragkounis, Panayotis Mertikopoulos, Georgios Piliouras:
Exploiting hidden structures in non-convex games for convergence to Nash equilibrium. CoRR abs/2312.16609 (2023) - 2022
- [b1]Emmanouil-Vasileios Vlatakis-Gkaragkounis:
Beyond Worst-Case Analysis of Optimization in the Era of Machine Learning. Columbia University, USA, 2022 - [c13]Daniel J. Hsu, Clayton Hendrick Sanford, Rocco A. Servedio, Emmanouil-Vasileios Vlatakis-Gkaragkounis:
Near-Optimal Statistical Query Lower Bounds for Agnostically Learning Intersections of Halfspaces with Gaussian Marginals. COLT 2022: 283-312 - [c12]Angeliki Giannou, Kyriakos Lotidis, Panayotis Mertikopoulos, Emmanouil V. Vlatakis-Gkaragkounis:
On the convergence of policy gradient methods to Nash equilibria in general stochastic games. NeurIPS 2022 - [c11]Michael I. Jordan, Tianyi Lin, Emmanouil V. Vlatakis-Gkaragkounis:
First-Order Algorithms for Min-Max Optimization in Geodesic Metric Spaces. NeurIPS 2022 - [i16]Daniel Hsu, Clayton Sanford, Rocco A. Servedio, Emmanouil V. Vlatakis-Gkaragkounis:
Near-Optimal Statistical Query Lower Bounds for Agnostically Learning Intersections of Halfspaces with Gaussian Marginals. CoRR abs/2202.05096 (2022) - [i15]Michael I. Jordan, Tianyi Lin, Emmanouil V. Vlatakis-Gkaragkounis:
First-Order Algorithms for Min-Max Optimization in Geodesic Metric Spaces. CoRR abs/2206.02041 (2022) - [i14]Christos H. Papadimitriou, Emmanouil-Vasileios Vlatakis-Gkaragkounis, Manolis Zampetakis:
The Computational Complexity of Multi-player Concave Games and Kakutani Fixed Points. CoRR abs/2207.07557 (2022) - [i13]Fivos Kalogiannis, Ioannis Anagnostides, Ioannis Panageas, Emmanouil-Vasileios Vlatakis-Gkaragkounis, Vaggos Chatziafratis, Stelios Stavroulakis:
Efficiently Computing Nash Equilibria in Adversarial Team Markov Games. CoRR abs/2208.02204 (2022) - [i12]Angeliki Giannou, Kyriakos Lotidis, Panayotis Mertikopoulos, Emmanouil V. Vlatakis-Gkaragkounis:
On the convergence of policy gradient methods to Nash equilibria in general stochastic games. CoRR abs/2210.08857 (2022) - 2021
- [c10]Huck Bennett, Anindya De, Rocco A. Servedio, Emmanouil-Vasileios Vlatakis-Gkaragkounis:
Reconstructing weighted voting schemes from partial information about their power indices. COLT 2021: 500-565 - [c9]Angeliki Giannou, Emmanouil-Vasileios Vlatakis-Gkaragkounis, Panayotis Mertikopoulos:
Survival of the strictest: Stable and unstable equilibria under regularized learning with partial information. COLT 2021: 2147-2148 - [c8]Daniel Hsu, Clayton Sanford, Rocco A. Servedio, Emmanouil V. Vlatakis-Gkaragkounis:
On the Approximation Power of Two-Layer Networks of Random ReLUs. COLT 2021: 2423-2461 - [c7]Emmanouil V. Vlatakis-Gkaragkounis, Lampros Flokas, Georgios Piliouras:
Solving Min-Max Optimization with Hidden Structure via Gradient Descent Ascent. NeurIPS 2021: 2373-2386 - [c6]Angeliki Giannou, Emmanouil V. Vlatakis-Gkaragkounis, Panayotis Mertikopoulos:
The convergence rate of regularized learning in games: From bandits and uncertainty to optimism and beyond. NeurIPS 2021: 22655-22666 - [i11]Angeliki Giannou, Emmanouil-Vasileios Vlatakis-Gkaragkounis, Panayotis Mertikopoulos:
From Learning with Partial Information to Bandits: Only Strict Nash Equilibria are Stable. CoRR abs/2101.04667 (2021) - [i10]Lampros Flokas, Emmanouil V. Vlatakis-Gkaragkounis, Georgios Piliouras:
Solving Min-Max Optimization with Hidden Structure via Gradient Descent Ascent. CoRR abs/2101.05248 (2021) - [i9]Daniel Hsu, Clayton Sanford, Rocco A. Servedio, Emmanouil V. Vlatakis-Gkaragkounis:
On the Approximation Power of Two-Layer Networks of Random ReLUs. CoRR abs/2102.02336 (2021) - [i8]Fivos Kalogiannis, Ioannis Panageas, Emmanouil V. Vlatakis-Gkaragkounis:
Teamwork makes von Neumann work: Min-Max Optimization in Two-Team Zero-Sum Games. CoRR abs/2111.04178 (2021) - 2020
- [c5]Christos Tzamos, Emmanouil V. Vlatakis-Gkaragkounis, Ilias Zadik:
Optimal Private Median Estimation under Minimal Distributional Assumptions. NeurIPS 2020 - [c4]Emmanouil V. Vlatakis-Gkaragkounis, Lampros Flokas, Thanasis Lianeas, Panayotis Mertikopoulos, Georgios Piliouras:
No-Regret Learning and Mixed Nash Equilibria: They Do Not Mix. NeurIPS 2020 - [c3]Xi Chen, Chenghao Guo, Emmanouil V. Vlatakis-Gkaragkounis, Mihalis Yannakakis, Xinzhi Zhang:
Smoothed complexity of local max-cut and binary max-CSP. STOC 2020: 1052-1065 - [i7]Huck Bennett, Anindya De, Rocco A. Servedio, Emmanouil-Vasileios Vlatakis-Gkaragkounis:
Reconstructing weighted voting schemes from partial information about their power indices. CoRR abs/2007.09599 (2020) - [i6]Lampros Flokas, Emmanouil V. Vlatakis-Gkaragkounis, Thanasis Lianeas, Panayotis Mertikopoulos, Georgios Piliouras:
No-regret learning and mixed Nash equilibria: They do not mix. CoRR abs/2010.09514 (2020) - [i5]Christos Tzamos, Emmanouil V. Vlatakis-Gkaragkounis, Ilias Zadik:
Optimal Private Median Estimation under Minimal Distributional Assumptions. CoRR abs/2011.06202 (2020)
2010 – 2019
- 2019
- [c2]Emmanouil V. Vlatakis-Gkaragkounis, Lampros Flokas, Georgios Piliouras:
Efficiently avoiding saddle points with zero order methods: No gradients required. NeurIPS 2019: 10066-10077 - [c1]Emmanouil V. Vlatakis-Gkaragkounis, Lampros Flokas, Georgios Piliouras:
Poincaré Recurrence, Cycles and Spurious Equilibria in Gradient-Descent-Ascent for Non-Convex Non-Concave Zero-Sum Games. NeurIPS 2019: 10450-10461 - [i4]Lampros Flokas, Emmanouil V. Vlatakis-Gkaragkounis, Georgios Piliouras:
Poincaré Recurrence, Cycles and Spurious Equilibria in Gradient-Descent-Ascent for Non-Convex Non-Concave Zero-Sum Games. CoRR abs/1910.13010 (2019) - [i3]Lampros Flokas, Emmanouil V. Vlatakis-Gkaragkounis, Georgios Piliouras:
Efficiently avoiding saddle points with zero order methods: No gradients required. CoRR abs/1910.13021 (2019) - [i2]Xi Chen, Chenghao Guo, Emmanouil V. Vlatakis-Gkaragkounis, Mihalis Yannakakis, Xinzhi Zhang:
Smoothed complexity of local Max-Cut and binary Max-CSP. CoRR abs/1911.10381 (2019) - 2018
- [i1]Georgios Paraskevopoulos, Efthymios Tzinis, Emmanouil-Vasileios Vlatakis-Gkaragkounis, Alexandros Potamianos:
Pattern Search Multidimensional Scaling. CoRR abs/1806.00416 (2018)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-05-09 00:30 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
