1 citations · 1 across the 2 of their papers we have counts for
3 papers
Extremal combinatorics, iterated pigeonhole arguments, and generalizations of PPP
Amol Pasarkar, Mihalis Yannakakis, Christos Papadimitriou
We study the complexity of computational problems arising from existence theorems in extremal combinatorics. For some of these problems, a solution is guaranteed to exist based on…
Memory Bounds for Continual Learning
Xi Chen, Christos Papadimitriou, Binghui Peng
Continual learning, or lifelong learning, is a formidable current challenge to machine learning. It requires the learner to solve a sequence of different learning tasks, one af…
Nash, Conley, and Computation: Impossibility and Incompleteness in Game Dynamics
Jason Milionis, Christos Papadimitriou, Georgios Piliouras +1
Under what conditions do the behaviors of players, who play a game repeatedly, converge to a Nash equilibrium? If one assumes that the players' behavior is a discrete-time or conti…