Efficient Online Learning and Equilibrium Computation in Non-Concave Games
UVA Theory Seminar
Weiqiang Zheng
Yale University
Based on joint work with
Costis Daskalakis� MIT
Haipeng Luo
USC
Chen-Yu Wei
Virginia
Yang Cai
Yale
Explicit Games Solved using ML & AI
Multi-player games:
Multi-agent systems:
ML Problems that are Implicitly Games
Generative Adversarial Networks
Synthetic data generation
Adversarial Training
Robustifying models against adversarial attacks
Alignment
Align AI models with human preference
4
Motivating Example: Deep Generative Models
Simple Randomness
Hallucinated Images � (from generator)
Real Images (from training set)
Real or Hallucinated?
- Reward discriminator for preferring real from fake images
- Reward generator for fooling the discriminator to prefer fake images
Non-Concave Games
Multi-Agent Setting:
…
No Nash eq!
Non-Concave Games
Multi-Agent Setting:
…
Non-Concave Games
Does exist (under compactness, continuity and smoothness) but intractable, even for 2p0s games [Daskalakis-Skoulakis-Zampetakis ‘21].
Multi-Agent Setting:
…
Question: Solution concepts that are universal and tractable in non-concave games?
CCE/CE are intractable!
Online Learning
z
…
…
…
…
Martingale analysis to guarantee high probability
�Infinite Set of Local Deviations
�Infinite Set of Local Deviations: Hardness beyond First-Order Approximation
�Hardness beyond First-Order Approximation
External
Linear
Proximal
External
Linear
Proximal
Summary