76 search results - page 2 / 16 » New Results for Learning Noisy Parities and Halfspaces |
STOC
2012
ACM
11 years 7 months ago
2012
ACM
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 ...
COLT
1995
Springer
13 years 8 months ago
1995
Springer
We introduce a new model for learning with membership queries in which queries near the boundary of a target concept may receive incorrect or “don’t care” responses. In part...
STOC
2003
ACM
14 years 5 months ago
2003
ACM
A real multivariate polynomial p(x1, . . . , xn) is said to sign-represent a Boolean function f : {0, 1}n {-1, 1} if the sign of p(x) equals f(x) for all inputs x {0, 1}n. We gi...
COLT
1999
Springer
13 years 9 months ago
1999
Springer
In this paper we analyze the PAC learning abilities of several simple iterative algorithms for learning linear threshold functions, obtaining both positive and negative results. W...
ICASSP
2010
IEEE
13 years 5 months ago
2010
IEEE
In this paper, we examine the problem of learning from noisecontaminated data in high-dimensional space. A new learning approach based on projections onto multi-dimensional ellips...