Prudence and other conditions on formal language learning
Information and Computation
Learning in the presence of inaccurate information
COLT '89 Proceedings of the second annual workshop on Computational learning theory
A Machine-Independent Theory of the Complexity of Recursive Functions
Journal of the ACM (JACM)
Inductive Inference: Theory and Methods
ACM Computing Surveys (CSUR)
Machine Inductive Inference and Language Identification
Proceedings of the 9th Colloquium on Automata, Languages and Programming
Research in the theory of inductive inference by GDR mathematicians-A survey
Information Sciences: an International Journal
On the power of incremental learning
Theoretical Computer Science
ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
On the Strength of Incremental Learning
ALT '99 Proceedings of the 10th International Conference on Algorithmic Learning Theory
Variants of iterative learning
Theoretical Computer Science
Learning via finitely many queries
Annals of Mathematics and Artificial Intelligence
On learning to coordinate: random bits help, insightful normal forms, and competency isomorphisms
Journal of Computer and System Sciences - Special issue: Learning theory 2003
Variations on U-shaped learning
Information and Computation
Results on memory-limited U-shaped learning
Information and Computation
Information and Computation
Non-U-shaped vacillatory and team learning
Journal of Computer and System Sciences
U-shaped, iterative, and iterative-with-counter learning
Machine Learning
Resource Restricted Computability Theoretic Learning: Illustrative Topics and Problems
CiE '07 Proceedings of the 3rd conference on Computability in Europe: Computation and Logic in the Real World
Parallelism Increases Iterative Learning Power
ALT '07 Proceedings of the 18th international conference on Algorithmic Learning Theory
Parallelism increases iterative learning power
Theoretical Computer Science
U-shaped, iterative, and iterative-with-counter learning
COLT'07 Proceedings of the 20th annual conference on Learning theory
Solutions to open questions for non-u-shaped learning with memory limitations
ALT'10 Proceedings of the 21st international conference on Algorithmic learning theory
Non U-shaped vacillatory and team learning
ALT'05 Proceedings of the 16th international conference on Algorithmic Learning Theory
Some recent results in u-shaped learning
TAMC'06 Proceedings of the Third international conference on Theory and Applications of Models of Computation
Variations on u-shaped learning
COLT'05 Proceedings of the 18th annual conference on Learning Theory
A novel local patch framework for fixing supervised learning models
Proceedings of the 21st ACM international conference on Information and knowledge management
Memory-limited non-U-shaped learning with solved open problems
Theoretical Computer Science
| Hi-index | 0.00 |
In this paper we solve some of the open problems in D. Osherson, M. Stob, and S. Weinstein (''Systems That Learn,'' MIT Press, Cambridge, MA, 1986). We also give partial solutions to some other open problems in the book. In particular we show that the collection of classes of languages that can be identified on ''noisy'' text (i.e., a text which may contain some elements which are not in the language being learned) strictly contains the collection of classes of languages that can be identified on ''imperfect'' text (i.e., a text which may contain some extra elements and may leave out some elements from the language being learned). We also show that memory limited identification is strictly more restrictive that memory bounded identification. Besides solving the above two open problems from op. cit., we also give partial solutions to other open problems in ibid.