Ioannis Panageas

Assistant Professor, Donald Bren School of Information and Computer Sciences, University of California, Irvine

3 papers at NeurIPS 2025

Homepage· OpenReview· Semantic Scholar· Google Scholar

Poster Session 1

1 paper

Wednesday, December 3, 2025 · 11:00 AM → 2:00 PM

Exhibit Hall C,D,E

The Complexity of Symmetric Equilibria in Min-Max Optimization and Team Zero-Sum Games

#2913 Spotlight · Ioannis Anagnostides, Ioannis Panageas, Tuomas Sandholm, Jingming Yan

We consider the computational complexity of computing stationary points in min-max optimization, with a particular focus on the special case of computing Nash equilibria in (two-)team zero-sum games.

Poster Session 4

1 paper

Thursday, December 4, 2025 · 4:30 PM → 7:30 PM

Exhibit Hall C,D,E

Efficient Kernelized Learning in Polyhedral Games beyond Full Information: From Colonel Blotto to Congestion Games

#2907 · Andreas Kontogiannis, Vasilis Pollatos, Gabriele Farina, Panayotis Mertikopoulos, Ioannis Panageas

We provide computationally efficient payoff-based learning algorithms which significantly improve upon prior work in terms of runtime for learning CCE

Poster Session 5

1 paper

Friday, December 5, 2025 · 11:00 AM → 2:00 PM

Exhibit Hall C,D,E

The Complexity of Finding Local Optima in Contrastive Learning

#3306 · Jingming Yan, Yiyuan Luo, Vaggos Chatziafratis, Ioannis Panageas, Parnian Shahkar, Stelios Andrew Stavroulakis

We investigate the computational complexity of finding local solutions for many contrastive learning settings based on triplet constraints (anchor-positive-negative paradigm), and we prove that reaching local optima cannot be done in polynomial time.