Near-Optimal Statistical Query Hardness of Learning Halfspaces with Massart Noise

17 December 2020

Papers citing "Near-Optimal Statistical Query Hardness of Learning Halfspaces with Massart Noise"

21 / 21 papers shown

Title
On Learning Parallel Pancakes with Mostly Uniform Weights Ilias Diakonikolas D. Kane Sushrut Karmalkar Jasper C. H. Lee Thanasis Pittas CoGe 49 0 0 21 Apr 2025
Sum-of-squares lower bounds for Non-Gaussian Component Analysis Ilias Diakonikolas Sushrut Karmalkar Shuo Pang Aaron Potechin 22 3 0 28 Oct 2024
SQ Lower Bounds for Non-Gaussian Component Analysis with Weaker Assumptions Ilias Diakonikolas Daniel M. Kane Lisheng Ren Yuxin Sun 18 10 0 07 Mar 2024
Statistical Query Lower Bounds for Learning Truncated Gaussians Ilias Diakonikolas Daniel M. Kane Thanasis Pittas Nikos Zarifis 18 2 0 04 Mar 2024
Improved Hardness Results for Learning Intersections of Halfspaces Stefan Tiegel 33 3 0 25 Feb 2024
Efficient Active Learning Halfspaces with Tsybakov Noise: A Non-convex Optimization Approach Yinan Li Chicheng Zhang 18 1 0 23 Oct 2023
Distribution-Independent Regression for Generalized Linear Models with Oblivious Corruptions Ilias Diakonikolas Sushrut Karmalkar Jongho Park Christos Tzamos 26 1 0 20 Sep 2023
Near-Optimal Bounds for Learning Gaussian Halfspaces with Random Classification Noise Ilias Diakonikolas Jelena Diakonikolas D. Kane Puqian Wang Nikos Zarifis 21 2 0 13 Jul 2023
Information-Computation Tradeoffs for Learning Margin Halfspaces with Random Classification Noise Ilias Diakonikolas Jelena Diakonikolas D. Kane Puqian Wang Nikos Zarifis 8 3 0 28 Jun 2023
SQ Lower Bounds for Learning Bounded Covariance GMMs Ilias Diakonikolas D. Kane Thanasis Pittas Nikos Zarifis 35 0 0 22 Jun 2023
An Efficient Tester-Learner for Halfspaces Aravind Gollakota Adam R. Klivans Konstantinos Stavropoulos Arsen Vasilyan 27 10 0 28 Feb 2023
Near-Optimal Cryptographic Hardness of Agnostically Learning Halfspaces and ReLU Regression under Gaussian Marginals Ilias Diakonikolas D. Kane Lisheng Ren 25 26 0 13 Feb 2023
A Strongly Polynomial Algorithm for Approximate Forster Transforms and its Application to Halfspace Learning Ilias Diakonikolas Christos Tzamos D. Kane 21 12 0 06 Dec 2022
SQ Lower Bounds for Learning Single Neurons with Massart Noise Ilias Diakonikolas D. Kane Lisheng Ren Yuxin Sun 25 6 0 18 Oct 2022
Cryptographic Hardness of Learning Halfspaces with Massart Noise Ilias Diakonikolas D. Kane Pasin Manurangsi Lisheng Ren 33 22 0 28 Jul 2022
Hardness of Agnostically Learning Halfspaces from Worst-Case Lattice Problems Stefan Tiegel 17 15 0 28 Jul 2022
Optimal SQ Lower Bounds for Robustly Learning Discrete Product Distributions and Ising Models Ilias Diakonikolas D. Kane Yuxin Sun 28 1 0 09 Jun 2022
Optimal SQ Lower Bounds for Learning Halfspaces with Massart Noise Rajai Nasser Stefan Tiegel 38 14 0 24 Jan 2022
Non-Gaussian Component Analysis via Lattice Basis Reduction Ilias Diakonikolas D. Kane 34 18 0 16 Dec 2021
Semi-verified PAC Learning from the Crowd Shiwei Zeng Jie Shen 25 3 0 13 Jun 2021
Efficient PAC Learning from the Crowd with Pairwise Comparisons Shiwei Zeng Jie Shen 6 7 0 02 Nov 2020