Algorithmic High Dimensional Robust Statistics I

Channel:
United States Simons Institute for the Theory of Computing
Subscribers:
68,700
Published on ● Video Link: https://www.youtube.com/watch?v=kOUDbhycAl0


Duration: 59:55
2,014 views
16

Ilias Diakonikolas, University of Southern California
https://simons.berkeley.edu/talks/clone-clone-clone-sketching-linear-algebra-i-basics-dim-reduction
Foundations of Data Science Boot Camp



Other Videos By Simons Institute for the Theory of Computing


2018-09-07A Surge-type Pricing in Ridesharing Systems is Stability Optimal
2018-09-07Excursions of Max-weight Dynamics
2018-09-07Incentive Compatibility in Stochastic Dynamic Systems
2018-09-07Opening Remarks
2018-09-06Through Two Doors at Once
2018-08-31Data Streams II
2018-08-31Data Streams I
2018-08-31Nearest Neighbor Methods II
2018-08-31Nearest Neighbor Methods I
2018-08-30Algorithmic High Dimensional Robust Statistics II
2018-08-30Algorithmic High Dimensional Robust Statistics I
2018-08-30High Dimensional Geometry and Concentration II
2018-08-30High Dimensional Geometry and Concentration I
2018-08-29Statistical Inference II
2018-08-29Statistical Inference I
2018-08-29Stochastic Second Order Optimization Methods II
2018-08-29Stochastic Second Order Optimization Methods I
2018-08-28Sampling for Linear Algebra, Statistics, and Optimization II
2018-08-28Sampling for Linear Algebra, Statistics, and Optimization I
2018-08-28First-Order Stochastic Optimization
2018-08-28Sketching for Linear Algebra III: Randomized Hadamard, Kernel Methods


Tags:
Simons Institute
Theory of Computing
Theory of Computation
Theoretical Computer Science
Computer Science
UC Berkeley
Foundations of Data Science Boot Camp
Ilias Diakonikolas