All talks are listed in Pacific Time. Schedule subject to change.

–
Opening Remarks
–
Recent Trends in Minimum Cut Algorithms
Jason Li (Simons Institute)
–
Shortest paths, dynamic algorithms, and fine-grained complexity
Nicole Wein (University of Michigan)
–
Recent advances in vertex connectivity
Sorrachai Yingchareonthawornchai (Simons Institute)
–
Practical Graph Algorithms: Scalability and Privacy
Quanquan Liu (Simons Institute)
–
Fast sparsification via convex optimization and chaining
Arun Jambulapati (University of Washington)
–
Break
–
Unifying strongly polynomial algorithms for subclasses of Linear Programs
Bento Natura (Georgia Tech)
–
Faster inverse maintenance for faster conic programming
Shunhua Jiang (Columbia University)
–
Noncommutative constraint satisfaction problems
Hamoon Mousavi (Simons Institute)
–
Quantum Cryptography in Algorithmica
William Kretschmer (Simons Institute)
–
Lunch (on your own)
–
Risk Convergence and Algorithmic Regularization of Discrete-Stepsize (Stochastic) Gradient Descent
Jingfeng Wu (UC Berkeley)
–
Decoding the Maze: New Frontiers in Achieving Nash Equilibrium in AI Architectures
Emmanouil Vasileios Vlatakis Gkaragkounis (Simons Institute)
–
From Robustness to Privacy and Back
Lydia Zakynthinou (UC Berkeley)
–
What can the demand analyst learn from machine learning?
Keaton Ellis (UC Berkeley)
–
Title: Research Interests and Latest Works
Mikaël Monet (INRIA)
–
Break
–
Relational Programming
Remy Wang (UW & UCLA)
–
Massively Parallel Join Algorithms
Xiao Hu (University of Waterloo)
–
Sampling and Approximately Counting CNF Formula Solutions in the Local Lemma Regime
Weiming Feng (UC Berkeley)
–
Probabilistic Reasoning and Learning for Trustworthy AI
YooJung Choi (Arizona State University)
–
Probabilistic and Logical Circuits for Tractable Causal Reasoning
Benjie Wang (University of Oxford)