73 search results - page 7 / 15 » The Complexity of Learning Concept Classes with Polynomial G... |
STOC
1994
ACM
13 years 11 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...
COCO
2004
Springer
14 years 28 days ago
2004
Springer
This paper develops new relationships between resource-bounded dimension, entropy rates, and compression. New tools for calculating dimensions are given and used to improve previo...
ECML
1993
Springer
13 years 11 months ago
1993
Springer
This paper describes a genetic learning system called SIA, which learns attributes based rules from a set of preclassified examples. Examples may be described with a variable numbe...
ICASSP
2010
IEEE
13 years 7 months ago
2010
IEEE
Algorithms such as Least Median of Squares (LMedS) and Random Sample Consensus (RANSAC) have been very successful for low-dimensional robust regression problems. However, the comb...
FOCS
2008
IEEE
14 years 2 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 ...