Ioannis Panageas

According to our database1, Ioannis Panageas authored at least 55 papers between 2013 and 2024.

Collaborative distances:
  • Dijkstra number2 of three.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Polynomial Convergence of Bandit No-Regret Dynamics in Congestion Games.
CoRR, 2024

Computing Nash Equilibria in Potential Games with Private Uncoupled Constraints.
Proceedings of the Thirty-Eighth AAAI Conference on Artificial Intelligence, 2024

Optimistic Policy Gradient in Multi-Player Markov Games with a Single Controller: Convergence beyond the Minty Property.
Proceedings of the Thirty-Eighth AAAI Conference on Artificial Intelligence, 2024

2023
On the Last-iterate Convergence in Time-varying Zero-sum Games: Extra Gradient Succeeds where Optimism Fails.
CoRR, 2023

Algorithms and Complexity for Computing Nash Equilibria in Adversarial Team Games.
Proceedings of the 24th ACM Conference on Economics and Computation, 2023

Exponential Lower Bounds for Fictitious Play in Potential Games.
Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023

Zero-sum Polymatrix Markov Games: Equilibrium Collapse and Efficient Computation of Nash Equilibria.
Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023

On the Last-iterate Convergence in Time-varying Zero-sum Games: Extra Gradient Succeeds where Optimism Fails.
Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023

On the Convergence of No-Regret Learning Dynamics in Time-Varying Games.
Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023

Semi Bandit dynamics in Congestion Games: Convergence to Nash Equilibrium and No-Regret Guarantees.
Proceedings of the International Conference on Machine Learning, 2023

Towards convergence to Nash equilibria in two-team zero-sum games.
Proceedings of the Eleventh International Conference on Learning Representations, 2023

Efficiently Computing Nash Equilibria in Adversarial Team Markov Games.
Proceedings of the Eleventh International Conference on Learning Representations, 2023

Mean Estimation of Truncated Mixtures of Two Gaussians: A Gradient Based Approach.
Proceedings of the Thirty-Seventh AAAI Conference on Artificial Intelligence, 2023

2022
Frequency-Domain Representation of First-Order Methods: A Simple and Robust Framework of Analysis.
Proceedings of the 5th Symposium on Simplicity in Algorithms, 2022

On Scrambling Phenomena for Randomly Initialized Recurrent Networks.
Proceedings of the Advances in Neural Information Processing Systems 35: Annual Conference on Neural Information Processing Systems 2022, 2022

Optimistic Mirror Descent Either Converges to Nash or to Strong Coarse Correlated Equilibria in Bimatrix Games.
Proceedings of the Advances in Neural Information Processing Systems 35: Annual Conference on Neural Information Processing Systems 2022, 2022

Accelerated Multiplicative Weights Update Avoids Saddle Points Almost Always.
Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence, 2022

On Last-Iterate Convergence Beyond Zero-Sum Games.
Proceedings of the International Conference on Machine Learning, 2022

Global Convergence of Multi-Agent Policy Gradient in Markov Potential Games.
Proceedings of the Tenth International Conference on Learning Representations, 2022

Independent Natural Policy Gradient always converges in Markov Potential Games.
Proceedings of the International Conference on Artificial Intelligence and Statistics, 2022

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

Combinatorial Algorithms for Matching Markets via Nash Bargaining: One-Sided, Two-Sided and Non-Bipartite.
CoRR, 2021

Last iterate convergence in no-regret learning: constrained min-max optimization for convex-concave landscapes.
Proceedings of the 24th International Conference on Artificial Intelligence and Statistics, 2021

Efficient Statistics for Sparse Graphical Models from Truncated Samples.
Proceedings of the 24th International Conference on Artificial Intelligence and Statistics, 2021

2020
Convergence to Second-Order Stationarity for Non-negative Matrix Factorization: Provably and Concurrently.
CoRR, 2020

Fast Convergence of Langevin Dynamics on Manifold: Geodesics meet Log-Sobolev.
Proceedings of the Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020, 2020

Better depth-width trade-offs for neural networks through the lens of dynamical systems.
Proceedings of the 37th International Conference on Machine Learning, 2020

Depth-Width Trade-offs for ReLU Networks via Sharkovsky's Theorem.
Proceedings of the 8th International Conference on Learning Representations, 2020

On the Analysis of EM for truncated mixtures of two Gaussians.
Proceedings of the Algorithmic Learning Theory, 2020

Logistic regression with peer-group effects via inference in higher-order Ising models.
Proceedings of the 23rd International Conference on Artificial Intelligence and Statistics, 2020

2019
First-order methods almost always avoid strict saddle points.
Math. Program., 2019

On the Convergence of EM for truncated mixtures of two Gaussians.
CoRR, 2019

Regression from dependent observations.
Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing, 2019

First-order methods almost always avoid saddle points: The case of vanishing step-sizes.
Proceedings of the Advances in Neural Information Processing Systems 32: Annual Conference on Neural Information Processing Systems 2019, 2019

Last-Iterate Convergence: Zero-Sum Games and Constrained Min-Max Optimization.
Proceedings of the 10th Innovations in Theoretical Computer Science Conference, 2019

Multiplicative Weights Updates as a distributed constrained optimization algorithm: Convergence to second-order stationary points almost always.
Proceedings of the 36th International Conference on Machine Learning, 2019

2018
Cycles in Zero-Sum Differential Games and Biological Diversity.
Proceedings of the 2018 ACM Conference on Economics and Computation, 2018

The Limit Points of (Optimistic) Gradient Descent in Min-Max Optimization.
Proceedings of the Advances in Neural Information Processing Systems 31: Annual Conference on Neural Information Processing Systems 2018, 2018

2017
Rock-Paper-Scissors, Differential Games and Biological Diversity.
CoRR, 2017

First-order Methods Almost Always Avoid Saddle Points.
CoRR, 2017

Multiplicative Weights Update with Constant Step-Size in Congestion Games: Convergence, Limit Cycles and Chaos.
Proceedings of the Advances in Neural Information Processing Systems 30: Annual Conference on Neural Information Processing Systems 2017, 2017

Gradient Descent Only Converges to Minimizers: Non-Isolated Critical Points and Invariant Regions.
Proceedings of the 8th Innovations in Theoretical Computer Science Conference, 2017

Mutation, Sexual Reproduction and Survival in Dynamic Environments.
Proceedings of the 8th Innovations in Theoretical Computer Science Conference, 2017

Opinion Dynamics in Networks: Convergence, Stability and Lack of Explosion.
Proceedings of the 44th International Colloquium on Automata, Languages, and Programming, 2017

2016
Gradient Descent Converges to Minimizers: The Case of Non-Isolated Critical Points.
CoRR, 2016

Evolutionary Dynamics in Finite Populations Mix Rapidly.
Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2016

Average Case Performance of Replicator Dynamics in Potential Games via Computing Regions of Attraction.
Proceedings of the 2016 ACM Conference on Economics and Computation, 2016

Mixing Time of Markov Chains, Dynamical Systems and Evolution.
Proceedings of the 43rd International Colloquium on Automata, Languages, and Programming, 2016

The Computational Complexity of Genetic Diversity.
Proceedings of the 24th Annual European Symposium on Algorithms, 2016

2015
The game of survival: Sexual evolution in dynamic environments.
CoRR, 2015

Natural Selection as an Inhibitor of Genetic Diversity: Multiplicative Weights Updates Algorithm and a Conjecture of Haploid Genetics [Working Paper Abstract].
Proceedings of the 2015 Conference on Innovations in Theoretical Computer Science, 2015

2014
Average Case Equilibria.
CoRR, 2014

The Complexity of Genetic Diversity: Sex with Two Chromosomes is Advantageous but Unpredictable.
CoRR, 2014

Natural Selection as an Inhibitor of Genetic Diversity: Multiplicative Weights Updates Algorithm and a Conjecture of Haploid Genetics.
CoRR, 2014

2013
Support-theoretic subgraph preconditioners for large-scale SLAM.
Proceedings of the 2013 IEEE/RSJ International Conference on Intelligent Robots and Systems, 2013


  Loading...