Outlier-Robust Clustering of Gaussians and Other Non-Spherical Mixtures
Offered By: IEEE via YouTube
Course Description
Overview
Explore outlier-robust clustering techniques for Gaussian mixtures and non-spherical distributions in this 29-minute IEEE conference talk. Delve into robust statistics, focusing on the main result of robustly clustering Gaussian mixtures and its implications for robust covariance estimation. Examine why mean or covariance separation is insufficient, and learn about TV-separation to parameter separation. Investigate simplifying assumptions, anti-concentration, and an inefficient algorithm before diving into Sum-of-Squares relaxation. Gain insights from speakers representing CMU, UW Madison, Berkeley, UCSD, and UT Austin as they outline proofs and discuss high-level Sum of Squares relaxation techniques.
Syllabus
Intro
This paper: Outlier-Robust Clustering Gaussian Mixtures
Robust Statistics
Main result: Robustly clustering Gaussian Mixtures
Consequence of our techniques: Robust Covariance Estimation
Mean or covariance separation does not suffice
Lemma: TV-separation to Parameter separation
Simplifying Assumptions
A Hard Interlude
Anti-Concentration
An Inefficient Algorithm
A Sum-of-Squares Relaxation
High-Level Sum of Squares Relaxation
Proof Outline
Taught by
IEEE FOCS: Foundations of Computer Science
Tags
Related Courses
An Improved Exponential-Time Approximation Algorithm for Fully-Alternating Games Against NatureIEEE via YouTube Computation in the Brain Tutorial - Part 2
IEEE via YouTube Computation in the Brain - Part 1
IEEE via YouTube Spectral Independence in High-Dimensional Expanders and Applications to the Hardcore Model
IEEE via YouTube Cookbook Lower Bounds for Statistical Inference in Distributed and Constrained Settings - Part 1
IEEE via YouTube