Robust List Decoding of Spherical Gaussians
Talkat Robust and High-Dimensional Statistics (Simons Institute workshop, 2018) · 2018-10-29..11-02·
summary
An algorithm uses multi-filters plus spectral checks and degree-d polynomial tests to list-decode a spherical Gaussian when only an alpha fraction of samples are good. It returns an O(1/alpha) list and proves error O(alpha^{-1/(2d)}), with quasi-polynomial samples/time pushing error toward O(sqrt(log(1/alpha))). Implementation needs roughly poly(n^d/alpha) samples and similar runtime; the method reduces detectability to multilinear tests on independent Gaussian copies and matches statistical-query lower bounds for improved error without exponential cost.
AI-written summary · about
chapters (22)
- 0:00Intro
- 0:11Outline
- 4:07Problem
- 10:24Hypotheses
- 14:07Counting
- 15:27Notes
- 18:05Summary
- 18:34Algorithms
- 19:45Identifying Errors
- 21:34Moderately Robust Algorithm
- 26:12Multifilter Case
- 29:58General Situation
- 31:10Basic Multifilter Algorithm
- 32:41Analysis
- 34:15Obstacle at -1/2
- 36:15Computational Difficulty
- 37:48Basic Idea
- 38:27A Failed Attempt
- 40:52Requirements
- 41:15Final Results
- 41:58SQ Lower Bounds
- 45:19Conclusion
related talks
29mApproximating Spherical Gaussian Mixtures
01h 00mAlgorithmic High Dimensional Robust Statistics I
39mAbove Average-Case Analysis?
01h 30mAnalytic Methods for Supervised Learning IV
01h 31mUnsupervised Learning
37mThe Sum-of-Squares Approach to Clustering Non-Spherical Gaussian Mixtures
29mComputational Barriers to Estimation from Low-Degree Polynomials
36mPrivately Learning High-Dimensional Distributions
