Robustly Learning Mixtures of (Clusterable) Gaussians via the SoS Proofs to Algorithms Method
Published 2020-10-09Download video
Recommendations
-
58:56 Thin Shell Estimates for Maximal Affine Surface Area
-
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:04:46 Ultraproducts as a Bridge Between Discrete and Continuous Analysis
-
1:21:19 Why Only Us: Language and Evolution
-
14:21 Your understanding of evolution is incomplete. Here's why
-
1:00:56 Are LLMs the Beginning or End of NLP?
-
1:08:14 Cryptography: From Mathematical Magic to Secure Communication
-
1:03:45 Nonparametric Bayesian Methods: Models, Algorithms, and Applications II
-
1:20:35 The Arrow of Time in Causal Networks
-
28:00 The Most Underrated Concept in Number Theory
-
25:36 Why There Are Multiple Sizes of Infinity
-
37:40 Multi horizon forecasting for limit order books
-
53:41 Fully Homomorphic Encryption
-
1:20:32 The INSANE Race for AI Humanoid Robots
-
48:12 Andrew Lo on the Future of Finance
-
1:08:53 Polar Codes I
-
46:25 Programming with Categories - Lecture 0
-
06:29 Alien Megastructure Candidates – Not as Crazy as it Sounds!
-
1:29:49 Pairings in Cryptography
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
-
36:48 The Sum-of-Squares Approach to Clustering Non-Spherical Gaussian Mixtures
-
51:33 Learning Mixture of Gaussians using Moment Tensor
-
50:30 Recent Progress in Algorithmic Robust Statistics via the Sum-of-Squares Method
-
1:02:23 Pseudocalibration and SoS Lower Bounds
-
1:00:46 Recent Advances in Algorithmic Heavy-Tailed Statistics
-
1:29:47 Session 1C - Learning
-
20:14 List Decodable Mean Estimation in Nearly Linear Time
-
39:49 Majority is Stablest: Discrete and SOS
-
53:23 Sums of squares, moments and applications in polynomial optimization
-
1:01:22 Polar Codes II
-
33:30 Information/Computation Gaps in Heavy-Tailed Statistics
-
51:34 Average-Case Overcomplete Tensor Decomposition
-
26:36 Limits on Low-Degree Pseudorandom Generators (Or: Sum-of-Squares Meets Program Obfuscation)
-
56:37 How to Grow a Mind: Statistics, Structure and Abstraction