~/talk

Robust List Decoding of Spherical Gaussians

links:none on file
slides:none on file

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

  1. 0:00Intro
  2. 0:11Outline
  3. 4:07Problem
  4. 10:24Hypotheses
  5. 14:07Counting
  6. 15:27Notes
  7. 18:05Summary
  8. 18:34Algorithms
  9. 19:45Identifying Errors
  10. 21:34Moderately Robust Algorithm
  11. 26:12Multifilter Case
  12. 29:58General Situation
  13. 31:10Basic Multifilter Algorithm
  14. 32:41Analysis
  15. 34:15Obstacle at -1/2
  16. 36:15Computational Difficulty
  17. 37:48Basic Idea
  18. 38:27A Failed Attempt
  19. 40:52Requirements
  20. 41:15Final Results
  21. 41:58SQ Lower Bounds
  22. 45:19Conclusion
~/search
type to search 6,249 conferences, 138,987 speakers and 185,172 talks
~/help
cmdctrl k
search every conference, speaker and series
/
focus the filter search
h
home
c
conferences
s
speakers
e
series
t
light / dark — the status bar button does the same
?
this help
esc
close this, then clear every filter — or just the search, while you are typing in it

Ignored while you are typing. Pages without a filter rail have no search to focus.