Extending the Valiant Learning Model

作者: JONATHAN AMSTERDAM

DOI: 10.1016/B978-0-934613-64-4.50044-X

关键词:

摘要: Abstract Valiant's formal model of concept learning has received some attention because its strong performance guarantees. However, it rarely been used in practice, part the known learnable classes are too restricted. Here I suggest two ways to avoid this problem. One explores power gained by allowing learner experiment with environment degree, rather than just passively view examples be learned. It is shown that for a special case, no standard model, but slightly different does engender differences. The question whether experimentation equivalent from general case an important open problem; if they equivalent, suitability Valiant capturing function experiments science called into question. second extension considers measure proximity classes, density, defined mesh model. close learned can determined viewing only polynomial number examples. Density also wider applicability as appropriateness bias.

参考文章(13)
David Haussler, Quantifying the inductive bias in concept learning (extended abstract) national conference on artificial intelligence. pp. 485- 489 ,(1986)
Paul E Utgoff, Tom M Mitchell, None, Acquisition of appropriate bias for inductive concept learning national conference on artificial intelligence. pp. 414- 417 ,(1982)
MICHAEL KEARNS, MING LI, LEONARD PITT, LESLIE G. VALIANT, Recent Results on Boolean Concept Learning Proceedings of the Fourth International Workshop on MACHINE LEARNING#R##N#June 22–25, 1987 University of California, Irvine. pp. 337- 352 ,(1987) , 10.1016/B978-0-934613-41-5.50037-4
L. G. Valiant, Learning disjunction of conjunctions international joint conference on artificial intelligence. pp. 560- 566 ,(1985)
L. G. Valiant, A theory of the learnable symposium on the theory of computing. ,vol. 27, pp. 1134- 1142 ,(1984) , 10.1145/800057.808710
Larry Rendell, A General Framework for Induction and a Study of Selective Induction Machine Learning. ,vol. 1, pp. 177- 226 ,(1986) , 10.1023/A:1022850228501
A Blumer, A Ehrenfeucht, D Haussler, M Warmuth, Classifying learnable geometric concepts with the Vapnik-Chervonenkis dimension symposium on the theory of computing. pp. 273- 282 ,(1986) , 10.1145/12130.12158
Anselm Blumer, Andrzej Ehrenfeucht, David Haussler, Manfred K. Warmuth, Occam's razor Information Processing Letters. ,vol. 24, pp. 377- 380 ,(1987) , 10.1016/0020-0190(87)90114-1
M. Kearns, M. Li, L. Pitt, L. Valiant, On the learnability of Boolean formulae symposium on the theory of computing. pp. 285- 295 ,(1987) , 10.1145/28395.28426
Wassily Hoeffding, Probability Inequalities for sums of Bounded Random Variables Journal of the American Statistical Association. ,vol. 58, pp. 13- 30 ,(1963) , 10.1007/978-1-4612-0865-5_26