224 search results - page 2 / 45 » Bounding Learning Time in XCS |
GECCO
2007
Springer
15 years 1 months ago
2007
Springer
In this study we deal with the mixing problem, which concerns combining the prediction of independently trained local models to form a global prediction. We deal with it from the ...
IFIP
2010
Springer
14 years 4 months ago
2010
Springer
In this paper we present a novel two-stage method to realize a lightweight but very capable hardware implementation of a Learning Classifier System for on-chip learning. Learning C...
127
click to vote
JMLR
2012
13 years 4 days ago
2012
We prove logarithmic regret bounds that depend on the loss L∗ T of the competitor rather than on the number T of time steps. In the general online convex optimization setting, o...
ML
2002
ACM
14 years 9 months ago
2002
ACM
We present new algorithms for reinforcement learning, and prove that they have polynomial bounds on the resources required to achieve near-optimal return in general Markov decisio...
ALT
2010
Springer
14 years 11 months ago
2010
Springer
Known algorithms for learning PDFA can only be shown to run in time polynomial in the so-called distinguishability