Optimal SQ Lower Bounds for Learning Halfspaces with Massart Noise

24 January 2022

Papers citing "Optimal SQ Lower Bounds for Learning Halfspaces with Massart Noise"

12 / 12 papers shown

Title
Learning Noisy Halfspaces with a Margin: Massart is No Harder than Random Gautam Chandrasekaran Vasilis Kontonis Konstantinos Stavropoulos Kevin Tian 109 1 0 20 Jan 2025
Learning General Halfspaces with General Massart Noise under the Gaussian Distribution Ilias Diakonikolas D. Kane Vasilis Kontonis Christos Tzamos Nikos Zarifis 34 25 0 19 Aug 2021
Forster Decomposition and Learning Halfspaces with Noise Ilias Diakonikolas D. Kane Christos Tzamos 101 18 0 12 Jul 2021
Near-Optimal Statistical Query Hardness of Learning Halfspaces with Massart Noise Ilias Diakonikolas D. Kane 38 25 0 17 Dec 2020
Learning Halfspaces with Massart Noise Under Structured Distributions Ilias Diakonikolas Vasilis Kontonis Christos Tzamos Nikos Zarifis 42 60 0 13 Feb 2020
Distribution-Independent PAC Learning of Halfspaces with Massart Noise Ilias Diakonikolas Themis Gouleakis Christos Tzamos 58 81 0 24 Jun 2019
A Hitting Time Analysis of Stochastic Gradient Langevin Dynamics Yuchen Zhang Percy Liang Moses Charikar 51 234 0 18 Feb 2017
A General Characterization of the Statistical Query Complexity Vitaly Feldman 30 53 0 07 Aug 2016
Statistical Query Algorithms for Mean Vector Estimation and Stochastic Convex Optimization Vitaly Feldman Cristóbal Guzmán Santosh Vempala 61 89 0 30 Dec 2015
Complexity Theoretic Limitations on Learning Halfspaces Amit Daniely 103 139 0 21 May 2015
Efficient Learning of Linear Separators under Bounded Noise Pranjal Awasthi Maria-Florina Balcan Nika Haghtalab Ruth Urner 36 94 0 12 Mar 2015
What Can We Learn Privately? S. Kasiviswanathan Homin K. Lee Kobbi Nissim Sofya Raskhodnikova Adam D. Smith 99 1,459 0 06 Mar 2008