Sciweavers

32 search results - page 2 / 7
» A sharp threshold in proof complexity
Sort
View
NIPS
2008
13 years 6 months ago
On the Complexity of Linear Prediction: Risk Bounds, Margin Bounds, and Regularization
This work characterizes the generalization ability of algorithms whose predictions are linear in the input vector. To this end, we provide sharp bounds for Rademacher and Gaussian...
Sham M. Kakade, Karthik Sridharan, Ambuj Tewari
COCO
2009
Springer
106views Algorithms» more  COCO 2009»
13 years 11 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
CJTCS
1999
133views more  CJTCS 1999»
13 years 4 months ago
The Permanent Requires Large Uniform Threshold Circuits
We show that thepermanent cannot be computed by uniform constantdepth threshold circuits of size Tn, for any function T such that for all k, Tk n = o2n. More generally, we show th...
Eric Allender
CORR
2011
Springer
192views Education» more  CORR 2011»
13 years 7 days ago
Distribution-Independent Evolvability of Linear Threshold Functions
Valiant’s (2007) model of evolvability models the evolutionary process of acquiring useful functionality as a restricted form of learning from random examples. Linear threshold ...
Vitaly Feldman
JCT
2006
80views more  JCT 2006»
13 years 5 months ago
Extending precolorings to circular colorings
Fix positive integers k , d , k, d such that k /d > k/d 2. If P is a set of vertices in a (k, d)-colorable graph G, and any two vertices of P are separated by distance at leas...
Michael O. Albertson, Douglas B. West