Explore robust list decoding of spherical Gaussians in this 49-minute lecture by Daniel Kane from UC San Diego. Delve into the intricacies of robust and high-dimensional statistics, covering topics such as problem hypotheses, counting notes, algorithms for identifying errors, and the multifilter case. Examine the general situation, basic multifilter algorithm, analysis, and computational difficulties. Investigate failed attempts, requirements, and final results, including SQ lower bounds. Gain insights into this complex statistical topic through a comprehensive outline that progresses from introduction to conclusion.
Robust List Decoding of Spherical Gaussians
Overview
Syllabus
Intro
Outline
Problem
Hypotheses
Counting
Notes
Summary
Algorithms
Identifying Errors
Moderately Robust Algorithm
Multifilter Case
General Situation
Basic Multifilter Algorithm
Analysis
Obstacle at -1/2
Computational Difficulty
Basic Idea
A Failed Attempt
Requirements
Final Results
SQ Lower Bounds
Conclusion
Taught by
Simons Institute
