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"

9 / 9 papers shown

Title
Efficient Discrepancy Testing for Learning with Distribution Shift Gautam Chandrasekaran Adam R. Klivans Vasilis Kontonis Konstantinos Stavropoulos A. Vasilyan 38 1 0 13 Jun 2024
Active Learning with Simple Questions Vasilis Kontonis Mingchen Ma Christos Tzamos VLM 30 3 0 13 May 2024
Self-Directed Linear Classification Ilias Diakonikolas Vasilis Kontonis Christos Tzamos Nikos Zarifis 34 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 13 2 0 13 Jul 2023
An Efficient Tester-Learner for Halfspaces Aravind Gollakota Adam R. Klivans Konstantinos Stavropoulos A. Vasilyan 17 10 0 28 Feb 2023
Do PAC-Learners Learn the Marginal Distribution? Max Hopkins D. Kane Shachar Lovett G. Mahajan 95 2 0 13 Feb 2023
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
Forster Decomposition and Learning Halfspaces with Noise Ilias Diakonikolas D. Kane Christos Tzamos 81 18 0 12 Jul 2021