Webcast Events - TAU Theory-Fest

TAU Theory-Fest

TAU Theory-Fest

Date: 29-30.12.19

What Needs to be Added to Machine Learning?

no-video-preview

What Needs to be Added to Machine Learning?

Lecturer(s) Leslie Valiant (Harvard)
Location Check Point Auditorium
Date Sunday, 29 December 2019

Published in TAU Theory-Fest

Matching is as Easy as the Decision Problem, in the NC Model

no-video-preview

Matching is as Easy as the Decision Problem, in the NC Model

Lecturer(s) Vijay Vazirani (University of California, Irvine)
Location Check Point Auditorium
Date Sunday, 29 December 2019

Published in TAU Theory-Fest

Learning Fast Requires Good Memory: Time-Space Tradeoff Lower Bounds for Learning

no-video-preview

Learning Fast Requires Good Memory: Time-Space Tradeoff Lower Bounds for Learning

Lecturer(s) Ran Raz (Princeton)
Location Check Point Auditorium
Date Sunday, 29 December 2019

Published in TAU Theory-Fest

Continuous LWE and robust machine learning

no-video-preview

Continuous LWE and robust machine learning

Lecturer(s) Oded Regev (NYU)
Location Check Point Auditorium
Date Sunday, 29 December 2019

Published in TAU Theory-Fest

Simplicity and Complexity of Belief Propagation

no-video-preview

Simplicity and Complexity of Belief Propagation

Lecturer(s) Elchanan Mossel (MIT)
Location Check Point Auditorium
Date Sunday, 29 December 2019

Published in TAU Theory-Fest

Language, Brain, and Computation

no-video-preview

Language, Brain, and Computation

Lecturer(s) Christos Papadimitriou (Columbia)
Location Jaglom Auditorium
Date Monday, 30 December 2019

Published in TAU Theory-Fest

Algorithms and the Law

no-video-preview

Algorithms and the Law

Lecturer(s) Shafi Goldwasser (UC Berkeley)
Location Jaglom Auditorium
Date Monday, 30 December 2019

Published in TAU Theory-Fest

Computer Science Foundations of Algorithmic Fairness

no-video-preview

Computer Science Foundations of Algorithmic Fairness

Lecturer(s) Omer Reingold (Stanford University)
Location Jaglom Auditorium
Date Monday, 30 December 2019

Published in TAU Theory-Fest

Hardness of Approximation: From the PCP Theorem to the 2-to-2 Games Theorem

no-video-preview

Hardness of Approximation: From the PCP Theorem to the 2-to-2 Games Theorem

Lecturer(s) Subhash Khot (NYU)
Location Jaglom Auditorium
Date Monday, 30 December 2019

Published in TAU Theory-Fest

Online learning, competitive analysis, and the shadows of gradient descent

no-video-preview

Online learning, competitive analysis, and the shadows of gradient descent

Lecturer(s) James R. Lee (University of Washington)
Location Jaglom Auditorium
Date Monday, 30 December 2019

Published in TAU Theory-Fest

You are here:Computers/TAU Theory-Fest