default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDIoannis Panageas
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[c44]Ioannis Anagnostides, Ioannis Panageas, Gabriele Farina, Tuomas Sandholm:
Optimistic Policy Gradient in Multi-Player Markov Games with a Single Controller: Convergence beyond the Minty Property. AAAI 2024: 9451-9459- [c43]Nikolas Patris, Stelios Stavroulakis, Fivos Kalogiannis, Rose Zhang, Ioannis Panageas:
Computing Nash Equilibria in Potential Games with Private Uncoupled Constraints. AAAI 2024: 9874-9882 - [c42]Nikolas Patris, Ioannis Panageas:
Learning Nash Equilibria in Rank-1 Games. ICLR 2024 - [c41]Iosif Sakos, Stefanos Leonardos, Stelios Andrew Stavroulakis, Will Overman, Ioannis Panageas, Georgios Piliouras:
Beating Price of Anarchy and Gradient Descent without Regret in Potential Games. ICLR 2024 - [c40]Andreas Kontogiannis, Vasilis Pollatos, Sotiris Kanellopoulos, Panayotis Mertikopoulos, Aris Pagourtzis, Ioannis Panageas:
The Computational Complexity of Finding Second-Order Stationary Points. ICML 2024 - [i39]Leello Tadesse Dadi, Ioannis Panageas, Stratis Skoulakis, Luca Viano, Volkan Cevher:
Polynomial Convergence of Bandit No-Regret Dynamics in Congestion Games. CoRR abs/2401.09628 (2024) - [i38]Nikolas Patris, Stelios Stavroulakis, Fivos Kalogiannis, Rose Zhang, Ioannis Panageas:
Computing Nash Equilibria in Potential Games with Private Uncoupled Constraints. CoRR abs/2402.07797 (2024) - [i37]Yi Feng, Ping Li, Ioannis Panageas, Xiao Wang:
Last-iterate Convergence Separation between Extra-gradient and Optimism in Constrained Periodic Games. CoRR abs/2406.10605 (2024) - 2023
- [c39]Sai Ganesh Nagarajan, Gerasimos Palaiopanos, Ioannis Panageas, Tushar Vaidya, Samson Yu:
Mean Estimation of Truncated Mixtures of Two Gaussians: A Gradient Based Approach. AAAI 2023: 9260-9267 - [c38]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 - [c37]Fivos Kalogiannis, Ioannis Panageas, Emmanouil V. Vlatakis-Gkaragkounis:
Towards convergence to Nash equilibria in two-team zero-sum games. ICLR 2023 - [c36]Ioannis Panageas, Stratis Skoulakis, Luca Viano, Xiao Wang, Volkan Cevher:
Semi Bandit dynamics in Congestion Games: Convergence to Nash Equilibrium and No-Regret Guarantees. ICML 2023: 26904-26930 - [c35]Ioannis Anagnostides, Ioannis Panageas, Gabriele Farina, Tuomas Sandholm:
On the Convergence of No-Regret Learning Dynamics in Time-Varying Games. NeurIPS 2023 - [c34]Yi Feng, Hu Fu, Qun Hu, Ping Li, Ioannis Panageas, Bo Peng, Xiao Wang:
On the Last-iterate Convergence in Time-varying Zero-sum Games: Extra Gradient Succeeds where Optimism Fails. NeurIPS 2023 - [c33]Fivos Kalogiannis, Ioannis Panageas:
Zero-sum Polymatrix Markov Games: Equilibrium Collapse and Efficient Computation of Nash Equilibria. NeurIPS 2023 - [c32]Ioannis Panageas, Nikolas Patris, Stratis Skoulakis, Volkan Cevher:
Exponential Lower Bounds for Fictitious Play in Potential Games. NeurIPS 2023 - [c31]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 - [i36]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) - [i35]Ioannis Anagnostides, Ioannis Panageas, Gabriele Farina, Tuomas Sandholm:
On the Convergence of No-Regret Learning Dynamics in Time-Varying Games. CoRR abs/2301.11241 (2023) - [i34]Fivos Kalogiannis, Ioannis Panageas:
Zero-sum Polymatrix Markov Games: Equilibrium Collapse and Efficient Computation of Nash Equilibria. CoRR abs/2305.14329 (2023) - [i33]Ioannis Panageas, Stratis Skoulakis, Luca Viano, Xiao Wang, Volkan Cevher:
Semi Bandit Dynamics in Congestion Games: Convergence to Nash Equilibrium and No-Regret Guarantees. CoRR abs/2306.15543 (2023) - [i32]Ioannis Panageas, Nikolas Patris, Stratis Skoulakis, Volkan Cevher:
Exponential Lower Bounds for Fictitious Play in Potential Games. CoRR abs/2310.02387 (2023) - [i31]Yi Feng, Hu Fu, Qun Hu, Ping Li, Ioannis Panageas, Bo Peng, Xiao Wang:
On the Last-iterate Convergence in Time-varying Zero-sum Games: Extra Gradient Succeeds where Optimism Fails. CoRR abs/2310.02604 (2023) - [i30]Ioannis Anagnostides, Ioannis Panageas, Gabriele Farina, Tuomas Sandholm:
Optimistic Policy Gradient in Multi-Player Markov Games with a Single Controller: Convergence Beyond the Minty Property. CoRR abs/2312.12067 (2023) - 2022
- [c30]Roy Fox, Stephen M. McAleer, Will Overman, Ioannis Panageas:
Independent Natural Policy Gradient always converges in Markov Potential Games. AISTATS 2022: 4414-4425 - [c29]Stefanos Leonardos, Will Overman, Ioannis Panageas, Georgios Piliouras:
Global Convergence of Multi-Agent Policy Gradient in Markov Potential Games. ICLR 2022 - [c28]Ioannis Anagnostides, Ioannis Panageas, Gabriele Farina, Tuomas Sandholm:
On Last-Iterate Convergence Beyond Zero-Sum Games. ICML 2022: 536-581 - [c27]Yi Feng, Ioannis Panageas, Xiao Wang:
Accelerated Multiplicative Weights Update Avoids Saddle Points Almost Always. IJCAI 2022: 1811-1817 - [c26]Ioannis Anagnostides, Gabriele Farina, Ioannis Panageas, Tuomas Sandholm:
Optimistic Mirror Descent Either Converges to Nash or to Strong Coarse Correlated Equilibria in Bimatrix Games. NeurIPS 2022 - [c25]Vaggos Chatziafratis, Ioannis Panageas, Clayton Sanford, Stelios Stavroulakis:
On Scrambling Phenomena for Randomly Initialized Recurrent Networks. NeurIPS 2022 - [c24]Ioannis Anagnostides, Ioannis Panageas:
Frequency-Domain Representation of First-Order Methods: A Simple and Robust Framework of Analysis. SOSA 2022: 131-160 - [i29]Ioannis Anagnostides, Ioannis Panageas, Gabriele Farina, Tuomas Sandholm:
On Last-Iterate Convergence Beyond Zero-Sum Games. CoRR abs/2203.12056 (2022) - [i28]Ioannis Anagnostides, Gabriele Farina, Ioannis Panageas, Tuomas Sandholm:
Optimistic Mirror Descent Either Converges to Nash or to Strong Coarse Correlated Equilibria in Bimatrix Games. CoRR abs/2203.12074 (2022) - [i27]Yi Feng, Ioannis Panageas, Xiao Wang:
Accelerated Multiplicative Weights Update Avoids Saddle Points almost always. CoRR abs/2204.11407 (2022) - [i26]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) - [i25]Vaggos Chatziafratis, Ioannis Panageas, Clayton Sanford, Stelios Andrew Stavroulakis:
On Scrambling Phenomena for Randomly Initialized Recurrent Networks. CoRR abs/2210.05212 (2022) - 2021
- [c23]Qi Lei, Sai Ganesh Nagarajan, Ioannis Panageas, Xiao Wang:
Last iterate convergence in no-regret learning: constrained min-max optimization for convex-concave landscapes. AISTATS 2021: 1441-1449 - [c22]Arnab Bhattacharyya, Rathin Desai, Sai Ganesh Nagarajan, Ioannis Panageas:
Efficient Statistics for Sparse Graphical Models from Truncated Samples. AISTATS 2021: 1450-1458 - [i24]Stefanos Leonardos, Will Overman, Ioannis Panageas, Georgios Piliouras:
Global Convergence of Multi-Agent Policy Gradient in Markov Potential Games. CoRR abs/2106.01969 (2021) - [i23]Ioannis Panageas, Thorben Tröbst, Vijay V. Vazirani:
Combinatorial Algorithms for Matching Markets via Nash Bargaining: One-Sided, Two-Sided and Non-Bipartite. CoRR abs/2106.02024 (2021) - [i22]Roy Fox, Stephen McAleer, Will Overman, Ioannis Panageas:
Independent Natural Policy Gradient Always Converges in Markov Potential Games. CoRR abs/2110.10614 (2021) - [i21]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
- [c21]Constantinos Daskalakis, Nishanth Dikkala, Ioannis Panageas:
Logistic regression with peer-group effects via inference in higher-order Ising models. AISTATS 2020: 3653-3663 - [c20]Sai Ganesh Nagarajan, Ioannis Panageas:
On the Analysis of EM for truncated mixtures of two Gaussians. ALT 2020: 634-659 - [c19]Vaggos Chatziafratis, Sai Ganesh Nagarajan, Ioannis Panageas, Xiao Wang:
Depth-Width Trade-offs for ReLU Networks via Sharkovsky's Theorem. ICLR 2020 - [c18]Vaggos Chatziafratis, Sai Ganesh Nagarajan, Ioannis Panageas:
Better depth-width trade-offs for neural networks through the lens of dynamical systems. ICML 2020: 1469-1478 - [c17]Xiao Wang, Qi Lei, Ioannis Panageas:
Fast Convergence of Langevin Dynamics on Manifold: Geodesics meet Log-Sobolev. NeurIPS 2020 - [i20]Qi Lei, Sai Ganesh Nagarajan, Ioannis Panageas, Xiao Wang:
Last iterate convergence in no-regret learning: constrained min-max optimization for convex-concave landscapes. CoRR abs/2002.06768 (2020) - [i19]Ioannis Panageas, Stratis Skoulakis, Antonios Varvitsiotis, Xiao Wang:
Convergence to Second-Order Stationarity for Non-negative Matrix Factorization: Provably and Concurrently. CoRR abs/2002.11323 (2020) - [i18]Vaggos Chatziafratis, Sai Ganesh Nagarajan, Ioannis Panageas:
Better Depth-Width Trade-offs for Neural Networks through the lens of Dynamical Systems. CoRR abs/2003.00777 (2020) - [i17]Constantinos Daskalakis, Nishanth Dikkala, Ioannis Panageas:
Logistic-Regression with peer-group effects via inference in higher order Ising models. CoRR abs/2003.08259 (2020) - [i16]Arnab Bhattacharyya, Rathin Desai, Sai Ganesh Nagarajan, Ioannis Panageas:
Efficient Statistics for Sparse Graphical Models from Truncated Samples. CoRR abs/2006.09735 (2020) - [i15]Xiao Wang, Qi Lei, Ioannis Panageas:
Fast Convergence of Langevin Dynamics on Manifold: Geodesics meet Log-Sobolev. CoRR abs/2010.05263 (2020)
2010 – 2019
- 2019
- [j1]Jason D. Lee, Ioannis Panageas, Georgios Piliouras, Max Simchowitz, Michael I. Jordan, Benjamin Recht:
First-order methods almost always avoid strict saddle points. Math. Program. 176(1-2): 311-337 (2019) - [c16]Ioannis Panageas, Georgios Piliouras, Xiao Wang:
Multiplicative Weights Updates as a distributed constrained optimization algorithm: Convergence to second-order stationary points almost always. ICML 2019: 4961-4969 - [c15]Constantinos Daskalakis, Ioannis Panageas:
Last-Iterate Convergence: Zero-Sum Games and Constrained Min-Max Optimization. ITCS 2019: 27:1-27:18 - [c14]Ioannis Panageas, Georgios Piliouras, Xiao Wang:
First-order methods almost always avoid saddle points: The case of vanishing step-sizes. NeurIPS 2019: 6471-6480 - [c13]Constantinos Daskalakis, Nishanth Dikkala, Ioannis Panageas:
Regression from dependent observations. STOC 2019: 881-889 - [i14]Sai Ganesh Nagarajan, Ioannis Panageas:
On the Convergence of EM for truncated mixtures of two Gaussians. CoRR abs/1902.06958 (2019) - [i13]Constantinos Daskalakis, Nishanth Dikkala, Ioannis Panageas:
Regression from Dependent Observations. CoRR abs/1905.03353 (2019) - [i12]Vaggos Chatziafratis, Sai Ganesh Nagarajan, Ioannis Panageas, Xiao Wang:
Depth-Width Trade-offs for ReLU Networks via Sharkovsky's Theorem. CoRR abs/1912.04378 (2019) - 2018
- [c12]Constantinos Daskalakis, Ioannis Panageas:
The Limit Points of (Optimistic) Gradient Descent in Min-Max Optimization. NeurIPS 2018: 9256-9266 - [c11]Tung Mai, Milena Mihail, Ioannis Panageas, Will Ratcliff, Vijay V. Vazirani, Peter Yunker:
Cycles in Zero-Sum Differential Games and Biological Diversity. EC 2018: 339-350 - [i11]Constantinos Daskalakis, Ioannis Panageas:
The Limit Points of (Optimistic) Gradient Descent in Min-Max Optimization. CoRR abs/1807.03907 (2018) - [i10]Constantinos Daskalakis, Ioannis Panageas:
Last-Iterate Convergence: Zero-Sum Games and Constrained Min-Max Optimization. CoRR abs/1807.04252 (2018) - 2017
- [c10]Tung Mai, Ioannis Panageas, Vijay V. Vazirani:
Opinion Dynamics in Networks: Convergence, Stability and Lack of Explosion. ICALP 2017: 140:1-140:14 - [c9]Ioannis Panageas, Georgios Piliouras:
Gradient Descent Only Converges to Minimizers: Non-Isolated Critical Points and Invariant Regions. ITCS 2017: 2:1-2:12 - [c8]Ruta Mehta, Ioannis Panageas, Georgios Piliouras, Prasad Tetali, Vijay V. Vazirani:
Mutation, Sexual Reproduction and Survival in Dynamic Environments. ITCS 2017: 16:1-16:29 - [c7]Gerasimos Palaiopanos, Ioannis Panageas, Georgios Piliouras:
Multiplicative Weights Update with Constant Step-Size in Congestion Games: Convergence, Limit Cycles and Chaos. NIPS 2017: 5872-5882 - [i9]Gerasimos Palaiopanos, Ioannis Panageas, Georgios Piliouras:
Multiplicative Weights Update with Constant Step-Size in Congestion Games: Convergence, Limit Cycles and Chaos. CoRR abs/1703.01138 (2017) - [i8]Jason D. Lee, Ioannis Panageas, Georgios Piliouras, Max Simchowitz, Michael I. Jordan, Benjamin Recht:
First-order Methods Almost Always Avoid Saddle Points. CoRR abs/1710.07406 (2017) - [i7]Tung Mai, Ioannis Panageas, Will Ratcliff, Vijay V. Vazirani, Peter Yunker:
Rock-Paper-Scissors, Differential Games and Biological Diversity. CoRR abs/1710.11249 (2017) - 2016
- [c6]Ruta Mehta, Ioannis Panageas, Georgios Piliouras, Sadra Yazdanbod:
The Computational Complexity of Genetic Diversity. ESA 2016: 65:1-65:17 - [c5]Ioannis Panageas, Nisheeth K. Vishnoi:
Mixing Time of Markov Chains, Dynamical Systems and Evolution. ICALP 2016: 63:1-63:14 - [c4]Ioannis Panageas, Georgios Piliouras:
Average Case Performance of Replicator Dynamics in Potential Games via Computing Regions of Attraction. EC 2016: 703-720 - [c3]Ioannis Panageas, Piyush Srivastava, Nisheeth K. Vishnoi:
Evolutionary Dynamics in Finite Populations Mix Rapidly. SODA 2016: 480-497 - [i6]Ioannis Panageas, Georgios Piliouras:
Gradient Descent Converges to Minimizers: The Case of Non-Isolated Critical Points. CoRR abs/1605.00405 (2016) - [i5]Tung Mai, Ioannis Panageas, Vijay V. Vazirani:
Opinion Dynamics in Networks: Convergence, Stability and Lack of Explosion. CoRR abs/1607.03881 (2016) - 2015
- [c2]Ruta Mehta, Ioannis Panageas, Georgios Piliouras:
Natural Selection as an Inhibitor of Genetic Diversity: Multiplicative Weights Updates Algorithm and a Conjecture of Haploid Genetics [Working Paper Abstract]. ITCS 2015: 73 - [i4]Ruta Mehta, Ioannis Panageas, Georgios Piliouras, Prasad Tetali, Vijay V. Vazirani:
The game of survival: Sexual evolution in dynamic environments. CoRR abs/1511.01409 (2015) - 2014
- [i3]Ioannis Panageas, Georgios Piliouras:
Average Case Equilibria. CoRR abs/1403.3885 (2014) - [i2]Ruta Mehta, Ioannis Panageas, Georgios Piliouras:
Natural Selection as an Inhibitor of Genetic Diversity: Multiplicative Weights Updates Algorithm and a Conjecture of Haploid Genetics. CoRR abs/1408.6270 (2014) - [i1]Ruta Mehta, Ioannis Panageas, Georgios Piliouras, Sadra Yazdanbod:
The Complexity of Genetic Diversity: Sex with Two Chromosomes is Advantageous but Unpredictable. CoRR abs/1411.6322 (2014) - 2013
- [c1]Yong-Dian Jian, Doru Balcan, Ioannis Panageas, Prasad Tetali, Frank Dellaert:
Support-theoretic subgraph preconditioners for large-scale SLAM. IROS 2013: 9-16
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-09-04 01:20 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:
