Communities
Connect sessions
AI calendar
Organizations
Join Slack
Contact Sales
Search
Open menu
Home
Papers
2011.03622
Cited By
v1
v2
v3 (latest)
Settling the Robust Learnability of Mixtures of Gaussians
6 November 2020
Allen Liu
Ankur Moitra
Re-assign community
ArXiv (abs)
PDF
HTML
Papers citing
"Settling the Robust Learnability of Mixtures of Gaussians"
33 / 33 papers shown
On the Learnability of Distribution Classes with Adaptive Adversaries
Tosca Lechner
Alex Bie
Gautam Kamath
181
1
0
05 Sep 2025
On Learning Parallel Pancakes with Mostly Uniform Weights
Ilias Diakonikolas
D. Kane
Sushrut Karmalkar
Jasper C. H. Lee
Thanasis Pittas
CoGe
258
0
0
21 Apr 2025
Factor Adjusted Spectral Clustering for Mixture Models
Shange Tang
Soham Jana
Jianqing Fan
336
2
0
22 Aug 2024
Robust Mixture Learning when Outliers Overwhelm Small Groups
Daniil Dmitriev
Rares-Darius Buhai
Stefan Tiegel
Alexander Wolters
Gleb Novikov
Amartya Sanyal
David Steurer
Fanny Yang
281
1
0
22 Jul 2024
Distribution Learnability and Robustness
Shai Ben-David
Alex Bie
Gautam Kamath
Tosca Lechner
371
5
0
25 Jun 2024
Untangling Gaussian Mixtures
International Workshop on Graph-Theoretic Concepts in Computer Science (WG), 2024
Eva Fluck
Sandra Kiefer
Christoph Standke
149
0
0
11 Mar 2024
Clustering Mixtures of Bounded Covariance Distributions Under Optimal Separation
Ilias Diakonikolas
Daniel M. Kane
Jasper C. H. Lee
Thanasis Pittas
247
1
0
19 Dec 2023
Online Robust Mean Estimation
ACM-SIAM Symposium on Discrete Algorithms (SODA), 2023
Daniel M. Kane
Ilias Diakonikolas
Hanshen Xiao
Sihan Liu
OOD
310
4
0
24 Oct 2023
SQ Lower Bounds for Learning Mixtures of Linear Classifiers
Neural Information Processing Systems (NeurIPS), 2023
Ilias Diakonikolas
D. Kane
Yuxin Sun
365
4
0
18 Oct 2023
Learning quantum Hamiltonians at any temperature in polynomial time
Symposium on the Theory of Computing (STOC), 2023
Ainesh Bakshi
Allen Liu
Ankur Moitra
Ewin Tang
346
48
0
03 Oct 2023
Mixtures of Gaussians are Privately Learnable with a Polynomial Number of Samples
International Conference on Algorithmic Learning Theory (ALT), 2023
Mohammad Afzali
H. Ashtiani
Christopher Liaw
432
7
0
07 Sep 2023
Gaussian Mixture Identifiability from degree 6 Moments
Algebraic Statistics (AS), 2023
Alexander Taveira Blomenhofer
251
4
0
07 Jul 2023
SQ Lower Bounds for Learning Bounded Covariance GMMs
Ilias Diakonikolas
D. Kane
Thanasis Pittas
Nikos Zarifis
266
0
0
22 Jun 2023
Nearly-Linear Time and Streaming Algorithms for Outlier-Robust PCA
International Conference on Machine Learning (ICML), 2023
Ilias Diakonikolas
D. Kane
Ankit Pensia
Thanasis Pittas
OOD
281
11
0
04 May 2023
A Spectral Algorithm for List-Decodable Covariance Estimation in Relative Frobenius Norm
Neural Information Processing Systems (NeurIPS), 2023
Ilias Diakonikolas
D. Kane
Jasper C. H. Lee
Ankit Pensia
Thanasis Pittas
299
1
0
01 May 2023
Polynomial Time and Private Learning of Unbounded Gaussian Mixture Models
International Conference on Machine Learning (ICML), 2023
Jamil Arbas
H. Ashtiani
Christopher Liaw
376
32
0
07 Mar 2023
Beyond Moments: Robustly Learning Affine Transformations with Asymptotically Optimal Error
IEEE Annual Symposium on Foundations of Computer Science (FOCS), 2023
He Jia
Pravesh Kothari
Santosh Vempala
230
3
0
23 Feb 2023
The Parametric Stability of Well-separated Spherical Gaussian Mixtures
Hanyu Zhang
M. Meilă
228
0
0
01 Feb 2023
Efficient Algorithms for Sparse Moment Problems without Separation
Annual Conference Computational Learning Theory (COLT), 2022
Zhiyuan Fan
Jun Yu Li
248
9
0
26 Jul 2022
Minimax Rates for Robust Community Detection
IEEE Annual Symposium on Foundations of Computer Science (FOCS), 2022
Allen Liu
Ankur Moitra
315
16
0
25 Jul 2022
List-Decodable Covariance Estimation
Symposium on the Theory of Computing (STOC), 2022
Misha Ivkov
Pravesh Kothari
249
8
0
22 Jun 2022
Robust Sparse Mean Estimation via Sum of Squares
Annual Conference Computational Learning Theory (COLT), 2022
Ilias Diakonikolas
D. Kane
Sushrut Karmalkar
Ankit Pensia
Thanasis Pittas
503
23
0
07 Jun 2022
Streaming Algorithms for High-Dimensional Robust Statistics
International Conference on Machine Learning (ICML), 2022
Ilias Diakonikolas
D. Kane
Ankit Pensia
Thanasis Pittas
327
25
0
26 Apr 2022
Robust Voting Rules from Algorithmic Robust Statistics
Allen Liu
Ankur Moitra
337
4
0
13 Dec 2021
Beyond Parallel Pancakes: Quasi-Polynomial Time Guarantees for Non-Spherical Gaussian Mixtures
Rares-Darius Buhai
David Steurer
CoGe
277
4
0
10 Dec 2021
Kalman Filtering with Adversarial Corruptions
Symposium on the Theory of Computing (STOC), 2021
Sitan Chen
Frederic Koehler
Ankur Moitra
Morris Yau
AAML
209
10
0
11 Nov 2021
Polynomial-Time Sum-of-Squares Can Robustly Estimate Mean and Covariance of Gaussians Optimally
International Conference on Algorithmic Learning Theory (ALT), 2021
Pravesh Kothari
Peter Manohar
Brian Hu Zhang
248
18
0
22 Oct 2021
Estimating Gaussian mixtures using sparse polynomial moment systems
SIAM Journal on Mathematics of Data Science (SIMODS), 2021
J. Lindberg
Carlos Améndola
J. Rodriguez
269
13
0
29 Jun 2021
Clustering Mixture Models in Almost-Linear Time via List-Decodable Mean Estimation
Ilias Diakonikolas
D. Kane
Daniel Kongsgaard
Haibin Zhang
Kevin Tian
FedML
314
22
0
16 Jun 2021
Robust Model Selection and Nearly-Proper Learning for GMMs
Neural Information Processing Systems (NeurIPS), 2021
Jungshian Li
Allen Liu
Ankur Moitra
335
3
0
05 Jun 2021
Learning GMMs with Nearly Optimal Robustness Guarantees
Annual Conference Computational Learning Theory (COLT), 2021
Allen Liu
Ankur Moitra
346
16
0
19 Apr 2021
Outlier-Robust Learning of Ising Models Under Dobrushin's Condition
Annual Conference Computational Learning Theory (COLT), 2021
Ilias Diakonikolas
D. Kane
Alistair Stewart
Yuxin Sun
234
18
0
03 Feb 2021
Robustly Learning Mixtures of
k
k
k
Arbitrary Gaussians
Symposium on the Theory of Computing (STOC), 2020
Ainesh Bakshi
Ilias Diakonikolas
Hengrui Jia
D. Kane
Pravesh Kothari
Santosh Vempala
581
73
0
03 Dec 2020
1
Page 1 of 1
