DNF are teachable in the average case

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4005 LNAI, Issue , 2006, Pages 214-228

  Lee, Homin K ^a   Servedio, Rocco A ^a   Wan, Andrew ^a  

^a Columbia University ^*  (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMBINATORIAL MATHEMATICS; KNOWLEDGE ACQUISITION; LINEAR SYSTEMS; PERSONNEL; POLYNOMIALS; THEOREM PROVING;

COMBINATORICS; LEARNING THEORY; TEACHING DIMENSION;

LEARNING SYSTEMS;

EID: 33746089898     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11776420_18     Document Type: Conference Paper

References (15)

1. M. Alekhnovich, M. Braverman, V. Feldman, A. Klivans, and T. Pitassi. Learnability and automatizability. In Proceedings of the 45th IEEE Symposium on Foundations of Computer Science, pages 621-630, 2004.
2. M. Anthony, G. Brightwell, and J. Shawe-Taylor. On specifying Boolean functions by labelled examples. Discrete Applied Math., 61(1):1-25, 1995.
3. F. Balbach. Teaching classes with high teaching dimension using few examples. In Proc. 18th Annual COLT, pages 637-651, 2005.
4. A. Blum. Learning a function of r relevant variables (open problem). In Proc. 16th Annual COLT, pages 731-733, 2003.
5. N. Bshouty and Y. Mansour. Simple Learning Algorithms for Decision Trees and Multivariate Polynomials. SIAM J. Comput., 31(6):1909-1925, 2002.
6. J. Cherniavsky and R. Statman. Testing: An abstract approach. In Proceedings of the 2nd Workshop on Software Testing, 1988.
7. S. Goldman and M. Kearns. On the complexity of teaching. Journal of Computer and System Sciences, 50(1):20-31, February 1992.
8. S. Goldman, R. Rivest, and R. Schapire. Learning binary relations and total orders. SIAM Journal on Computing, 22(5):1006-1034, October 1993.
9. Christian Kuhlmann. On teaching and learning intersection-closed concept classes. In Proc. 4th EUROCOLT, pages 168-182, 1999.
10. E. Kushilevitz, N. Linial, Y. Rabinovich, and M. Saks. Witness sets for families of binary vectors. J. Combinatorial Theory, 73(2):376-380, 1996.
11. H. Lee, R. Servedio, and A. Wan. DNF are Teachable in the Average Case (full version). Available at http://www.cs.columbia.edu/~rocco/papers/dnfteach. html.
12. E. Mossel, R. O'Donnell, and R. Servedio. Learning functions of k relevant variables. J. Comput. & Syst. Sci., 69(3):421-434, 2004.
13. R. Roth and G. Benedek. Interpolation and approximation of sparse multivariate polynomials over GF(2). SIAM J. Comput., 20(2):291-314, 1991.
14. R. Schapire and L. Sellie. Learning sparse multivariate polynomials over a field with queries and counterexamples. J. Comput. & Syst. Sci., 52(2):201-213, 1996.
15. Gadiel Seroussi and Nader Bshouty. Vector sets for exhaustive testing of logic circuits. IEEE Trans. on Information Theory, 34(3):513-522, 1988.