Skip to main content

U-Shaped, Iterative, and Iterative-with-Counter Learning

  • Conference paper
Learning Theory (COLT 2007)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 4539))

Included in the following conference series:

Abstract

This paper solves an important problem left open in the literature by showing that U-shapes are unnecessary in iterative learning. A U-shape occurs when a learner first learns, then unlearns, and, finally, relearns, some target concept. Iterative learning is a Gold-style learning model in which each of a learner’s output conjectures depends only upon the learner’s just previous conjecture and upon the most recent input element. Previous results had shown, for example, that U-shapes are unnecessary for explanatory learning, but are necessary for behaviorally correct learning.

Work on the aforementioned problem led to the consideration of an iterative-like learning model, in which each of a learner’s conjectures may, in addition, depend upon the number of elements so far presented to the learner. Learners in this new model are strictly more powerful than traditional iterative learners, yet not as powerful as full explanatory learners. Can any class of languages learnable in this new model be learned without U-shapes? For now, this problem is left open.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Baliga, G., Case, J., Merkle, W., Stephan, F., Wiehagen, W.: When unlearning helps, Submitted (2007)

    Google Scholar 

  2. Blum, M.: A machine independent theory of the complexity of recursive functions. Journal of the ACM 14, 322–336 (1967)

    Article  MATH  MathSciNet  Google Scholar 

  3. Carlucci, L., Case, J., Jain, S., Stephan, F.: Non U-shaped vacillatory and team learning. In: ALT 2005. Lecture Notes in Artificial Intelligence, Springer, Heidelberg (2005)

    Google Scholar 

  4. Carlucci, L., Case, J., Jain, S., Stephan, F.: Memory-limited U-shaped learning (Journal version conditionally accepted for Information and Computation). In: COLT 2006. LNCS (LNAI), vol. 4005, pp. 244–258. Springer, Heidelberg (2006)

    Google Scholar 

  5. Case, J.: The power of vacillation in language learning. SIAM Journal on Computing 28(6), 1941–1969 (1999)

    Article  MATH  MathSciNet  Google Scholar 

  6. Case, J., Moelius III, S.E.: U-shaped, iterative, and iterative-with-counter learning (expanded version). Technical report, University of Delaware, (2007) Available at http://www.cis.udel.edu/~moelius/publications

  7. Case, J., Jain, S., Lange, S., Zeugmann, T.: Incremental concept learning for bounded data mining. Information and Computation 152, 74–110 (1999)

    Article  MATH  MathSciNet  Google Scholar 

  8. Case, J., Lynes, C.: Machine inductive inference and language identification. In: Nielsen, M., Schmidt, E.M. (eds.) Proceedings of the 9th International Colloquium on Automata, Languages and Programming. LNCS, vol. 140, pp. 107–115. Springer, Heidelberg (1982)

    Chapter  Google Scholar 

  9. Davis, M., Sigal, R., Weyuker, E.: Computability, Complexity, and Languages, 2nd edn. Academic Press, San Diego (1994)

    Google Scholar 

  10. Fulk, M.: Prudence and other conditions on formal language learning. Information and Computation 85, 1–11 (1990)

    Article  MATH  MathSciNet  Google Scholar 

  11. Fulk, M., Jain, S., Osherson, D.: Open problems in Systems That Learn. Journal of Computer and System Sciences 49(3), 589–604 (1994)

    Article  MathSciNet  Google Scholar 

  12. Gold, E.: Language identification in the limit. Information and Control 10, 447–474 (1967)

    Article  Google Scholar 

  13. Jain, S.: Private communication (2006)

    Google Scholar 

  14. Jain, S., Osherson, D., Royer, J., Sharma, A.: Systems that Learn: An Introduction to Learning Theory. MIT Press, Cambridge, Mass (1999)

    Google Scholar 

  15. Kinber, E., Stephan, F.: Language learning from texts: mind changes, limited memory, and monotonicity. Information and Computation 123, 224–241 (1995)

    Article  MATH  MathSciNet  Google Scholar 

  16. Lange, S., Zeugmann, T.: Incremental learning from positive data. Journal of Computer and System Sciences 53, 88–103 (1996)

    Article  MATH  MathSciNet  Google Scholar 

  17. Lange, S., Zeugmann, T.: Set-driven and rearrangement-independent learning of recursive languages. Mathematical Systems Theory 6, 599–634 (1996)

    MathSciNet  Google Scholar 

  18. Marcus, G., Pinker, S., Ullman, M., Hollander, M., Rosen, T.J., Xu, F.: Overregularization in Language Acquisition. Monographs of the Society for Research in Child Development, vol. 57, no. 4. University of Chicago Press, Includes commentary by Clahsen, H. (1992)

    Google Scholar 

  19. Osherson, D., Stob, M., Weinstein, S.: Systems that Learn: An Introduction to Learning Theory for Cognitive and Computer Scientists. MIT Press, Cambridge, Mass (1986)

    Google Scholar 

  20. Plunkett, K., Marchman, V.: U-shaped learning and frequency effects in a multilayered perceptron: implications for child language acquisition. Cognition 38, 43–102 (1991)

    Article  Google Scholar 

  21. Rogers, H.: Theory of Recursive Functions and Effective Computability. McGraw Hill, New York, 1967. Reprinted, MIT Press (1987)

    Google Scholar 

  22. Schäfer-Richter, G.: Über Eingabeabhängigkeit und Komplexität von Inferenzstrategien. PhD thesis, Rheinisch-Westfälische Technische Hochschule Aachen, Germany (1984)

    Google Scholar 

  23. Taatgen, N.A., Anderson, J.R.: Why do children learn to say broke? A model of learning the past tense without feedback. Cognition 86, 123–155 (2002)

    Article  Google Scholar 

  24. Wexler, K., Culicover, P.: Formal Principles of Language Acquisition. MIT Press, Cambridge, Mass (1980)

    Google Scholar 

  25. Wiehagen, R.: Limes-erkennung rekursiver funktionen durch spezielle strategien. Electronische Informationverarbeitung und Kybernetik 12, 93–99 (1976)

    MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Nader H. Bshouty Claudio Gentile

Rights and permissions

Reprints and permissions

Copyright information

© 2007 Springer Berlin Heidelberg

About this paper

Cite this paper

Case, J., Moelius, S.E. (2007). U-Shaped, Iterative, and Iterative-with-Counter Learning. In: Bshouty, N.H., Gentile, C. (eds) Learning Theory. COLT 2007. Lecture Notes in Computer Science(), vol 4539. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-72927-3_14

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-72927-3_14

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-72925-9

  • Online ISBN: 978-3-540-72927-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics