论文信息 - On the sample complexity of pac-learning using random and chosen examples - 字舞流文

On the sample complexity of pac-learning using random and chosen examples

Ronald L. Rivest | Bonnie Eisenberg | R. Rivest | Bonnie Eisenberg | Bonnie Eisenberg

[1] Leslie G. Valiant,et al. A general lower bound on the number of examples needed for learning , 1988, COLT '88.

[2] Dana Angluin,et al. Learning Regular Sets from Queries and Counterexamples , 1987, Inf. Comput..