Working with SQ Lower Bounds part6(Machine Learning constraint) | by Monodeep Mukherjee | Apr, 2024

  1. Optimal SQ Lower Bounds for Learning Halfspaces with Massart Noise(arXiv)

Author : Rajai Nasser, Stefan Tiegel

Abstract : We give tight statistical query (SQ) lower bounds for learnining halfspaces in the presence of Massart noise. In particular, suppose that all labels are corrupted with probability at most η. We show that for arbitrary η∈[0,1/2] every SQ algorithm achieving misclassification error better than η requires queries of superpolynomial accuracy or at least a superpolynomial number of queries. Further, this continues to hold even if the information-theoretically optimal error OPT is as small as exp(−logc(d)), where d is the dimension and 0<c<1 is an arbitrary absolute constant, and an overwhelming fraction of examples are noiseless. Our lower bound matches known polynomial time algorithms, which are also implementable in the SQ framework. Previously, such lower bounds only ruled out algorithms achieving error OPT+ε or error better than Ω(η) or, if η is close to 1/2, error η−oη(1), where the term oη(1) is constant in d but going to 0 for η approaching 1/2. As a consequence, we also show that achieving misclassification error better than 1/2 in the (A,α)-Tsybakov model is SQ-hard for A constant and α bounded away from 1

Recent Articles

Related Stories

Leave A Reply

Please enter your comment!
Please enter your name here