Forster Decomposition and Learning Halfspaces with Noise

12 July 2021

Papers citing "Forster Decomposition and Learning Halfspaces with Noise"

10 / 10 papers shown

Title
Learning Noisy Halfspaces with a Margin: Massart is No Harder than Random Gautam Chandrasekaran Vasilis Kontonis Konstantinos Stavropoulos Kevin Tian 97 0 0 20 Jan 2025
Self-Directed Linear Classification Ilias Diakonikolas Vasilis Kontonis Christos Tzamos Nikos Zarifis 40 4 0 06 Aug 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
An Efficient Tester-Learner for Halfspaces Aravind Gollakota Adam R. Klivans Konstantinos Stavropoulos Arsen Vasilyan 25 10 0 28 Feb 2023
Do PAC-Learners Learn the Marginal Distribution? Max Hopkins D. Kane Shachar Lovett G. Mahajan 103 2 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
Optimal SQ Lower Bounds for Learning Halfspaces with Massart Noise Rajai Nasser Stefan Tiegel 38 14 0 24 Jan 2022
ReLU Regression with Massart Noise Ilias Diakonikolas Jongho Park Christos Tzamos 56 11 0 10 Sep 2021