A general lower bound on the number of examples needed for learning

[1]  Michael Kearns,et al.  Computational complexity of machine learning , 1990, ACM distinguished dissertations.

[2]  David Haussler,et al.  Learnability and the Vapnik-Chervonenkis dimension , 1989, JACM.

[3]  M. Kearns,et al.  Crytographic limitations on learning Boolean formulae and finite automata , 1989, STOC '89.

[4]  David Haussler,et al.  What Size Net Gives Valid Generalization? , 1989, Neural Computation.

[5]  Alon Itai,et al.  Learnability by fixed distributions , 1988, COLT '88.

[6]  David Haussler,et al.  Predicting {0,1}-functions on randomly drawn points , 1988, COLT '88.

[7]  Jeffrey Scott Vitter,et al.  Learning in parallel , 1988, COLT '88.

[8]  Nathan Linial,et al.  Results on learnability and the Vapnik-Chervonenkis dimension , 1988, [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science.

[9]  David Haussler,et al.  Predicting (0, 1)-functions on randomly drawn points , 1988, [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science.

[10]  Leslie G. Valiant,et al.  Computational limitations on learning from examples , 1988, JACM.

[11]  David Haussler,et al.  Quantifying Inductive Bias: AI Learning Algorithms and Valiant's Learning Framework , 1988, Artif. Intell..

[12]  Haim Schweitzer.  Non-Learnable Classes of Boolean Formulae That Are Closer Under Variable Permutation , 1988, COLT.

[13]  Ming Li,et al.  Learning in the presence of malicious errors , 1993, STOC '88.

[14]  David Haussler,et al.  ɛ-nets and simplex range queries , 1987, Discret. Comput. Geom..

[15]  N. Littlestone.  Learning Quickly When Irrelevant Attributes Abound: A New Linear-Threshold Algorithm , 1987, 28th Annual Symposium on Foundations of Computer Science (sfcs 1987).

[16]  Balas K. Natarajan,et al.  On learning Boolean functions , 1987, STOC.

[17]  Leslie G. Valiant,et al.  On the learnability of Boolean formulae , 1987, STOC.

[18]  David Haussler,et al.  Classifying learnable geometric concepts with the Vapnik-Chervonenkis dimension , 1986, STOC '86.

[19]  David Haussler,et al.  Epsilon-nets and simplex range queries , 1986, SCG '86.

[20]  Narendra Karmarkar,et al.  A new polynomial-time algorithm for linear programming , 1984, STOC '84.

[21]  Leslie G. Valiant,et al.  A theory of the learnable , 1984, STOC '84.

[22]  Richard M. Dudley,et al.  Some special vapnik-chervonenkis classes , 1981, Discret. Math..

[23]  Temple F. Smith.  Occam's razor , 1980, Nature.

[24]  L. G. H. Cijan.  A polynomial algorithm in linear programming , 1979 .

[25]  Leslie G. Valiant,et al.  Fast probabilistic algorithms for hamiltonian circuits and matchings , 1977, STOC '77.

[26]  Vladimir Vapnik,et al.  Chervonenkis: On the uniform convergence of relative frequencies of events to their probabilities , 1971 .

[27]  H. Chernoff.  A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations , 1952 .