Papers
Communities
Events
Blog
Pricing
Search
Open menu
Home
Papers
1611.03473
Cited By
Statistical Query Lower Bounds for Robust Estimation of High-dimensional Gaussians and Gaussian Mixtures
10 November 2016
Ilias Diakonikolas
D. Kane
Alistair Stewart
Re-assign community
ArXiv
PDF
HTML
Papers citing
"Statistical Query Lower Bounds for Robust Estimation of High-dimensional Gaussians and Gaussian Mixtures"
50 / 71 papers shown
Title
Improved Robust Estimation for Erdős-Rényi Graphs: The Sparse Regime and Optimal Breakdown Point
Hongjie Chen
Jingqiu Ding
Yiding Hua
Stefan Tiegel
68
0
0
05 Mar 2025
Robust Kernel Hypothesis Testing under Data Corruption
Antonin Schrab
Ilmun Kim
53
3
0
30 May 2024
Robust Sparse Estimation for Gaussians with Optimal Error under Huber Contamination
Ilias Diakonikolas
Daniel M. Kane
Sushrut Karmalkar
Ankit Pensia
Thanasis Pittas
39
0
0
15 Mar 2024
Sample-Optimal Locally Private Hypothesis Selection and the Provable Benefits of Interactivity
A. F. Pour
Hassan Ashtiani
S. Asoodeh
51
0
0
09 Dec 2023
SQ Lower Bounds for Learning Mixtures of Linear Classifiers
Ilias Diakonikolas
D. Kane
Yuxin Sun
30
3
0
18 Oct 2023
On Single Index Models beyond Gaussian Data
Joan Bruna
Loucas Pillaud-Vivien
Aaron Zweig
20
10
0
28 Jul 2023
Near-Optimal Bounds for Learning Gaussian Halfspaces with Random Classification Noise
Ilias Diakonikolas
Jelena Diakonikolas
D. Kane
Puqian Wang
Nikos Zarifis
34
2
0
13 Jul 2023
SQ Lower Bounds for Learning Bounded Covariance GMMs
Ilias Diakonikolas
D. Kane
Thanasis Pittas
Nikos Zarifis
40
0
0
22 Jun 2023
Robust Sparse Mean Estimation via Incremental Learning
Jianhao Ma
Ruidi Chen
Yinghui He
S. Fattahi
Wei Hu
41
0
0
24 May 2023
Smoothing the Landscape Boosts the Signal for SGD: Optimal Sample Complexity for Learning Single Index Models
Alexandru Damian
Eshaan Nichani
Rong Ge
Jason D. Lee
MLT
44
33
0
18 May 2023
On the average-case complexity of learning output distributions of quantum circuits
A. Nietner
M. Ioannou
R. Sweke
R. Kueng
Jens Eisert
M. Hinsche
J. Haferkamp
36
11
0
09 May 2023
Nearly-Linear Time and Streaming Algorithms for Outlier-Robust PCA
Ilias Diakonikolas
D. Kane
Ankit Pensia
Thanasis Pittas
OOD
40
10
0
04 May 2023
Codivergences and information matrices
A. Derumigny
Johannes Schmidt-Hieber
25
1
0
14 Mar 2023
Polynomial Time and Private Learning of Unbounded Gaussian Mixture Models
Jamil Arbas
H. Ashtiani
Christopher Liaw
45
23
0
07 Mar 2023
Near-Optimal Cryptographic Hardness of Agnostically Learning Halfspaces and ReLU Regression under Gaussian Marginals
Ilias Diakonikolas
D. Kane
Lisheng Ren
30
26
0
13 Feb 2023
SQ Lower Bounds for Random Sparse Planted Vector Problem
Jingqiu Ding
Yiding Hua
24
4
0
26 Jan 2023
Statistically Optimal Robust Mean and Covariance Estimation for Anisotropic Gaussians
A. Minasyan
Nikita Zhivotovskiy
38
9
0
21 Jan 2023
Robustness Implies Privacy in Statistical Estimation
Samuel B. Hopkins
Gautam Kamath
Mahbod Majid
Shyam Narayanan
23
50
0
09 Dec 2022
Outlier-Robust Sparse Mean Estimation for Heavy-Tailed Distributions
Ilias Diakonikolas
D. Kane
Jasper C. H. Lee
Ankit Pensia
30
12
0
29 Nov 2022
Average-Case Complexity of Tensor Decomposition for Low-Degree Polynomials
Alexander S. Wein
37
9
0
10 Nov 2022
Gaussian Mean Testing Made Simple
Ilias Diakonikolas
D. Kane
Ankit Pensia
28
5
0
25 Oct 2022
SQ Lower Bounds for Learning Single Neurons with Massart Noise
Ilias Diakonikolas
D. Kane
Lisheng Ren
Yuxin Sun
30
6
0
18 Oct 2022
A Fourier Approach to Mixture Learning
Mingda Qiao
Guru Guruganesh
A. S. Rawat
Kumar Avinava Dubey
Manzil Zaheer
25
3
0
05 Oct 2022
Outlier Robust and Sparse Estimation of Linear Regression Coefficients
Takeyuki Sasai
Hironori Fujisawa
35
4
0
24 Aug 2022
Robust Methods for High-Dimensional Linear Learning
Ibrahim Merad
Stéphane Gaïffas
OOD
55
3
0
10 Aug 2022
List-Decodable Covariance Estimation
Misha Ivkov
Pravesh Kothari
28
7
0
22 Jun 2022
Optimal SQ Lower Bounds for Robustly Learning Discrete Product Distributions and Ising Models
Ilias Diakonikolas
D. Kane
Yuxin Sun
33
1
0
09 Jun 2022
Robust Sparse Mean Estimation via Sum of Squares
Ilias Diakonikolas
D. Kane
Sushrut Karmalkar
Ankit Pensia
Thanasis Pittas
30
21
0
07 Jun 2022
List-Decodable Sparse Mean Estimation
Shiwei Zeng
Jie Shen
37
9
0
28 May 2022
Robust Testing in High-Dimensional Sparse Models
Anand George
C. Canonne
48
3
0
16 May 2022
Continuous LWE is as Hard as LWE & Applications to Learning Gaussian Mixtures
A. Gupte
Neekon Vafa
Vinod Vaikuntanathan
36
39
0
06 Apr 2022
Non-Gaussian Component Analysis via Lattice Basis Reduction
Ilias Diakonikolas
D. Kane
41
18
0
16 Dec 2021
Lattice-Based Methods Surpass Sum-of-Squares in Clustering
Ilias Zadik
M. Song
Alexander S. Wein
Joan Bruna
24
35
0
07 Dec 2021
Clustering Mixtures with Almost Optimal Separation in Polynomial Time
Jingkai Li
Allen Liu
30
23
0
01 Dec 2021
Polynomial-Time Sum-of-Squares Can Robustly Estimate Mean and Covariance of Gaussians Optimally
Pravesh Kothari
Peter Manohar
Brian Hu Zhang
25
16
0
22 Oct 2021
Learnability of the output distributions of local quantum circuits
M. Hinsche
M. Ioannou
A. Nietner
J. Haferkamp
Yihui Quek
D. Hangleiter
Jean-Pierre Seifert
Jens Eisert
R. Sweke
35
17
0
11 Oct 2021
Inferring Hidden Structures in Random Graphs
Wasim Huleihel
21
7
0
05 Oct 2021
Outlier-Robust Sparse Estimation via Non-Convex Optimization
Yu Cheng
Ilias Diakonikolas
Rong Ge
Shivam Gupta
D. Kane
Mahdi Soltanolkotabi
52
13
0
23 Sep 2021
SPECTRE: Defending Against Backdoor Attacks Using Robust Statistics
J. Hayase
Weihao Kong
Raghav Somani
Sewoong Oh
AAML
29
150
0
22 Apr 2021
Learning GMMs with Nearly Optimal Robustness Guarantees
Allen Liu
Ankur Moitra
26
15
0
19 Apr 2021
Algorithmic Obstructions in the Random Number Partitioning Problem
D. Gamarnik
Eren C. Kizildaug
31
21
0
02 Mar 2021
Near-Optimal Statistical Query Hardness of Learning Halfspaces with Massart Noise
Ilias Diakonikolas
D. Kane
26
24
0
17 Dec 2020
Small Covers for Near-Zero Sets of Polynomials and Learning Latent Variable Models
Ilias Diakonikolas
D. Kane
21
32
0
14 Dec 2020
On InstaHide, Phase Retrieval, and Sparse Matrix Factorization
Sitan Chen
Xiaoxiao Li
Zhao Song
Danyang Zhuo
27
13
0
23 Nov 2020
Robust High Dimensional Expectation Maximization Algorithm via Trimmed Hard Thresholding
Di Wang
Xiangyu Guo
Shi Li
Jinhui Xu
23
3
0
19 Oct 2020
Statistical Query Algorithms and Low-Degree Tests Are Almost Equivalent
Matthew Brennan
Guy Bresler
Samuel B. Hopkins
Jingkai Li
T. Schramm
29
62
0
13 Sep 2020
Near-Optimal SQ Lower Bounds for Agnostically Learning Halfspaces and ReLUs under Gaussian Marginals
Ilias Diakonikolas
D. Kane
Nikos Zarifis
27
66
0
29 Jun 2020
Computationally efficient sparse clustering
Matthias Löffler
Alexander S. Wein
Afonso S. Bandeira
41
14
0
21 May 2020
Tensor Clustering with Planted Structures: Statistical Optimality and Computational Limits
Yuetian Luo
Anru R. Zhang
51
44
0
21 May 2020
Reducibility and Statistical-Computational Gaps from Secret Leakage
Matthew Brennan
Guy Bresler
38
86
0
16 May 2020
1
2
Next