18 search results - page 4 / 4 » PAC Generalization Bounds for Co-training |
STOC
1994
ACM
13 years 9 months ago
1994
ACM
We present new results on the well-studied problem of learning DNF expressions. We prove that an algorithm due to Kushilevitz and Mansour [13] can be used to weakly learn DNF form...
PKDD
2010
Springer
13 years 3 months ago
2010
Springer
We consider the problem of numerical stability and model density growth when training a sparse linear model from massive data. We focus on scalable algorithms that optimize certain...
FOCS
2008
IEEE
13 years 11 months ago
2008
IEEE
We study the learnability of sets in Rn under the Gaussian distribution, taking Gaussian surface area as the “complexity measure” of the sets being learned. Let CS denote the ...