A survey of some aspects of computational learning theory

作者: György Turán

DOI: 10.1007/3-540-54458-5_53

关键词:

摘要: In the introduction of his paper starting computational learning theory, Valiant observed that intuitive notion merits similar attention from point view formal theoretical study as computing. this comparison, appears to be more elusive, difficult capture by a unified mathematical theory (as noted Haussler (1990), it is not clear whether such even possible or desirable). Research was focused on concept learning, which in fact closely related computing several approaches developed computer science can adapted its study. Interesting connections were found with other fields combinatorial optimization, cryptography and statistical pattern recognition. survey we gave short account some aspects results obtained describing models, characterizations learnability, algorithms negative results.

参考文章(47)
Balaubramaniam Kausik Natarajan, None, Learning Functions from Examples ,(1987)
David Haussler, Probably approximately correct learning national conference on artificial intelligence. pp. 1101- 1108 ,(1990)
D. Angluin, M. Frazier, L. Pitt, Learning conjunctions of Horn clauses foundations of computer science. pp. 186- 192 ,(1990) , 10.1109/FSCS.1990.89537
David E. Rumelhart, James L. McClelland, , Parallel distributed processing: explorations in the microstructure of cognition, vol. 1: foundations Computational Models of Cognition and Perception. ,(1986) , 10.7551/MITPRESS/5236.001.0001
L. Pitt, M.K. Warmuth, The minimum consistent DFA problem cannot be approximated within any polynomial structure in complexity theory annual conference. pp. 230- ,(1989) , 10.1109/SCT.1989.41829
E Mark Gold, Language identification in the limit Information & Computation. ,vol. 10, pp. 447- 474 ,(1967) , 10.1016/S0019-9958(67)91165-5
N Sauer, On the density of families of sets Journal of Combinatorial Theory, Series A. ,vol. 13, pp. 145- 147 ,(1972) , 10.1016/0097-3165(72)90019-2
N. Linial, Y. Mansour, N. Nisan, Constant depth circuits, Fourier transform, and learnability foundations of computer science. pp. 574- 579 ,(1989) , 10.1109/SFCS.1989.63537
Dana Angluin, Learning regular sets from queries and counterexamples Information & Computation. ,vol. 75, pp. 87- 106 ,(1987) , 10.1016/0890-5401(87)90052-6