Past Program Activities

CCSI Reading Group: Algorithmic Obstructions in the Number Partitioning Problem
Speaker: Eren Kızıldağ (MIT)
Sep. 21, 2021
Program: Computational Complexity of Statistical Inference
GMOS Working Group: Complexity of Sampling
Sep. 21, 2021
Program: Geometric Methods in Optimization and Sampling
CCSI Reading Group: Statistical Query
Sep. 20, 2021
Program: Computational Complexity of Statistical Inference
CCSI Weekly Seminar: Separations Between Learning With and Without Quantum Memory
Speaker: Sitan Chen (UC Berkeley)
Sep. 20, 2021
Program: Computational Complexity of Statistical Inference
GMOS Working Group: Consensus Based Optimization
Sep. 20, 2021
Program: Geometric Methods in Optimization and Sampling
CCSI Reading Group: Cryptography and Learning
Sep. 20, 2021
Program: Computational Complexity of Statistical Inference
GMOS Working Group: Manifolds and Symmetry
Sep. 17, 2021
Program: Geometric Methods in Optimization and Sampling
GMOS Working Group: Complexity of Sampling
Sep. 17, 2021
Program: Geometric Methods in Optimization and Sampling
GMOS Working Group: Sampling with Kernelized WGD (2)
Sep. 17, 2021
Program: Geometric Methods in Optimization and Sampling
GMOS Working Group: Optimal Transport
Sep. 16, 2021
Program: Geometric Methods in Optimization and Sampling
GMOS Working Group: Consensus Based Optimization
Sep. 16, 2021
Program: Geometric Methods in Optimization and Sampling
GMOS Weekly Seminar: Runtimes of Metropolized Sampling Methods for Well-Conditioned Distributions
Speaker: Ruoqi Shen (University of Washington)
Sep. 15, 2021
Program: Geometric Methods in Optimization and Sampling
GMOS Working Group: Mean Field NN
Sep. 15, 2021
Program: Geometric Methods in Optimization and Sampling
GMOS Working Group: Complexity of Sampling
Sep. 14, 2021
Program: Geometric Methods in Optimization and Sampling
The Seeds of Stories
Speaker: Anil Ananthaswamy (Simons Institute Science Communicator in Residence)
Sep. 10, 2021
CCSI/GMOS Student Seminar
Sep. 10, 2021
Program: Geometric Methods in Optimization and Sampling
GMOS Working Group: Sampling with Kernelized WGF (1)
Sep. 10, 2021
Program: Geometric Methods in Optimization and Sampling
Meet the Fellows Welcome Event
Sep. 8 – Sep. 9, 2021
Program: Computational Complexity of Statistical Inference, Geometric Methods in Optimization and Sampling
GMOS Open Problem Session
Sep. 7, 2021
Program: Geometric Methods in Optimization and Sampling
GMOS Weekly Seminar: Non-Asymptotic Aspects of Sampling from Heavy-Tailed Distributions via Transformed Langevin Monte Carlo
Speaker: Krishna Balasubramanian (UC Davis)
Sep. 7, 2021
Program: Geometric Methods in Optimization and Sampling
CCSI Overlap Gap Property Reading Group: Low-Degree Hardness of Max Independent Set
Speaker: Alex Wein (UC Berkeley)
Sep. 7, 2021
Program: Computational Complexity of Statistical Inference
CCSI Weekly Seminar - Algorithmic Barriers for Optimizing in Random Structures Using the Overlap Gap Property
Speaker: David Gamarnik (Massachusetts Institute of Technology)
Sep. 7, 2021
Program: Computational Complexity of Statistical Inference
CCSI Open Problem Session
Sep. 3, 2021
Program: Computational Complexity of Statistical Inference
CCSI Town Hall
Aug. 30, 2021
Program: Computational Complexity of Statistical Inference
GMOS Town Hall
Aug. 27, 2021
Program: Geometric Methods in Optimization and Sampling
TFCS Program Seminar
May 11, 2021
Program: Theoretical Foundations of Computer Systems
SAT Program Seminar
May 10, 2021
Program: Satisfiability: Theory, Practice, and Beyond
Tea Time
May 5, 2021
Program: Theoretical Foundations of Computer Systems, Satisfiability: Theory, Practice, and Beyond
TFCS Program Seminar
May 4, 2021
Program: Theoretical Foundations of Computer Systems
SAT Program Seminar
May 3, 2021
Program: Satisfiability: Theory, Practice, and Beyond
Writing Workshop: Write, Write, Write Some More...
Speaker: Siobhan Roberts (Science Communicator in Residence, Simons Institute)
Apr. 30, 2021
Program: Theoretical Foundations of Computer Systems, Satisfiability: Theory, Practice, and Beyond
Tea Time
Apr. 28, 2021
Program: Theoretical Foundations of Computer Systems, Satisfiability: Theory, Practice, and Beyond
TFCS Program Seminar
Apr. 27, 2021
Program: Theoretical Foundations of Computer Systems
SAT Program Seminar
Apr. 26, 2021
Program: Satisfiability: Theory, Practice, and Beyond
Tea Time
Apr. 21, 2021
Program: Theoretical Foundations of Computer Systems, Satisfiability: Theory, Practice, and Beyond
TFCS Program Seminar
Apr. 20, 2021
Program: Theoretical Foundations of Computer Systems
SAT Program Seminar
Apr. 19, 2021
Program: Satisfiability: Theory, Practice, and Beyond
Tea Time
Apr. 14, 2021
Program: Theoretical Foundations of Computer Systems, Satisfiability: Theory, Practice, and Beyond
TFCS Program Seminar
Apr. 13, 2021
Program: Theoretical Foundations of Computer Systems
SAT Program Seminar
Apr. 12, 2021
Program: Satisfiability: Theory, Practice, and Beyond
Tea Time
Apr. 7, 2021
Program: Theoretical Foundations of Computer Systems, Satisfiability: Theory, Practice, and Beyond
TFCS Program Seminar
Apr. 6, 2021
Program: Theoretical Foundations of Computer Systems
SAT Program Seminar
Apr. 5, 2021
Program: Satisfiability: Theory, Practice, and Beyond
Tea Time
Mar. 31, 2021
Program: Theoretical Foundations of Computer Systems, Satisfiability: Theory, Practice, and Beyond
TFCS Program Seminar
Mar. 30, 2021
Program: Theoretical Foundations of Computer Systems
SAT Program Seminar
Mar. 29, 2021
Program: Satisfiability: Theory, Practice, and Beyond
Tea Time
Mar. 24, 2021
Program: Theoretical Foundations of Computer Systems, Satisfiability: Theory, Practice, and Beyond
TFCS Program Seminar
Mar. 23, 2021
Program: Theoretical Foundations of Computer Systems
SAT Program Seminar
Mar. 22, 2021
Program: Satisfiability: Theory, Practice, and Beyond
Tea Time
Mar. 17, 2021
Program: Theoretical Foundations of Computer Systems, Satisfiability: Theory, Practice, and Beyond
TFCS Program Seminar
Mar. 16, 2021
Program: Theoretical Foundations of Computer Systems
SAT Program Seminar
Mar. 15, 2021
Program: Satisfiability: Theory, Practice, and Beyond
Tea Time
Mar. 10, 2021
Program: Theoretical Foundations of Computer Systems, Satisfiability: Theory, Practice, and Beyond
TFCS Program Seminar
Mar. 9, 2021
Program: Theoretical Foundations of Computer Systems
SAT Program Seminar
Mar. 8, 2021
Program: Satisfiability: Theory, Practice, and Beyond
Tea Time
Mar. 3, 2021
Program: Theoretical Foundations of Computer Systems, Satisfiability: Theory, Practice, and Beyond
TFCS Program Seminar
Mar. 2, 2021
Program: Theoretical Foundations of Computer Systems
SAT Program Seminar
Mar. 1, 2021
Program: Satisfiability: Theory, Practice, and Beyond
Tea Time
Feb. 24, 2021
Program: Theoretical Foundations of Computer Systems, Satisfiability: Theory, Practice, and Beyond
TFCS Program Seminar
Feb. 23, 2021
Program: Theoretical Foundations of Computer Systems
SAT Program Seminar
Feb. 22, 2021
Program: Satisfiability: Theory, Practice, and Beyond
Tea Time
Feb. 17, 2021
Program: Theoretical Foundations of Computer Systems, Satisfiability: Theory, Practice, and Beyond
SAT Program Seminar
Feb. 15, 2021
Program: Satisfiability: Theory, Practice, and Beyond
Tea Time
Feb. 10, 2021
Program: Theoretical Foundations of Computer Systems, Satisfiability: Theory, Practice, and Beyond
SAT Program Seminar
Feb. 8, 2021
Program: Satisfiability: Theory, Practice, and Beyond
Tea Time
Feb. 3, 2021
Program: Theoretical Foundations of Computer Systems, Satisfiability: Theory, Practice, and Beyond
Tea Time
Jan. 27, 2021
Program: Theoretical Foundations of Computer Systems, Satisfiability: Theory, Practice, and Beyond
[TFCS] Town Hall
Jan. 22, 2021
Program: Theoretical Foundations of Computer Systems
[SAT] Town Hall
Jan. 21, 2021
Program: Satisfiability: Theory, Practice, and Beyond
Fellows Welcome Event
Jan. 20, 2021
Program: Satisfiability: Theory, Practice, and Beyond, Theoretical Foundations of Computer Systems
Discord Webinar
Jan. 19, 2021
Program: Satisfiability: Theory, Practice, and Beyond, Theoretical Foundations of Computer Systems
Spring 2021 Orientation
Jan. 14, 2021
Program: Satisfiability: Theory, Practice, and Beyond, Theoretical Foundations of Computer Systems
Reading Group: Causality and Econometrics
Dec. 18, 2020
Program: Theory of Reinforcement Learning
Open Problem Discussion
Dec. 16, 2020
Program: Theory of Reinforcement Learning
Reading Group: Deep RL and Function Approximation
Dec. 16, 2020
Program: Theory of Reinforcement Learning
Reading Group: Causality and Econometrics
Dec. 11, 2020
Program: Theory of Reinforcement Learning
Open Problem Discussion
Dec. 9, 2020
Program: Theory of Reinforcement Learning
Reading Group: Deep RL and Function Approximation
Dec. 9, 2020
Program: Theory of Reinforcement Learning
Inference on Random Factor Graphs
Speaker: Amin Coja-Oghlan, Goethe University
Dec. 8, 2020
Program: Probability, Geometry, and Computation in High Dimensions
Writing About Technical Topics for a General Audience
Speaker: Brian Christian
Dec. 7, 2020
Program: Theory of Reinforcement Learning, Probability, Geometry, and Computation in High Dimensions
Reading Group: Causality and Econometrics
Dec. 4, 2020
Program: Theory of Reinforcement Learning
Open Problem Discussion
Dec. 2, 2020
Program: Theory of Reinforcement Learning
Reading Group: Deep RL and Function Approximation
Dec. 2, 2020
Program: Theory of Reinforcement Learning
Computational/Statistical Gaps for Learning Neural Networks
Speaker: Adam Klivans (University of Texas, Austin)
Dec. 1, 2020
Program: Probability, Geometry, and Computation in High Dimensions
Reading Group: Causality and Econometrics
Nov. 27, 2020
Program: Theory of Reinforcement Learning
Open Problem Discussion
Nov. 25, 2020
Program: Theory of Reinforcement Learning
Reading Group: Deep RL and Function Approximation
Nov. 25, 2020
Program: Theory of Reinforcement Learning
Is Reinforcement Learning More Difficult Than Bandits? A Near-optimal Algorithm Escaping the Curse of Horizon
Speaker: Simon S. Du (University of Washington)
Nov. 24, 2020
Program: Theory of Reinforcement Learning
Reading Group: Causality and Econometrics
Nov. 20, 2020
Program: Theory of Reinforcement Learning
Fellows Talk - Christina Yu
Speaker: Christina Yu (Cornell University)
Nov. 19, 2020
Program: Probability, Geometry, and Computation in High Dimensions, Theory of Reinforcement Learning
Open Problem Discussion
Nov. 18, 2020
Program: Theory of Reinforcement Learning
Reading Group: Deep RL and Function Approximation
Nov. 18, 2020
Program: Theory of Reinforcement Learning
Black-Box Control for Linear Dynamical Systems
Speaker: Xinyi Chen (Google / Princeton)
Nov. 17, 2020
Program: Theory of Reinforcement Learning
Reading Group: Causality and Econometrics
Nov. 13, 2020
Program: Theory of Reinforcement Learning
Fellows Talk - Vidya Muthukumar
Speaker: Vidya Muthukumar (UC Berkeley)
Nov. 12, 2020
Program: Probability, Geometry, and Computation in High Dimensions, Theory of Reinforcement Learning
Open Problem Discussion
Nov. 11, 2020
Program: Theory of Reinforcement Learning
Reading Group: Deep RL and Function Approximation
Nov. 11, 2020
Program: Theory of Reinforcement Learning
The Planted Matching Problem
Speaker: Cris Moore (Santa Fe Institute)
Nov. 10, 2020
Program: Probability, Geometry, and Computation in High Dimensions
PC-PG: Policy Cover Directed Exploration for Provable Policy Gradient Learning
Speaker: Alekh Agarwal (Google / Princeton)
Nov. 10, 2020
Program: Theory of Reinforcement Learning
Reading Group: Causality and Econometrics
Nov. 6, 2020
Program: Theory of Reinforcement Learning

Pages