Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
10330784 | Information and Computation | 2011 | 15 Pages |
Abstract
In this paper we survey some results in inductive inference showing how learnability of a class of languages may depend on the hypothesis space chosen. Additionally, optimal hypothesis spaces, usable for every learnable class, are considered. We also discuss results which consider how learnability is effected if one requires learning using every suitable hypothesis space.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Sanjay Jain,