Papers
Communities
Events
Blog
Pricing
Search
Open menu
Home
Papers
2206.04589
Cited By
Optimal SQ Lower Bounds for Robustly Learning Discrete Product Distributions and Ising Models
9 June 2022
Ilias Diakonikolas
D. Kane
Yuxin Sun
Re-assign community
ArXiv (abs)
PDF
HTML
Papers citing
"Optimal SQ Lower Bounds for Robustly Learning Discrete Product Distributions and Ising Models"
22 / 22 papers shown
Title
Learning General Halfspaces with General Massart Noise under the Gaussian Distribution
Ilias Diakonikolas
D. Kane
Vasilis Kontonis
Christos Tzamos
Nikos Zarifis
48
26
0
19 Aug 2021
Statistical Query Lower Bounds for List-Decodable Linear Regression
Ilias Diakonikolas
D. Kane
Ankit Pensia
Thanasis Pittas
Alistair Stewart
39
21
0
17 Jun 2021
The Optimality of Polynomial Regression for Agnostic Learning under Gaussian Marginals
Ilias Diakonikolas
D. Kane
Thanasis Pittas
Nikos Zarifis
35
50
0
08 Feb 2021
Outlier-Robust Learning of Ising Models Under Dobrushin's Condition
Ilias Diakonikolas
D. Kane
Alistair Stewart
Yuxin Sun
63
16
0
03 Feb 2021
Near-Optimal Statistical Query Hardness of Learning Halfspaces with Massart Noise
Ilias Diakonikolas
D. Kane
45
26
0
17 Dec 2020
Statistical Query Algorithms and Low-Degree Tests Are Almost Equivalent
Matthew Brennan
Guy Bresler
Samuel B. Hopkins
Jingkai Li
T. Schramm
58
66
0
13 Sep 2020
Near-Optimal SQ Lower Bounds for Agnostically Learning Halfspaces and ReLUs under Gaussian Marginals
Ilias Diakonikolas
D. Kane
Nikos Zarifis
63
66
0
29 Jun 2020
Algorithms and SQ Lower Bounds for PAC Learning One-Hidden-Layer ReLU Networks
Ilias Diakonikolas
D. Kane
Vasilis Kontonis
Nikos Zarifis
67
66
0
22 Jun 2020
Learning Ising models from one or multiple samples
Y. Dagan
C. Daskalakis
Nishanth Dikkala
Anthimos Vardis Kandiros
52
10
0
20 Apr 2020
Recent Advances in Algorithmic High-Dimensional Robust Statistics
Ilias Diakonikolas
D. Kane
OOD
71
183
0
14 Nov 2019
Non-Gaussian Component Analysis using Entropy Methods
Navin Goyal
Abhishek Shetty
CML
22
8
0
13 Jul 2018
Efficient Algorithms and Lower Bounds for Robust Linear Regression
Ilias Diakonikolas
Weihao Kong
Alistair Stewart
77
164
0
31 May 2018
Adversarial examples from computational constraints
Sébastien Bubeck
Eric Price
Ilya P. Razenshteyn
AAML
129
233
0
25 May 2018
List-Decodable Robust Mean Estimation and Learning Mixtures of Spherical Gaussians
Ilias Diakonikolas
D. Kane
Alistair Stewart
113
147
0
20 Nov 2017
Concentration of Multilinear Functions of the Ising Model with Applications to Network Data
C. Daskalakis
Nishanth Dikkala
Gautam Kamath
52
23
0
11 Oct 2017
Polynomial Time and Sample Complexity for Non-Gaussian Component Analysis: Spectral Methods
Yan Shuo Tan
Roman Vershynin
36
11
0
04 Apr 2017
Statistical Query Lower Bounds for Robust Estimation of High-dimensional Gaussians and Gaussian Mixtures
Ilias Diakonikolas
D. Kane
Alistair Stewart
77
233
0
10 Nov 2016
A General Characterization of the Statistical Query Complexity
Vitaly Feldman
44
53
0
07 Aug 2016
Agnostic Estimation of Mean and Covariance
Kevin A. Lai
Anup B. Rao
Santosh Vempala
89
347
0
24 Apr 2016
Robust Estimators in High Dimensions without the Computational Intractability
Ilias Diakonikolas
Gautam Kamath
D. Kane
Jingkai Li
Ankur Moitra
Alistair Stewart
73
513
0
21 Apr 2016
Statistical Query Algorithms for Mean Vector Estimation and Stochastic Convex Optimization
Vitaly Feldman
Cristóbal Guzmán
Santosh Vempala
75
89
0
30 Dec 2015
Approximate resilience, monotonicity, and the complexity of agnostic learning
Dana Dachman-Soled
Vitaly Feldman
Li-Yang Tan
Andrew Wan
K. Wimmer
48
31
0
21 May 2014
1