Hardness of Agnostically Learning Halfspaces from Worst-Case Lattice Problems

28 July 2022

Papers citing "Hardness of Agnostically Learning Halfspaces from Worst-Case Lattice Problems"

7 / 7 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
Super Non-singular Decompositions of Polynomials and their Application to Robustly Learning Low-degree PTFs Ilias Diakonikolas Daniel M. Kane Vasilis Kontonis Sihan Liu Nikos Zarifis 22 1 0 31 Mar 2024
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
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
From Local Pseudorandom Generators to Hardness of Learning Amit Daniely Gal Vardi 109 30 0 20 Jan 2021
Adversarial examples from computational constraints Sébastien Bubeck Eric Price Ilya P. Razenshteyn AAML 65 230 0 25 May 2018