6 search results - page 1 / 2 » k-Independent Gaussians Fool Polynomial Threshold Functions |
CORR
2010
Springer
14 years 9 months ago
2010
Springer
103
click to vote
COCO
2010
Springer
15 years 3 months ago
2010
Springer
Abstract. We prove asymptotically optimal bounds on the Gaussian noise sensitivity of degree-d polynomial threshold functions. These bounds translate into optimal bounds on the Gau...
114
click to vote
COLT
2010
Springer
14 years 10 months ago
2010
Springer
A significant Fourier transform (SFT) algorithm, given a threshold and oracle access to a function f, outputs (the frequencies and approximate values of) all the -significant Fou...
51
Voted
CORR
2011
Springer
14 years 6 months ago
2011
Springer
COLT
2008
Springer
15 years 1 months ago
2008
Springer
In recent work, Kalai, Klivans, Mansour, and Servedio [KKMS05] studied a variant of the "Low-Degree (Fourier) Algorithm" for learning under the uniform probability distr...