Statistical queries and faulty PAC oracles
暂无分享,去创建一个
[1] Michael Kearns,et al. Computational complexity of machine learning , 1990, ACM distinguished dissertations.
[2] Alon Itai,et al. Learnability by fixed distributions , 1988, COLT '88.
[3] Thomas R. Hancock,et al. Learning 2u DNF formulas and ku decision trees , 1991, COLT 1991.
[4] Peter L. Bartlett,et al. Investigating the distribution assumptions in the Pac learning model , 1991, COLT '91.
[5] Yoav Freund,et al. An improved boosting algorithm and its implications on learning complexity , 1992, COLT '92.
[6] Eyal Kushilevitz,et al. Learning by distances , 1990, COLT '90.
[7] Michael Kearns,et al. Efficient noise-tolerant learning from statistical queries , 1993, STOC.
[8] Ming Li,et al. Learning in the presence of malicious errors , 1993, STOC '88.
[9] David Haussler,et al. Quantifying Inductive Bias: AI Learning Algorithms and Valiant's Learning Framework , 1988, Artif. Intell..
[10] Peter L. Bartlett,et al. Learning with a slowly changing distribution , 1992, COLT '92.
[11] Leslie G. Valiant,et al. On the learnability of Boolean formulae , 1987, STOC.
[12] Thomas R. Hancock,et al. Learning 2µ DNF Formulas and kµ Decision Trees , 1991, COLT.
[13] Leonard Pitt,et al. On the necessity of Occam algorithms , 1990, STOC '90.
[14] Leslie G. Valiant,et al. A theory of the learnable , 1984, STOC '84.
[15] Noam Nisan,et al. Constant depth circuits, Fourier transform, and learnability , 1989, 30th Annual Symposium on Foundations of Computer Science.
[16] Sean W. Smith,et al. Improved learning of AC0 functions , 1991, COLT '91.
[17] Alon Itai,et al. Dominating distributions and learnability , 1992, COLT '92.