List Decodable Mean Estimation in Nearly Linear Time

List Decodable Mean Estimation in Nearly Linear Time

IEEE FOCS: Foundations of Computer Science via YouTube Direct link

Main Algorithmic Theorem: Win-Win

4 of 8

4 of 8

Main Algorithmic Theorem: Win-Win

Class Central Classrooms beta

YouTube videos curated by Class Central.

Classroom Contents

List Decodable Mean Estimation in Nearly Linear Time

Automatically move to the next video in the Classroom when playback concludes

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

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.