29 search results - page 1 / 6 » Learning parities in the mistake-bound model |
IPL
2010
13 years 5 months ago
2010
We study the problem of learning parity functions that depend on at most k variables (kparities) attribute-efficiently in the mistake-bound model. We design a simple, deterministi...
ICML
1997
IEEE
14 years 8 months ago
1997
IEEE
FOCS
1990
IEEE
13 years 11 months ago
1990
IEEE
Two of the most commonly used models in computational learning theory are the distribution-free model in which examples are chosen from a fixed but arbitrary distribution, and the ...
COLT
1999
Springer
13 years 11 months ago
1999
Springer
This paper proposes the use of constructive ordinals as mistake bounds in the on-line learning model. This approach elegantly generalizes the applicability of the on-line mistake ...
EWRL
2008
13 years 9 months ago
2008
We consider reinforcement learning in the parameterized setup, where the model is known to belong to a parameterized family of Markov Decision Processes (MDPs). We further impose ...