Testing problems with sublearning sample complexity

Journal of Computer and System Sciences

Volumn 61, Issue 3, 2000, Pages 428-456

  Kearns, Michael ^a   Ron, Dana ^b  

^a AT AND T LABS RESEARCH   (United States)

^b TEL AVIV UNIVERSITY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION THEORY; COMBINATORIAL CIRCUITS; COMPUTATIONAL COMPLEXITY; NEURAL NETWORKS;

SUBLEARNING SAMPLE COMPLEXITY;

LEARNING ALGORITHMS;

EID: 0034498619     PISSN: 00220000     EISSN: None     Source Type: Journal    
DOI: 10.1006/jcss.1999.1656     Document Type: Article

References (13)

1. Bellare M., Coppersmith D., Håstad J, Kiwi M., Sudan M. Linearity testing in characteristic two. Proceedings of the Thirty-Sixth Annual Symposium on Foundations of Computer Science. 1995;. p. 432-441.
2. Blum M., Luby M., Rubinfeld R. Self-testing/correcting with applications to numerical problems. J. Comput. System Sci. 47:1993;549-595.
3. O. Goldreich, S. Goldwasser, E. Lehman, and, D. Ron, Testing monotonicity. Long version of extended abstract that will appear in "Proceedings of FOCS98," available, http://theory.lcs.mit.edu/danar , 1998.
4. Goldreich O., Goldwasser S., Ron D. Property testing and its connection to learning and approximation. Proceedings of the Thirty-Seventh Annual Symposium on Foundations of Computer Science. 1996;. p. 339-348.
5. Goldwasser S., Micali S. Probabilistic encryption. J. Comput. System Sci. 28:1984;270-299.
6. Goldreich O., Ron D. Property testing in bounded degree graphs. Proceedings of the Twenty-Ninth ACM Symposium on the Theory of Computing. 1997;. p. 406-415.
7. Goldreich O., Ron D. A sublinear bipartite tester for bounded degree graphs. Proceedings of the Thirtieth Annual ACM Symposium on the Theory of Computing. 1998.
8. Kiefer J. C. Introduction to Statistical Inference. 1987;Springer-Verlag, Berlin/New York.
9. Kearns M., Li M., Valiant L. Learning boolean formulae. J. Assoc. Comput. Mach. 41:1995;1298-1328.
10. Kulkarni S. R., Zeitouni O. On probably correct classification of concepts. Proceedings of the Sixth Annual ACM Conference on Computational Learning Theory. 1993;. p. 111-116.
11. Rubinfeld R., Sudan M. Robust characterization of polynomials with applications to program testing. SIAM J. Comput. 25:1996;252-271.
12. Rubinfeld R. Robust functional equations and their applications to program testing. Proceedings of the Thirty Annual Symposium on Foundations of Computers Science. 1994.
13. Yamanishi K. Probability almost discriminative learning. Mach. Learning. 18:1995;23-50.