Skip to main content

Non U-Shaped Vacillatory and Team Learning

  • Conference paper
Algorithmic Learning Theory (ALT 2005)

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

Included in the following conference series:

Abstract

U-shaped learning behaviour in cognitive development involves learning, unlearning and relearning. It occurs, for example, in learning irregular verbs. The prior cognitive science literature is occupied with how humans do it, for example, general rules versus tables of exceptions. This paper is mostly concerned with whether U-shaped learning behaviour may be necessary in the abstract mathematical setting of inductive inference, that is, in the computational learning theory following the framework of Gold. All notions considered are learning from text, that is, from positive data. Previous work showed that U-shaped learning behaviour is necessary for behaviourally correct learning but not for syntactically convergent, learning in the limit (= explanatory learning). The present paper establishes the necessity for the whole hierarchy of classes of vacillatory learning where a behaviourally correct learner has to satisfy the additional constraint that it vacillates in the limit between at most k grammars, where k ≥ 1. Non U-shaped vacillatory learning is shown to be restrictive: Every non U-shaped vacillatorily learnable class is already learnable in the limit. Furthermore, if vacillatory learning with the parameter k=2 is possible then non U-shaped behaviourally correct learning is also possible. But for k=3, surprisingly, there is a class witnessing that this implication fails.

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 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.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, R.: When unlearning helps Manuscript (2005), http://www.cis.udel.edu/~case/papers/decisive.ps , Preliminary version of the paper appeared at ICALP 2000. LNCS, vol. 1853, pp. 844–855. Springer, Heidelberg (2000)

  2. Bārzdiņš, J.: Two theorems on the limiting synthesis of functions. In: Theory of Algorithms and Programs, vol. 1, pp. 82–88. Latvian State University (1974) (in Russian)

    Google Scholar 

  3. Blum, L., Blum, M.: Towards a mathematical theory of inductive inference. Information and Control 28, 125–155 (1975)

    Article  MATH  MathSciNet  Google Scholar 

  4. Blum, M.: A machine independent theory of the complexity of the recursive functions. Journal of the Association for Computing Machinery 14, 322–336 (1967)

    MATH  MathSciNet  Google Scholar 

  5. Bower, T.G.R.: Concepts of development. In: Proceedings of the 21st International Congress of Psychology, pp. 79–97. Presses Universitaires de France (1978)

    Google Scholar 

  6. Bowerman, M.: Starting to talk worse: Clues to language acquisition from children’s late speech errors. In: Strauss, S., Stavy, R. (eds.) U-Shaped Behavioral Growth. Academic Press, New York (1982)

    Google Scholar 

  7. Carey, S.: Face perception: Anomalies of development. In: Strauss, S., Stavy, R. (eds.) U-Shaped Behavioral Growth. Developmental Psychology Series, pp. 169–190. Academic Press, London (1982)

    Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  9. Case, J., Lynes, C.: Machine inductive inference and language identification. In: Nielsen, M., Schmidt, E.M. (eds.) ICALP 1982. LNCS, vol. 140, pp. 107–115. Springer, Heidelberg (1982)

    Chapter  Google Scholar 

  10. Case, J., Smith, C.H.: Comparison of identification criteria for machine inductive inference. Theoretical Computer Science 25, 193–220 (1983)

    Article  MATH  MathSciNet  Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

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

    Article  MathSciNet  Google Scholar 

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

    Article  MATH  Google Scholar 

  14. Kirsh, D.: PDP learnability and innate knowledge of language. In: Davis, S. (ed.) Connectionism: Theory and Practice, pp. 297–322. Oxford University Press, Oxford (1992)

    Google Scholar 

  15. 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(4), University of Chicago Press (1992); Includes commentary by Harold Clahsen

    Google Scholar 

  16. Odifreddi, P.: Classical Recursion Theory. North Holland, Amsterdam (1989)

    Google Scholar 

  17. Osherson, D., Weinstein, S.: Criteria of language learning. Information and Control 52, 123–138 (1982)

    Article  MATH  MathSciNet  Google Scholar 

  18. Pinker, S.: Formal models of language learning. Cognition 7, 217–283 (1979)

    Article  Google Scholar 

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

    Article  Google Scholar 

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

    Google Scholar 

  21. Smith, C.H.: The power of pluralism for automatic program synthesis. Journal of the Association of Computing Machinery 29, 1144–1165 (1982)

    MATH  Google Scholar 

  22. Strauss, S., Stavy, R. (eds.): U-Shaped Behavioral Growth. Developmental Psychology Series. Academic Press, London (1982)

    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(2), 123–155 (2002)

    Article  Google Scholar 

  24. Wexler, K.: On extensional learnability. Cognition 11, 89–95 (1982)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Carlucci, L., Case, J., Jain, S., Stephan, F. (2005). Non U-Shaped Vacillatory and Team Learning. In: Jain, S., Simon, H.U., Tomita, E. (eds) Algorithmic Learning Theory. ALT 2005. Lecture Notes in Computer Science(), vol 3734. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11564089_20

Download citation

  • DOI: https://doi.org/10.1007/11564089_20

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-29242-5

  • Online ISBN: 978-3-540-31696-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics