Algorithms and Complexity Seminar 2021


Noah Golowich, MIT
Sample-efficient proper PAC learning with approximate differential privacy
Speaker(s): Noah Golowich
Date: Wednesday, March 03, 2021
Time: 4:00 PM to 5:00 PM
Location: https://mit.zoom.us/j/97637459251
Contact: Quanquan Liu, quanquan@csail.mit.edu

Timothy Chu, Carnegie Mellon University (CMU)
Manhattan distances, Metric Transforms, and Kernels
Speaker(s): Timothy Chu
Date: Wednesday, March 10, 2021
Time: 4:00 PM to 5:00 PM
Location: https://mit.zoom.us/j/97637459251
Contact: Quanquan Liu, quanquan@csail.mit.edu

Omri Ben-Eliezer, Harvard University
Adversarially Robust Streaming Algorithms
Speaker(s): Omri Ben-Eliezer
Date: Wednesday, March 17, 2021
Time: 4:00 PM to 5:00 PM
Location: https://mit.zoom.us/j/97637459251
Contact: Quanquan Liu, quanquan@csail.mit.edu

Raghavendra Addanki, University of Massachusetts, Amherst
A&C Seminar: Approximation Algorithms for Learning Causal Graphs
Speaker(s): Raghavendra Addanki
Date: Wednesday, March 24, 2021
Time: 4:00 PM to 5:00 PM
Location: https://mit.zoom.us/j/97637459251
Contact: Quanquan Liu, quanquan@csail.mit.edu

Yang P. Liu, Stanford
A&C Seminar: Fully Dynamic Electrical Flows: Sparse Maxflow Faster Than Goldberg-Rao
Speaker(s): Yang P. Liu
Date: Wednesday, March 31, 2021
Time: 4:00 PM to 5:00 PM
Location: https://mit.zoom.us/j/97637459251
Contact: Quanquan Liu, quanquan@csail.mit.edu

Meena Jagadeesan, Berkeley
Inductive Bias of Multi-Channel Linear Convolutional Networks with Bounded Weight Norm
Speaker(s): Meena Jagadeesan
Date: Wednesday, April 07, 2021
Time: 12:00 PM to 1:00 PM
Location: https://mit.zoom.us/j/97637459251
Contact: Quanquan Liu, quanquan@csail.mit.edu

Sami Davies, University of Washington
A&C Seminar: Scheduling with Communication Delays via LP Hierarchies and Clustering
Speaker(s): Sami Davies
Date: Wednesday, April 14, 2021
Time: 4:00 PM to 5:00 PM
Location: https://mit.zoom.us/j/97637459251
Contact: Quanquan Liu, quanquan@csail.mit.edu

Richard Peng, Georgia Tech
A&C Seminar: Solving Sparse Linear Systems Faster than Matrix Multiplication
Speaker(s): Richard Peng
Date: Wednesday, April 21, 2021
Time: 4:00 PM to 5:00 PM
Location: https://mit.zoom.us/j/97637459251
Contact: Quanquan Liu, quanquan@csail.mit.edu

C. Seshadhri, University of California, Santa Cruz
A&C Seminar: Random walks and forbidden minors III: poly(d/eps)-time partition oracles for minor-free graph classes
Speaker(s): C. Seshadhri
Date: Wednesday, April 28, 2021
Time: 4:00 PM to 5:00 PM
Location: https://mit.zoom.us/j/97637459251
Contact: Quanquan Liu, quanquan@csail.mit.edu

Andrea Lincoln, UC Berkeley
A&C Seminar: New Techniques for Proving Fine-Grained Average-Case Hardness
Speaker(s): Andrea Lincoln
Date: Monday, May 03, 2021
Time: 3:00 PM to 4:00 PM
Location: https://mit.zoom.us/j/97637459251
Contact: Quanquan Liu, quanquan@csail.mit.edu

Josh Alman, Harvard
A&C Seminar: A Refined Laser Method and Faster Matrix Multiplication
Speaker(s): Josh Alman
Date: Wednesday, May 05, 2021
Time: 4:00 PM to 5:00 PM
Location: https://mit.zoom.us/j/97637459251
Contact: Quanquan Liu, quanquan@csail.mit.edu

Ali Vakilian, TTIC
Approximation Algorithms for Fair Clustering
Speaker(s): Ali Vakilian
Date: Monday, May 10, 2021
Time: 3:00 PM to 4:00 PM
Location: https://mit.zoom.us/j/97637459251
Contact: Quanquan Liu, quanquan@csail.mit.edu

Nika Haghtalab, Berkeley
Beyond Worst-Case Adversaries in Machine Learning
Speaker(s): Nika Haghtalab
Date: Wednesday, May 12, 2021
Time: 4:00 PM to 5:00 PM
Location: https://mit.zoom.us/j/97637459251
Contact: Quanquan Liu, quanquan@csail.mit.edu

Jane Lange, MIT
Properly learning decision trees in almost-polynomial time
Speaker(s): Jane Lange
Date: Tuesday, May 18, 2021
Time: 4:00 PM to 5:00 PM
Location: https://mit.zoom.us/j/97637459251
Contact: Quanquan Liu, quanquan@csail.mit.edu

Allen Liu, MIT
Settling the Robust Learnability of Mixtures of Gaussians
Speaker(s): Allen Liu
Date: Wednesday, May 19, 2021
Time: 4:00 PM to 5:00 PM
Location: https://mit.zoom.us/j/97637459251
Contact: Quanquan Liu, quanquan@csail.mit.edu

Thatchaphol Saranurak, University of Michigan
Dynamic graph algorithms against an adaptive adversary via Congestion Balancing
Speaker(s): Thatchaphol Saranurak
Date: Monday, May 24, 2021
Time: 3:00 PM to 4:00 PM
Location: https://mit.zoom.us/j/97637459251
Contact: Quanquan Liu, quanquan@csail.mit.edu

Santhoshini Velusamy, Harvard University
Approximability of CSPs with linear sketches
Speaker(s): Santhoshini Velusamy
Date: Wednesday, December 15, 2021
Time: 4:00 PM to 5:00 PM
Location: https://mit.zoom.us/j/94625002202?pwd=bkROYjdBZStKeUIzVlNNTU11MVp6dz09
Contact: Noah Golowich, nzg@csail.mit.edu

Zihan Tan, University of Chicago
Improved Approximation Algorithms of Graph Crossing Number
Speaker(s): Zihan Tan
Date: Wednesday, January 26, 2022
Time: 4:00 PM to 5:00 PM
Location: https://mit.zoom.us/j/94625002202?pwd=bkROYjdBZStKeUIzVlNNTU11MVp6dz09
Contact: Noah Golowich, nzg@csail.mit.edu