A GENERAL LOWER BOUND ON THE NUMBER OF EXAMPLES NEEDED FOR LEARNING

[1] Angluin D., 1988, Machine Learning, V2, P319, DOI 10.1007/BF00116828

[2] FAST PROBABILISTIC ALGORITHMS FOR HAMILTONIAN CIRCUITS AND MATCHINGS [J]. JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 1979, 18 (02) : 155 - 193

[3] What Size Net Gives Valid Generalization? [J]. NEURAL COMPUTATION, 1989, 1 (01) : 151 - 160

[4] BENEDEK GM, 1988, 1ST WORKSH COMP LEAR

[5] OCCAM RAZOR [J]. INFORMATION PROCESSING LETTERS, 1987, 24 (06) : 377 - 380

[6] BLUMER A, 1989, J ASS COMPUT MACH, V36

[7] BLUMER A, 1986, 18TH P ACM S THEOR C, P273

[8] A MEASURE OF ASYMPTOTIC EFFICIENCY FOR TESTS OF A HYPOTHESIS BASED ON THE SUM OF OBSERVATIONS [J]. ANNALS OF MATHEMATICAL STATISTICS, 1952, 23 (04): : 493 - 507

[9] Haussler D., 1988, 29th Annual Symposium on Foundations of Computer Science (IEEE Cat. No.88CH2652-6), P100, DOI 10.1109/SFCS.1988.21928

[10] EPSILON-NETS AND SIMPLEX RANGE QUERIES [J]. DISCRETE & COMPUTATIONAL GEOMETRY, 1987, 2 (02) : 127 - 151

[1] Angluin D., 1988, Machine Learning, V2, P319, DOI 10.1007/BF00116828

[2] FAST PROBABILISTIC ALGORITHMS FOR HAMILTONIAN CIRCUITS AND MATCHINGS [J]. JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 1979, 18 (02) : 155 - 193

[3] What Size Net Gives Valid Generalization? [J]. NEURAL COMPUTATION, 1989, 1 (01) : 151 - 160

[4] BENEDEK GM, 1988, 1ST WORKSH COMP LEAR

[5] OCCAM RAZOR [J]. INFORMATION PROCESSING LETTERS, 1987, 24 (06) : 377 - 380

[6] BLUMER A, 1989, J ASS COMPUT MACH, V36

[7] BLUMER A, 1986, 18TH P ACM S THEOR C, P273

[8] A MEASURE OF ASYMPTOTIC EFFICIENCY FOR TESTS OF A HYPOTHESIS BASED ON THE SUM OF OBSERVATIONS [J]. ANNALS OF MATHEMATICAL STATISTICS, 1952, 23 (04): : 493 - 507

[9] Haussler D., 1988, 29th Annual Symposium on Foundations of Computer Science (IEEE Cat. No.88CH2652-6), P100, DOI 10.1109/SFCS.1988.21928

[10] EPSILON-NETS AND SIMPLEX RANGE QUERIES [J]. DISCRETE & COMPUTATIONAL GEOMETRY, 1987, 2 (02) : 127 - 151