Abstract
Let Ex denote the explanatory model of learning [3],[5]. Various more restrictive models have been studied in the literature, an example is finite identification [5]. The topic of the present paper are the natural variants (a) and (b) below of the classical question whether a given learning criteria is more restrictive than Ex-learning. (a) Does every infinite Ex-identifiable class have an infinite subclass which can be identified according to a given restrictive criterion? (b) If an infinite Exidentifiable class S has an infinite finitely identifiable subclass, does it necessarily follow that some appropriate learner Ex-identifies S as well as finitely identifies an infinite subclass of S? These questions are also treated in the context of ordinal mind change bounds.
Sanjay Jain was supported in part by NUS grant number R252-000-127-112.
Frank Stephan was supported by the Deutsche Forschungsgemeinschaft (DFG) Heisenberg grant Ste 967/1-1.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Janis Bārzdinņš. Inductive inference of automata, functions and programs. In Int. Math. Congress, Vancouver, pages 771–776, 1974.
Lenore Blum and Manuel Blum. Toward a mathematical theory of inductive inference. Information and Control, 28:125–155, 1975.
John Case and Carl Smith. Comparison of identification criteria for machine inductive inference. Theoretical Computer Science, 25:193–220, 1983.
Rūsinņš Freivalds and Carl Smith. On the role of procrastination in machine learning. Information and Computation, 107:237–271, 1993.
E. Mark Gold. Language identification in the limit. Information and Control, 10:447–474, 1967.
Paul R. Halmos. Naive Set Theory. Springer-Verlag, NY, 1994.
Sanjay Jain, Daniel Osherson, James S. Royer and Arun Sharma. Systems that Learn: An Introduction to Learning Theory. MIT Press, Cambridge, Mass., second edition, 1999.
Eliana Minicozzi. Some natural properties of strong identification in inductive inference. Theoretical Computer Science, 2:345–360, 1976.
Piergiorgio Odifreddi. Classical Recursion Theory. North-Holland, Amsterdam, 1989.
Piergiorgio Odifreddi. Classical Recursion Theory, volume II. Elsevier, Amsterdam, 1999.
Daniel Osherson, Michael Stob and Scott Weinstein. Systems that Learn: An Introduction to Learning Theory for Cognitive and Computer Scientists. MIT Press, 1986.
Robert Soare. Recursively Enumerable Sets and Degrees. Springer-Verlag, 1987.
Rolf Wiehagen and Walter Liepe. Charakteristische Eigenschaften von erkennbaren Klassen rekursiver Funktionen. Journal of Information Processing and Cybernetics (EIK), 12:421–438, 1976.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Jain, S., Menzel, W., Stephan, F. (2002). Classes with Easily Learnable Subclasses. In: Cesa-Bianchi, N., Numao, M., Reischuk, R. (eds) Algorithmic Learning Theory. ALT 2002. Lecture Notes in Computer Science(), vol 2533. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-36169-3_19
Download citation
DOI: https://doi.org/10.1007/3-540-36169-3_19
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-00170-6
Online ISBN: 978-3-540-36169-5
eBook Packages: Springer Book Archive