Skip to main content

A solution of the credit assignment problem in the case of learning rectangles

Abstract

  • Conference paper
  • First Online:
Analogical and Inductive Inference (AII 1992)

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

Included in the following conference series:

  • 181 Accesses

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

Access this chapter

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, 1988, 319–342.

    Google Scholar 

  2. Z. Chen, W. Maass, “On-line learning of rectangles”, Proc. of the Fifth Annual ACM Workshop on Computational Learning Theory 1992

    Google Scholar 

  3. P. R. Cohen, E. A. Feigenbaum, “The Handbook of Artificial Intelligence” vol. 3, William Kaufmann (Los Altos, 1982).

    Google Scholar 

  4. D. Haussler, personal communication, 1989.

    Google Scholar 

  5. D.J. Kleitman, A.R. Meyer, R.L. Rivest, J. Spencer, K. Winklman, “Coping with errors in binary search procedures”, J. Comp. Syst. Sci., 1980, 396–404.

    Google Scholar 

  6. N. Littlestone, “Learning quickly when irrelevant attributes abound: a new linear threshold algorithm”, Machine Learning, 2, 1987, 285–318.

    Google Scholar 

  7. W. Maass, G. Turán, “On the complexity of learning from counterexamples (extended abstract)”, Proc of the 30th Annual I.E.E.E. Symposium on Foundations of Computer Science, 1989, 262–267.

    Google Scholar 

  8. W. Maass, G. Turán, “Algorithms and Lower Bounds for On-line Learning of Geometrical Concepts”, Report 316 (Oct. 1991), IIG-Report Series, Technische Universitaet Graz; to appear in Machine Learning.

    Google Scholar 

  9. W. Maass, G. Turán, “Lower bound methods and separation results for on-line learning models”, Report 322 (Nov.1991), IIG-Report Series, Technische Universitaet Graz; to appear in Machine Learning (1992)

    Google Scholar 

  10. A. Pelc, “Searching with known error probability”, Theoretical Comp. Sci., 1989, 185–202.

    Google Scholar 

  11. L. Pitt, L. G. Valiant, “Computational limitations on learning from examples”, J. of the ACM, 35, 1988, 965–984.

    Google Scholar 

  12. J. Spencer, P. Winkler, “Three thresholds for a liar”, DIMACS Tech. Report 91-72 (Oct. 1991).

    Google Scholar 

  13. L.G. Valiant, “A theory of the learnable”, Comm. of the ACM, 27, 1984, 1134–1142.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Klaus P. Jantke

Rights and permissions

Reprints and permissions

Copyright information

© 1992 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Chen, Z., Maass, W. (1992). A solution of the credit assignment problem in the case of learning rectangles. In: Jantke, K.P. (eds) Analogical and Inductive Inference. AII 1992. Lecture Notes in Computer Science, vol 642. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-56004-1_2

Download citation

  • DOI: https://doi.org/10.1007/3-540-56004-1_2

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-56004-3

  • Online ISBN: 978-3-540-47339-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics