Cryptographic Hardness of Learning Halfspaces with Massart Noise

28 July 2022

Papers citing "Cryptographic Hardness of Learning Halfspaces with Massart Noise"

6 / 6 papers shown

Title
Efficient Testable Learning of General Halfspaces with Adversarial Label Noise Ilias Diakonikolas Daniel M. Kane Sihan Liu Nikos Zarifis 36 0 0 30 Aug 2024
Near-Optimal Cryptographic Hardness of Agnostically Learning Halfspaces and ReLU Regression under Gaussian Marginals Ilias Diakonikolas D. Kane Lisheng Ren 17 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 22 6 0 18 Oct 2022
Optimal SQ Lower Bounds for Learning Halfspaces with Massart Noise Rajai Nasser Stefan Tiegel 38 14 0 24 Jan 2022
Forster Decomposition and Learning Halfspaces with Noise Ilias Diakonikolas D. Kane Christos Tzamos 81 18 0 12 Jul 2021