Systems that learn: an introduction to learning theory for cognitive and computer scientists
Systems that learn: an introduction to learning theory for cognitive and computer scientists
Recursively enumerable sets and degrees
Recursively enumerable sets and degrees
Prudence and other conditions on formal language learning
Information and Computation
Learning with the knowledge of an upper bound on program size
Information and Computation
Language learning in dependence on the space of hypotheses
COLT '93 Proceedings of the sixth annual conference on Computational learning theory
Angluin's theorem for indexed families of r.e. sets and applications
COLT '96 Proceedings of the ninth annual conference on Computational learning theory
An introduction to Kolmogorov complexity and its applications (2nd ed.)
An introduction to Kolmogorov complexity and its applications (2nd ed.)
The Power of Vacillation in Language Learning
SIAM Journal on Computing
Algorithmic Learning for Knowledge-Based Systems, GOSLER Final Report
Increasing the power of uniform inductive learners
Journal of Computer and System Sciences - Special issue on COLT 2002
Learning in Friedberg Numberings
ALT '07 Proceedings of the 18th international conference on Algorithmic Learning Theory
Hypothesis Spaces for Learning
LATA '09 Proceedings of the 3rd International Conference on Language and Automata Theory and Applications
Hypothesis spaces for learning
Information and Computation
| Hi-index | 0.00 |
This paper extends previous studies on learnability in non-acceptable numberings by considering the question: for which criteria which numberings are optimal, that is, for which numberings it holds that one can learn every learnable class using the given numbering as hypothesis space. Furthermore an effective version of optimality is studied as well. It is shown that the effectively optimal numberings for finite learning are just the acceptable numberings. In contrast to this, there are non-acceptable numberings [3] which are optimal for finite learning and effectively optimal for explanatory, vacillatory and behaviourally correct learning. The numberings effectively optimal for explanatory learning are the K-acceptable numberings. A similar characterization is obtained for the numberings which are effectively optimal for vacillatory learning. Furthermore, it is studied which numberings are optimal for one and not for another criterion: among the criteria of finite, explanatory, vacillatory and behaviourally correct learning all separations can be obtained; however every numbering which is optimal for explanatory learning is also optimal for consistent learning.