224 search results - page 2 / 45 » Bounding Learning Time in XCS |
129
Voted
GECCO
2007
Springer
15 years 7 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 ...
135
Voted
IFIP
2010
Springer
14 years 10 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...
183
Voted
JMLR
2012
13 years 6 months 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...
128
Voted
ML
2002
ACM
15 years 3 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...
113
Voted
ALT
2010
Springer
15 years 5 months ago
2010
Springer
Known algorithms for learning PDFA can only be shown to run in time polynomial in the so-called distinguishability