Apple tasting and nearly one-sided learning
暂无分享,去创建一个
[1] Vladimir Vapnik,et al. Chervonenkis: On the uniform convergence of relative frequencies of events to their probabilities , 1971 .
[2] Leslie G. Valiant,et al. A theory of the learnable , 1984, STOC '84.
[3] N. Littlestone. Learning Quickly When Irrelevant Attributes Abound: A New Linear-Threshold Algorithm , 1987, 28th Annual Symposium on Foundations of Computer Science (sfcs 1987).
[4] D. Angluin. Queries and Concept Learning , 1988 .
[5] David Haussler,et al. Predicting {0,1}-functions on randomly drawn points , 1988, COLT '88.
[6] Manfred K. Warmuth,et al. The weighted majority algorithm , 1989, 30th Annual Symposium on Foundations of Computer Science.
[7] Manfred K. Warmuth,et al. Learning nested differences of intersection-closed concept classes , 2004, Machine Learning.
[8] Wolfgang Maass,et al. On the complexity of learning from counterexamples , 1989, 30th Annual Symposium on Foundations of Computer Science.
[9] Wolfgang Maass,et al. On the complexity of learning from counterexamples and membership queries (abstract) , 1990, COLT 1990.
[10] Avrim Blum. Separating PAC and mistake-bound learning models over the Boolean domain (abstract) , 1990, COLT '90.
[11] Avrim Blum,et al. Separating distribution-free and mistake-bound learning models over the Boolean domain , 1990, Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science.
[12] Balas K. Natarajan. Probably Approximate Learning of Sets and Functions , 1991, SIAM J. Comput..
[13] Wolfgang Maass,et al. On-line learning with an oblivious environment and the power of randomization , 1991, COLT '91.
[14] Philip M. Long,et al. On-line learning with linear loss constraints , 1993, COLT '93.