Skip to main content

Editors’ Introduction

  • Conference paper
  • First Online:
Algorithmic Learning Theory (ALT 2002)

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

Included in the following conference series:

  • 484 Accesses

Abstract

Learning theory is a research area involved in the study, design, and analysis of computer programs that are able to learn from past experiences. Over the last years the idea of learning system has independently emerged in a variety of fields: pattern recognition, theory of repeated games, machine learning, universal prediction and data compression, inductive inference, adaptive optimal control, computational psychology, and others. This is not surprising: on the one hand, the notion of adaptivity is an extremely attractive and powerful tool; on the other hand, the abstract phenomenon of learning is so complex that it is unlikely that a single theory will ever be able to explain it in a fully satisfactory way. Despite their apparent diversity, these learning models present deep connections whose study is an active research area in learning theory.

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. D. Angluin. Queries and concept learning. Machine Learning, 2(4):319–342, 1988.

    Google Scholar 

  2. Y. Freund and R.E. Schapire. A decision-theoretic generalization of on-line learning and an application to boosting. Journal of Computer and System Sciences, 55(1):119–139, 1997.

    Article  MATH  MathSciNet  Google Scholar 

  3. E.M. Gold. Language identification in the limit. Information and Control, 10:447–474, 1967.

    Article  MATH  Google Scholar 

  4. L. Valiant. A theory of the learnable. Communications of the ACM, 27(11):1134–1142, 1984.

    Article  MATH  Google Scholar 

  5. V.N. Vapnik. Estimation of Dependences Based on Empirical Data. Springer, 1982.

    Google Scholar 

  6. V.N. Vapnik. The Nature of Statistical Learning Theory. Springer Verlag, 1999. 2nd edition.

    Google Scholar 

Download references

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

(2002). Editors’ Introduction. 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_1

Download citation

  • DOI: https://doi.org/10.1007/3-540-36169-3_1

  • 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

Publish with us

Policies and ethics