Meet the Fellows Welcome Event Fall 2023

Location

Calvin Lab Auditorium

Date

Friday, Sept. 8, 2023

Back to calendar

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

9:40 – 9:45 a.m.

Opening Remarks

9:45 – 10 a.m.

Recent Trends in Minimum Cut Algorithms

Jason Li (Simons Institute)

10 – 10:15 a.m.

Shortest paths, dynamic algorithms, and fine-grained complexity

Nicole Wein (University of Michigan)

10:15 – 10:30 a.m.

Recent advances in vertex connectivity

Sorrachai Yingchareonthawornchai (Simons Institute)

10:30 – 10:45 a.m.

Practical Graph Algorithms: Scalability and Privacy

Quanquan Liu (Simons Institute)

10:45 – 11 a.m.

Fast sparsification via convex optimization and chaining

Arun Jambulapati (University of Washington)

11 – 11:30 a.m.

Break

11:30 – 11:45 a.m.

Unifying strongly polynomial algorithms for subclasses of Linear Programs

Bento Natura (Georgia Tech)

11:45 a.m. – 12 p.m.

Faster inverse maintenance for faster conic programming

Shunhua Jiang (Columbia University)

12 – 12:15 p.m.

Noncommutative constraint satisfaction problems

Hamoon Mousavi (Simons Institute)

12:15 – 12:30 p.m.

Quantum Cryptography in Algorithmica

William Kretschmer (Simons Institute)

12:30 – 2 p.m.

Lunch (on your own)

2 – 2:15 p.m.

Risk Convergence and Algorithmic Regularization of Discrete-Stepsize (Stochastic) Gradient Descent

Jingfeng Wu (UC Berkeley)

2:15 – 2:30 p.m.

Decoding the Maze: New Frontiers in Achieving Nash Equilibrium in AI Architectures

Emmanouil Vasileios Vlatakis Gkaragkounis (Simons Institute)

2:30 – 2:45 p.m.

From Robustness to Privacy and Back

Lydia Zakynthinou (UC Berkeley)

2:45 – 3 p.m.

What can the demand analyst learn from machine learning?

Keaton Ellis (UC Berkeley)

3 – 3:15 p.m.

Title: Research Interests and Latest Works

Mika√´l Monet (INRIA)

3:15 – 3:45 p.m.

Break

3:45 – 4 p.m.

Relational Programming

Remy Wang (UW & UCLA)

4 – 4:15 p.m.

Massively Parallel Join Algorithms

Xiao Hu (University of Waterloo)

4:15 – 4:30 p.m.

Sampling and Approximately Counting CNF Formula Solutions in the Local Lemma Regime

Weiming Feng (UC Berkeley)

4:30 – 4:45 p.m.

Probabilistic Reasoning and Learning for Trustworthy AI

YooJung Choi (Arizona State University)

4:45 – 5 p.m.

Probabilistic and Logical Circuits for Tractable Causal Reasoning

Benjie Wang (University of Oxford)