References
Angluin, D. (1986a). Learning regular sets from queries and counter-examples. Tech. Rept. TR-464, Yale U. Comp. Sci. Dept.
Angluin, D. (1986b). Types of queries for concept learning. Tech. Rept. TR-479, Yale U. Comp. Sci. Dept.
Angluin, D., & Laird, P.D. (1986). Identifying k-CNF formulas from noisy examples. Tech. Rept. TR-478, Yale U. Comp. Sci. Dept.
Blumer, A., Ehrenfeucht, A., Haussler, D., & Warmuth, M. (1986a). Classifying learnable geometric concepts with the Vapnik-Chervonenkis dimension. In Proc of the 18th Annual ACM STOC, pp. 273–282.
Blumer, A., Ehrenfeucht, A. Haussler, D., & Warmuth, M. (1986b). Occam's razor. Tech. Rept. UCSC-CRL-86-2, UC Santa Cruz.
Haussler, D. (1986). Quantifying the inductive bias in concept learning. Tech. Rept. UCSC-CRL-86-25, UC Santa Cruz.
Kearns, M., Li, M., Pitt, L., & Valiant, L.G. (1987). On the learnability of boolean formulae. In Proc. of the 19th Annual ACM STOC.
Pitt. L., & Valiant, L.G. (1986). Computational limitations on learning from examples. Tech. Rept. TR-05-86, Harvard University, submitted for publication.
Rivest, R. (1986). Learning decision-lists. Unpublished manuscript.
Valiant, L.G. (1984a). A theory of the learnable. Comm. ACM, 27 (11) 1134–1142.
Valiant, L.G. (1984b). Deductive learning. Phil. Trans. R. Soc. Lond. A 312, 441–446.
Valiant, L.G. (1985). Learning disjunctions of conjunctions. In Proceedings of the 9th IJCAI, vol. 1, pp 560–566, Los Angeles, CA.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1987 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Valiant, L.G. (1987). Recent developments in the theory of learning. In: Ottmann, T. (eds) Automata, Languages and Programming. ICALP 1987. Lecture Notes in Computer Science, vol 267. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-18088-5_49
Download citation
DOI: https://doi.org/10.1007/3-540-18088-5_49
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-18088-3
Online ISBN: 978-3-540-47747-1
eBook Packages: Springer Book Archive