The Optimal PAC Algorithm
暂无分享,去创建一个
[1] David Haussler,et al. Predicting {0,1}-functions on randomly drawn points , 1988, COLT '88.
[2] Peter Auer,et al. A new PAC bound for intersection-closed concept classes , 2004, Machine Learning.
[3] Yi Li,et al. The one-inclusion graph algorithm is near-optimal for the prediction model of learning , 2001, IEEE Trans. Inf. Theory.
[4] Peter Auer,et al. A New PAC Bound for Intersection-Closed Concept Classes , 2004, COLT.
[5] David Haussler,et al. Learnability and the Vapnik-Chervonenkis dimension , 1989, JACM.
[6] Leslie G. Valiant,et al. A general lower bound on the number of examples needed for learning , 1988, COLT '88.