A Polynomial Time Algorithm for Learning Halfspaces with Tsybakov Noise

4 October 2020

Papers citing "A Polynomial Time Algorithm for Learning Halfspaces with Tsybakov Noise"

5 / 5 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
Near-Optimal Bounds for Learning Gaussian Halfspaces with Random Classification Noise Ilias Diakonikolas Jelena Diakonikolas D. Kane Puqian Wang Nikos Zarifis 34 2 0 13 Jul 2023
List-Decodable Sparse Mean Estimation Shiwei Zeng Jie Shen 35 9 0 28 May 2022
Improved Algorithms for Efficient Active Learning Halfspaces with Massart and Tsybakov noise Chicheng Zhang Yinan Li 32 24 0 10 Feb 2021
Near-Optimal Statistical Query Hardness of Learning Halfspaces with Massart Noise Ilias Diakonikolas D. Kane 26 24 0 17 Dec 2020