Class Central is learner-supported. When you buy through links on our site, we may earn an affiliate commission.

YouTube

List Decodable Mean Estimation in Nearly Linear Time

IEEE via YouTube

Overview

Save Big on Coursera Plus. 7,000+ courses at $160 off. Limited Time Only!
Explore a 20-minute IEEE conference talk on List Decodable Mean Estimation, presented by researchers from the University of California Berkeley. Delve into the efficient algorithms for this statistical problem, including a 1/2-inefficient algorithm and the main algorithmic theorem. Learn about finding affine subspaces, generalized packing/covering solvers, and the application of Multiplicative Weights. Gain insights into the nearly linear time solution and discuss conclusions and open questions in this cutting-edge area of computational statistics.

Syllabus

List Decodable Mean Estimation in Nearly Linear Time
List Decodable Mean Estimation: a 1/2
Inefficient Algorithm
Main Algorithmic Theorem: Win-Win
Finding the Affine Subspace
Generalized Packing/Covering Solvers
Multiplicative Weights (PTZ 12)
Conclusions and Open Questions

Taught by

IEEE FOCS: Foundations of Computer Science

Reviews

Start your review of List Decodable Mean Estimation in Nearly Linear Time

Never Stop Learning.

Get personalized course recommendations, track subjects and courses with reminders, and more.

Someone learning on their laptop while sitting on the floor.