Theory of Computation Seminar (ToC) 2019


Arkadev Chattopadhyay, Tata Institute of Fundamental Research,
Arkadev Chattopadhyay: The Log-Approximate-Rank Conjecture is False
Speaker(s): Arkadev Chattopadhyay, Tata Institute of Fundamental Research
Date: Tuesday, March 12, 2019
Time: 4:00 PM to 5:00 PM
Location: Patil/Kiva G449
Contact: Deborah Goodwin, 617.324.7303, dlehto@csail.mit.edu

Sam Hopkins, UC Berkeley,
Sam Hopkins: How to Estimate the Mean of a Heavy-Tailed Vector in Polynomial Time
Speaker(s): Sam Hopkins, UC Berkeley
Date: Tuesday, April 09, 2019
Time: 4:00 PM to 5:00 PM
Location: Patil/Kiva G449
Contact: Deborah Goodwin, 617.324.7303, dlehto@csail.mit.edu

Yoram Singer, Princeton University,
Yoram Singer: Memory-Efficient Adaptive Optimization for Humungous-Scale Learning
Speaker(s): Yoram Singer, Princeton University
Date: Tuesday, April 23, 2019
Time: 4:00 PM to 5:00 PM
Location: Patil/Kiva G449 (Gates Bldg, Stata)
Contact: Deborah Goodwin, 617.324.7303, dlehto@csail.mit.edu

Greg Valiant,
New Problems and Perspectives on Learning, Testing, and Sampling in the Small Data Regime
Speaker(s): Greg Valiant
Date: Thursday, May 16, 2019
Time: 4:00 PM to 5:00 PM
Location: 32-G463 (Star)
Contact: Rebecca Yadegar, ryadegar@csail.mit.edu

Sepehr Assadi, Princeton University
Sublinear Algorithms for (Delta+1) Vertex Coloring
Speaker(s): Sepehr Assadi
Date: Tuesday, May 21, 2019
Time: 4:00 PM to 5:00 PM
Location: 32-G449
Contact: Joanne Talbot Hanley, 617-253-6054, joanne@csail.mit.edu