224 search results - page 6 / 45 » Bounding Learning Time in XCS |
APPROX
2010
Springer
13 years 10 months ago
2010
Springer
In 2002 Jackson et al. [JKS02] asked whether AC0 circuits augmented with a threshold gate at the output can be efficiently learned from uniform random examples. We answer this ques...
CSR
2007
Springer
14 years 2 months ago
2007
Springer
To solve a problem on a given CNF formula F a splitting algorithm recursively calls for F[v] and F[¬v] for a variable v. Obviously, after the first call an algorithm obtains some...
ML
1998
ACM
13 years 8 months ago
1998
ACM
We review the application of statistical mechanics methods to the study of online learning of a drifting concept in the limit of large systems. The model where a feed-forward netwo...
IRMA
2000
13 years 9 months ago
2000
The on-line algorithms in machine learning are intended to discover unknown function of the domain based on incremental observing of it instance by instance. These algorithms have...
ALT
2011
Springer
12 years 8 months ago
2011
Springer
We consider the problem of learning sparse parities in the presence of noise. For learning parities on r out of n variables, we give an algorithm that runs in time poly log 1 δ , ...