A Strongly Polynomial Algorithm for Approximate Forster Transforms and its Application to Halfspace Learning

6 December 2022

Papers citing "A Strongly Polynomial Algorithm for Approximate Forster Transforms and its Application to Halfspace Learning"

8 / 8 papers shown

Title
Cryptographic Hardness of Learning Halfspaces with Massart Noise Ilias Diakonikolas D. Kane Pasin Manurangsi Lisheng Ren 81 25 0 28 Jul 2022
Optimal SQ Lower Bounds for Learning Halfspaces with Massart Noise Rajai Nasser Stefan Tiegel 82 15 0 24 Jan 2022
ReLU Regression with Massart Noise Ilias Diakonikolas Jongho Park Christos Tzamos 103 12 0 10 Sep 2021
Forster Decomposition and Learning Halfspaces with Noise Ilias Diakonikolas D. Kane Christos Tzamos 134 19 0 12 Jul 2021
Near-Optimal Statistical Query Hardness of Learning Halfspaces with Massart Noise Ilias Diakonikolas D. Kane 68 26 0 17 Dec 2020
Point Location and Active Learning: Learning Halfspaces Almost Optimally Max Hopkins D. Kane Shachar Lovett G. Mahajan 55 14 0 23 Apr 2020
Distribution-Independent PAC Learning of Halfspaces with Massart Noise Ilias Diakonikolas Themis Gouleakis Christos Tzamos 101 83 0 24 Jun 2019
Algorithms and Hardness for Robust Subspace Recovery Moritz Hardt Ankur Moitra OOD 116 116 0 05 Nov 2012