Главная
Study mode:
on
1
Introduction
2
What people think
3
Coins coin tossing
4
How accurate is this estimate
5
Can you do better
6
Information Theoretic Proof
7
High Dimension
8
Estimating the difference
9
What does this mean mathematically
10
The packing number
11
Information computation gap
12
Reductions
13
Rough idea
14
Classes of algorithms
15
Optimal statistical accuracy
16
Questions
Description:
Explore the complexities of statistical estimation and learning in this Richard M. Karp Distinguished Lecture delivered by Andrea Montanari from Stanford University. Delve into topics such as coin tossing accuracy, information theoretic proofs, high-dimensional estimation, and the information computation gap. Examine the concept of packing numbers, various reduction techniques, and different classes of algorithms. Gain insights into optimal statistical accuracy and engage with thought-provoking questions in this comprehensive talk on computational barriers in the field of statistics and machine learning.

Computational Barriers in Statistical Estimation and Learning

Simons Institute
Add to list
0:00 / 0:00