Abstract
We address the problem of testing whether a Boolean-valued function f is a halfspace, i.e. a function of the form f(x) = sgn(wċx-θ). We consider halfspaces over the continuous domain Rn (endowed with the standard multivariate Gaussian distribution) as well as halfspaces over the Boolean cube {-1, 1}n (endowed with the uniform distribution). In both cases we give an algorithm that distinguishes halfspaces from functions that are e-far from any halfspace using only poly(1/e) queries, independent of the dimension n. In contrast to the case of general halfspaces, we show that testing natural subclasses of halfspaces can be markedly harder; for the class of {-1, 1}-weight halfspaces, we show that a tester must make at least O(log n) queries. We complement this lower bound with an upper bound showing that O(√n queries suffice.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
