62 search results - page 1 / 13 » Approximating Linear Threshold Predicates |
APPROX
2010
Springer
14 years 10 days ago
2010
Springer
We study constraint satisfaction problems on the domain {-1, 1}, where the given constraints are homogeneous linear threshold predicates. That is, predicates of the form sgn(w1x1 +...
LATIN
2010
Springer
13 years 9 months ago
2010
Springer
A predicate P : {−1, 1}k → {0, 1} can be associated with a constraint satisfaction problem Max CSP(P). P is called “approximation resistant” if Max CSP(P) cannot be approxi...
COCO
2009
Springer
14 years 5 months ago
2009
Springer
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...
COCO
2006
Springer
14 years 2 months ago
2006
Springer
COLT
1993
Springer
14 years 2 months ago
1993
Springer
We consider the problem of learning in multilayer feed-forward networks of linear threshold units. We show that the Vapnik-Chervonenkis dimension of the class of functions that ca...