Communities
Connect sessions
AI calendar
Organizations
Join Slack
Contact Sales
Search
Open menu
Home
Papers
2012.09720
Cited By
v1
v2
v3 (latest)
Near-Optimal Statistical Query Hardness of Learning Halfspaces with Massart Noise
Annual Conference Computational Learning Theory (COLT), 2020
17 December 2020
Ilias Diakonikolas
D. Kane
Re-assign community
ArXiv (abs)
PDF
HTML
Papers citing
"Near-Optimal Statistical Query Hardness of Learning Halfspaces with Massart Noise"
24 / 24 papers shown
Information-Computation Tradeoffs for Noiseless Linear Regression with Oblivious Contamination
Ilias Diakonikolas
Chao Gao
D. Kane
John D. Lafferty
Ankit Pensia
FedML
122
0
0
12 Oct 2025
The Power of Iterative Filtering for Supervised Learning with (Heavy) Contamination
Adam R. Klivans
Konstantinos Stavropoulos
Kevin Tian
Arsen Vasilyan
229
1
0
26 May 2025
On Learning Parallel Pancakes with Mostly Uniform Weights
Ilias Diakonikolas
D. Kane
Sushrut Karmalkar
Jasper C. H. Lee
Thanasis Pittas
CoGe
252
0
0
21 Apr 2025
A Near-optimal Algorithm for Learning Margin Halfspaces with Massart Noise
Neural Information Processing Systems (NeurIPS), 2025
Ilias Diakonikolas
Nikos Zarifis
239
5
0
17 Jan 2025
Sum-of-squares lower bounds for Non-Gaussian Component Analysis
IEEE Annual Symposium on Foundations of Computer Science (FOCS), 2024
Ilias Diakonikolas
Sushrut Karmalkar
Shuo Pang
Aaron Potechin
153
8
0
28 Oct 2024
SQ Lower Bounds for Non-Gaussian Component Analysis with Weaker Assumptions
Neural Information Processing Systems (NeurIPS), 2024
Ilias Diakonikolas
Daniel M. Kane
Lisheng Ren
Yuxin Sun
244
15
0
07 Mar 2024
Statistical Query Lower Bounds for Learning Truncated Gaussians
Ilias Diakonikolas
Daniel M. Kane
Thanasis Pittas
Nikos Zarifis
219
6
0
04 Mar 2024
Improved Hardness Results for Learning Intersections of Halfspaces
Stefan Tiegel
137
5
0
25 Feb 2024
Efficient Active Learning Halfspaces with Tsybakov Noise: A Non-convex Optimization Approach
International Conference on Artificial Intelligence and Statistics (AISTATS), 2023
Yinan Li
Chicheng Zhang
190
1
0
23 Oct 2023
Distribution-Independent Regression for Generalized Linear Models with Oblivious Corruptions
Annual Conference Computational Learning Theory (COLT), 2023
Ilias Diakonikolas
Sushrut Karmalkar
Jongho Park
Christos Tzamos
375
2
0
20 Sep 2023
Near-Optimal Bounds for Learning Gaussian Halfspaces with Random Classification Noise
Neural Information Processing Systems (NeurIPS), 2023
Ilias Diakonikolas
Jelena Diakonikolas
D. Kane
Puqian Wang
Nikos Zarifis
198
4
0
13 Jul 2023
Information-Computation Tradeoffs for Learning Margin Halfspaces with Random Classification Noise
Annual Conference Computational Learning Theory (COLT), 2023
Ilias Diakonikolas
Jelena Diakonikolas
D. Kane
Puqian Wang
Nikos Zarifis
188
6
0
28 Jun 2023
SQ Lower Bounds for Learning Bounded Covariance GMMs
Ilias Diakonikolas
D. Kane
Thanasis Pittas
Nikos Zarifis
235
0
0
22 Jun 2023
An Efficient Tester-Learner for Halfspaces
International Conference on Learning Representations (ICLR), 2023
Aravind Gollakota
Adam R. Klivans
Konstantinos Stavropoulos
Arsen Vasilyan
187
16
0
28 Feb 2023
Near-Optimal Cryptographic Hardness of Agnostically Learning Halfspaces and ReLU Regression under Gaussian Marginals
International Conference on Machine Learning (ICML), 2023
Ilias Diakonikolas
D. Kane
Lisheng Ren
249
38
0
13 Feb 2023
A Strongly Polynomial Algorithm for Approximate Forster Transforms and its Application to Halfspace Learning
Ilias Diakonikolas
Christos Tzamos
D. Kane
192
16
0
06 Dec 2022
SQ Lower Bounds for Learning Single Neurons with Massart Noise
Neural Information Processing Systems (NeurIPS), 2022
Ilias Diakonikolas
D. Kane
Lisheng Ren
Yuxin Sun
146
8
0
18 Oct 2022
Cryptographic Hardness of Learning Halfspaces with Massart Noise
Neural Information Processing Systems (NeurIPS), 2022
Ilias Diakonikolas
D. Kane
Pasin Manurangsi
Lisheng Ren
195
31
0
28 Jul 2022
Hardness of Agnostically Learning Halfspaces from Worst-Case Lattice Problems
Annual Conference Computational Learning Theory (COLT), 2022
Stefan Tiegel
337
21
0
28 Jul 2022
Optimal SQ Lower Bounds for Robustly Learning Discrete Product Distributions and Ising Models
Annual Conference Computational Learning Theory (COLT), 2022
Ilias Diakonikolas
D. Kane
Yuxin Sun
178
3
0
09 Jun 2022
Optimal SQ Lower Bounds for Learning Halfspaces with Massart Noise
Annual Conference Computational Learning Theory (COLT), 2022
Rajai Nasser
Stefan Tiegel
244
17
0
24 Jan 2022
Non-Gaussian Component Analysis via Lattice Basis Reduction
Ilias Diakonikolas
D. Kane
259
22
0
16 Dec 2021
Semi-verified PAC Learning from the Crowd
International Conference on Artificial Intelligence and Statistics (AISTATS), 2021
Shiwei Zeng
Jie Shen
305
4
0
13 Jun 2021
Efficient PAC Learning from the Crowd with Pairwise Comparisons
International Conference on Machine Learning (ICML), 2020
Shiwei Zeng
Jie Shen
533
8
0
02 Nov 2020
1
Page 1 of 1
