114
Voted
ALT
2005
Springer
15 years 10 months ago
2005
Springer
Efficient learnability using the state merging algorithm is known for a subclass of probabilistic automata termed µ-distinguishable. In this paper, we prove that state merging alg...
82
Voted
ALT
2005
Springer
15 years 10 months ago
2005
Springer
Abstract. We propose an independence criterion based on the eigenspectrum of covariance operators in reproducing kernel Hilbert spaces (RKHSs), consisting of an empirical estimate ...
116
Voted
ALT
2005
Springer
15 years 10 months ago
2005
Springer
Within learning theory teaching has been studied in various ways. In a common variant the teacher has to teach all learners that are restricted to output only consistent hypotheses...
ALT
2005
Springer
15 years 10 months ago
2005
Springer
97
Voted
ALT
2005
Springer
15 years 10 months ago
2005
Springer
We bound the future loss when predicting any (computably) stochastic sequence online. Solomonoff finitely bounded the total deviation of his universal predictor M from the true ...
94
Voted
ALT
2005
Springer
15 years 10 months ago
2005
Springer
U-shaped learning behaviour in cognitive development involves learning, unlearning and relearning. It occurs, for example, in learning irregular verbs. The prior cognitive science...
87
Voted
ALT
2006
Springer
15 years 10 months ago
2006
Springer
105
Voted
ALT
2006
Springer
15 years 10 months ago
2006
Springer
We address the problem of reinforcement learning in which observations may exhibit an arbitrary form of stochastic dependence on past observations and actions. The task for an age...
83
Voted
ALT
2006
Springer
15 years 10 months ago
2006
Springer
127
Voted
ALT
2006
Springer
15 years 10 months ago
2006
Springer
Abstract. Recently, some non-regular subclasses of context-free grammars have been found to be efficiently learnable from positive data. In order to use these efficient algorithms ...