research
∙
06/29/2023
Curvature-Independent Last-Iterate Convergence for Games on Riemannian Manifolds
Numerous applications in machine learning and data analytics can be form...
share
research
∙
06/28/2023
Stochastic Methods in Variational Inequalities: Ergodicity, Bias and Refinements
For min-max optimization and variational inequalities problems (VIP) enc...
research
∙
06/01/2023
Chaos persists in large-scale multi-agent learning despite adaptive learning rates
Multi-agent learning is intrinsically harder, more unstable and unpredic...
research
∙
05/25/2023
Smoothed Complexity of SWAP in Local Graph Partitioning
We give the first quasipolynomial upper bound ϕ n^polylog(n) for the smo...
research
∙
01/05/2023
Algorithms and Complexity for Computing Nash Equilibria in Adversarial Team Games
Adversarial team games model multiplayer strategic interactions in which...
research
∙
10/17/2022
On the convergence of policy gradient methods to Nash equilibria in general stochastic games
Learning in stochastic games is a notoriously difficult problem because,...
research
∙
08/03/2022
Efficiently Computing Nash Equilibria in Adversarial Team Markov Games
Computing Nash equilibrium policies is a central problem in multi-agent ...
research
∙
07/15/2022
The Computational Complexity of Multi-player Concave Games and Kakutani Fixed Points
Introduced by the celebrated works of Debreu and Rosen in the 1950s and ...
research
∙
06/04/2022
First-Order Algorithms for Min-Max Optimization in Geodesic Metric Spaces
From optimal transport to robust dimensionality reduction, a plethora of...
research
∙
02/10/2022
Near-Optimal Statistical Query Lower Bounds for Agnostically Learning Intersections of Halfspaces with Gaussian Marginals
We consider the well-studied problem of learning intersections of halfsp...
research
∙
11/07/2021
Teamwork makes von Neumann work: Min-Max Optimization in Two-Team Zero-Sum Games
Motivated by recent advances in both theoretical and applied aspects of ...
research
∙
02/03/2021
On the Approximation Power of Two-Layer Networks of Random ReLUs
This paper considers the following question: how well can depth-two ReLU...
research
∙
01/13/2021
Solving Min-Max Optimization with Hidden Structure via Gradient Descent Ascent
Many recent AI architectures are inspired by zero-sum games, however, th...
research
∙
01/12/2021
Survival of the strictest: Stable and unstable equilibria under regularized learning with partial information
In this paper, we examine the Nash equilibrium convergence properties of...
research
∙
11/12/2020
Optimal Private Median Estimation under Minimal Distributional Assumptions
We study the fundamental task of estimating the median of an underlying ...
research
∙
10/19/2020
No-regret learning and mixed Nash equilibria: They do not mix
Understanding the behavior of no-regret dynamics in general N-player gam...
research
∙
07/19/2020
Reconstructing weighted voting schemes from partial information about their power indices
A number of recent works [Goldberg 2006; O'Donnell and Servedio 2011; De...
research
∙
11/23/2019
Smoothed complexity of local Max-Cut and binary Max-CSP
We show that the smoothed complexity of the FLIP algorithm for local Max...
research
∙
10/29/2019
Efficiently avoiding saddle points with zero order methods: No gradients required
We consider the case of derivative-free algorithms for non-convex optimi...
research
∙
10/28/2019
