Abstract
The present work is dedicated to the study of modes of datapresentation between text and informant within the framework of inductive inference. The model is such that the learner requests sequences of positive andnegativ e data andthe relations between the various formalizations in dependence on the number of switches between positive and negative data is investigated. In particular it is shown that there is a proper hierarchy of the notions of learning from standard text, in the basic switching model, in the newtext switching model and in the restart switching model. The last one of these turns out to be equivalent to the standard notion of learning from informant.
Supported in part by NUS grant number RP3992710.
Supported by the Deutsche Forschungsgemeinschaft (DFG) under the Heisenberg grant Ste 967/1-1
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Dana Angluin. Learning regular sets from queries and counter-examples. Information and Computation, 75:87–106, 1987.
Ganesh Baliga, John Case and Sanjay Jain. Language learning with some negative information. Journal of Computer and System Sciences, 51(5):273–285, 1995.
Lenore Blum and Manuel Blum. Towarda mathematical theory of inductive inference. Information and Control, 28:125–155, 1975.
John Case, Sanjay Jain and Mandayam Suraj. Not-so-nearly-minimal-size program inference. In Klaus P. Jantke and Steffen Lange, editors, Algorithmic Learning for Knowledge-Based Systems, volume 961 of Lecture Notes in Artificial Intelligence, pages 77–96. Springer-Verlag, 1995.
John Case and Carl Smith. Comparison of identification criteria for machine inductive inference. Theoretical Computer Science, 25:193–220, 1983.
Rūsiņš Freivalds and Carl Smith. On the role of procrastination in machine learning. Information and Computation, pages 237–271, 1993.
E. Mark Gold. Language identification in the limit. Information and Control, 10:447–474, 1967.
Sanjay Jain and Arun Sharma. On the non-existence of maximal inference degrees for language identification. Information Processing Letters, 47:81–88, 1993.
Stephen Kleene. Notations for ordinal numbers. Journal of Symbolic Logic, 3:150–155, 1938.
M. Machtey and Paul Young. An Introduction to the General Theory of Algorithms. North Holland, New York, 1978.
Wolfgang Merkle and Frank Stephan. Refuting learning revisited. Technical Report Forschungsberichte Mathematische Logik 52/2001, Mathematisches Institut, Universität Heidelberg, 2001. Extended abstract to appear in Proceedings of the Twelfth International Conference on Algorithmic Learning Theory, 2001.
Tatsuya Motoki. Inductive inference from all positive and some negative data. Information Processing Letters, 39(4):177–182, 1991.
Daniel Osherson, Michael Stob and Scott Weinstein. Systems that Learn: An Introduction to Learning Theory for Cognitive and Computer Scientists. MIT Press, 1986.
Hartley Rogers. Theory of Recursive Functions and Effective Computability. McGraw-Hill, 1967. Reprinted by MIT Press in 1987.
Gerald E. Sacks. Higher Recursion Theory. Springer-Verlag, 1990.
Arun Sharma. A note on batch andincremen tal learnability. Journal of Computer and System Sciences, 56(3):272–276, 1998.
Rolf Wiehagen. Identification of formal languages. In Mathematical Foundations of Computer Science, volume 53 of Lecture Notes in Computer Science, pages 571–579. Springer-Verlag, 1977.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Jain, S., Stephan, F. (2001). Learning by Switching Type of Information. In: Abe, N., Khardon, R., Zeugmann, T. (eds) Algorithmic Learning Theory. ALT 2001. Lecture Notes in Computer Science(), vol 2225. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45583-3_17
Download citation
DOI: https://doi.org/10.1007/3-540-45583-3_17
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42875-6
Online ISBN: 978-3-540-45583-7
eBook Packages: Springer Book Archive