Robustly Learning Mixtures of (Clusterable) Gaussians via the SoS Proofs to Algorithms Method Published 2020-10-09 Download video MP4 360p Download video MP4 720p Recommendations 58:56 Thin Shell Estimates for Maximal Affine Surface Area 1:00:56 Are LLMs the Beginning or End of NLP? 56:25 The Unreasonable Effectiveness of Spectral Graph Theory: A Confluence of Algorithms, Geometry & ... 1:06:01 Nonparametric Bayesian Methods: Models, Algorithms, and Applications I 1:08:53 Polar Codes I 1:04:46 Ultraproducts as a Bridge Between Discrete and Continuous Analysis 23:16 How good is the latest version of ChatGPT? | BBC News 12:21 the new PS4 jailbreak is sort of hilarious 1:21:19 Why Only Us: Language and Evolution 1:03:45 Nonparametric Bayesian Methods: Models, Algorithms, and Applications II 1:08:25 The Mathematics of Lattices I 28:00 The Most Underrated Concept in Number Theory 1:08:14 Cryptography: From Mathematical Magic to Secure Communication 2:07:15 Black Holes and the Quantum-Extended Church-Turing Thesis | Quantum Colloquium 1:30:15 High-Dimensional Statistics I 1:30:45 Building Human Intelligence at Scale, to Save the Next Generation from ChatGPT 1:29:49 Pairings in Cryptography 21:10 Einstein's Nine-Year Struggle to Find a Job 21:14 Interstellar Expansion WITHOUT Faster Than Light Travel 37:40 Multi horizon forecasting for limit order books Similar videos 59:28 Robustly Learning Mixtures of Arbitrary Gaussians in Polynomial Time by Santosh Vempala 25:16 STOC 2021 - Settling the Robust Learnability of Mixtures of Gaussians 28:45 Outlier-Robust clustering of Gaussians and other non-spherical mixtures 1:39:53 TCS+ Talk: double feature: Pravesh Kothari and Ankur Moitra (CMU and MIT) 44:55 Sub-Gaussian Mean Estimation in Polynomial Time 50:30 Recent Progress in Algorithmic Robust Statistics via the Sum-of-Squares Method 51:33 Learning Mixture of Gaussians using Moment Tensor 36:48 The Sum-of-Squares Approach to Clustering Non-Spherical Gaussian Mixtures 1:02:23 Pseudocalibration and SoS Lower Bounds 1:00:46 Recent Advances in Algorithmic Heavy-Tailed Statistics 39:49 Majority is Stablest: Discrete and SOS 20:14 List Decodable Mean Estimation in Nearly Linear Time 1:29:47 Session 1C - Learning 53:23 Sums of squares, moments and applications in polynomial optimization 33:30 Information/Computation Gaps in Heavy-Tailed Statistics 26:36 Limits on Low-Degree Pseudorandom Generators (Or: Sum-of-Squares Meets Program Obfuscation) 1:01:22 Polar Codes II 59:16 UW Allen School Colloquium: Jacob Steinhardt (Stanford University) 51:34 Average-Case Overcomplete Tensor Decomposition More results