Sciweavers

Share
23 search results - page 1 / 5
» Every Linear Threshold Function has a Low-Weight Approximato...
Sort
View
COCO
2010
Springer
144views Algorithms» more  COCO 2010»
10 years 5 months ago
A Regularity Lemma, and Low-Weight Approximators, for Low-Degree Polynomial Threshold Functions
We give a “regularity lemma” for degree-d polynomial threshold functions (PTFs) over the Boolean cube {−1, 1}n . Roughly speaking, this result shows that every degree-d PTF ...
Ilias Diakonikolas, Rocco A. Servedio, Li-Yang Tan...
COCO
2009
Springer
106views Algorithms» more  COCO 2009»
10 years 8 months ago
Improved Approximation of Linear Threshold Functions
We prove two main results on how arbitrary linear threshold functions f(x) = sign(w · x − θ) over the n-dimensional Boolean hypercube can be approximated by simple threshold f...
Ilias Diakonikolas, Rocco A. Servedio
COCO
2003
Springer
91views Algorithms» more  COCO 2003»
10 years 6 months ago
Extremal properties of polynomial threshold functions
In this paper we give new extremal bounds on polynomial threshold function (PTF) representations of Boolean functions. Our results include the following: • Almost every Boolean ...
Ryan O'Donnell, Rocco A. Servedio
STOC
2012
ACM
209views Algorithms» more  STOC 2012»
8 years 3 months ago
Nearly optimal solutions for the chow parameters problem and low-weight approximation of halfspaces
The Chow parameters of a Boolean function f : {−1, 1}n → {−1, 1} are its n + 1 degree-0 and degree-1 Fourier coefficients. It has been known since 1961 [Cho61, Tan61] that ...
Anindya De, Ilias Diakonikolas, Vitaly Feldman, Ro...
books