Learning sparse multivariate polynomials over a field with queries and counterexamples

Journal of Computer and System Sciences

Volumn 52, Issue 2, 1996, Pages 201-213

  Schapire, Robert E ^a   Sellie, Linda M ^b  

^a LUCENT TECHNOLOGIES   (United States)

^b UNIVERSITY OF CHICAGO   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BOOLEAN ALGEBRA; EQUIVALENCE CLASSES; MATHEMATICAL MODELS; POLYNOMIALS; VECTORS;

COUNTEREXAMPLES; EQUIVALENCE QUERIES; MEMBERSHIP QUERIES; SPARSE MULTIVARIATE POLYNOMIALS;

ALGORITHMS;

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

References (23)

1. D. Angluin, Learning regular sets from queries and counterexamples, Inform, and Comput. 75 (1987), 87-106.
2. S. Ar, R. J. Lipton, R. Rubinfeld, and M. Sudan, Reconstructing algebraic functions from mixed data, in "33rd Annual Symposium on Foundations of Computer Science, October 1992," pp. 503-512.
3. M. Ben-Or and P. Tiwari, A deterministic algorithm for sparse multivariate polynomial interpolation, in "Proceedings, Twentieth Annual ACM Symposium on Theory of Computing, May 1988," pp. 301-309.
4. A. Blum, Learning boolean functions in a infinite attribute space, Mach. Learning 9, (No. 4) (1992), 373-386.
5. A. Blum and M. Singh, Learning functions of k terms, in "Proceedings, Third Annual Workshop on Computational Learning Theory, August 1990," pp. 144-153.
6. A. Blumer, A. Ehrenfeucht, D. Haussler, and M. K. Warmuth, Learnability and the Vapnik-Chervonenkis dimension, J. Assoc. Comput. Mach. 36, (No. 4) (1989), 929-965.
7. N. H. Bshouty, Exact learning via the monotone theory, in "34th Annual Symposium on Foundations of Computer Science, November 1993."
8. M. Clausen, A. Dress, J. Grabmeier, and M. Karpinski, On zero-testing and interpolation of k-sparse multivariate polynomials over finite fields, Theoret. Comput. Sc. 84 (1991), 151-164.
9. A. Dress and J. Grabmeier, The interpolation problem for k-sparse polynomials and character sums, Adv. in Appl. Math. 12 (1991), 57-75.
10. A. Dür and J. Grabmeier, Applying coding theory to sparse interpolation, SIAM J. Comput. 22, (No. 4) (1993), 695-704.
11. P. Fischer and H. Ulrich Simon, On learning ring-sum-expansions, SIAM J. Comput. 21, (No. 1) (1992), 181-192.
12. P. Gemmell and M. Sudan, Highly resilient correctors for polynomials, Inform. Process. Lett. 43, (No. 4) (1992), 169-174.
13. D. Yu. Grigoriev, M. Karpinski, and M. F. Singers, Fast parallel algorithms for sparse multivariate polynomial interpolation over finite fields, SIAM J. Comput. 19, (No. 6) (1990), 1059-1963.
14. D. Haussler, Decision theoretic generalezations of the PAC model for neural net and other learning applications, Inform, and Comput. 100, (No. 1) (1992), 78-150.
15. L. Hellerstein and M. Warmuth, Interpolating GF[2] polynomials, unpublished manuscript.
16. I. N. Herstein, "Topics in Algebra," New York, Wiley, 2nd ed., 1975.
17. E. Kushilevitz and Y. Mansour, Learning decision trees using the Fourier spectrum, SIAM J. Comput. 22, (No. 6) (1993), 1331-1348.
18. Y. Mansour, Randomized interpolation and approximation of sparse polynomials, "Automata, Languages and Programming: 19th International Colloquium, July 1992," pp. 261-272.
19. R. M. Roth and G. M. Benedek, Interpolation and approximation of sparse multivariate polynomials over GF(2), SIAM J. Comput. 20, (No. 2) (1991), 291-314.
20. L. G. Valiant, A theory of learnable, Comm. ACM 27, (No. 11) (1984), 1134-1142.
21. H. S. Wilf, Hadamard determinants, Möbius functions, and chromatic number of a graph, Bull. Amer. Math. Soc. 74, (No. 5) (1968), 960-964.
22. R. Zippel, Probalistic algorithms for sparse polynomials, in "Symbolic and Algebraic Computation," pp. 216-226, Springer-Verlag, New York/Berlin, 1979.
23. R. Zippel, Interpolating polynomials from their values, J. Symbolic Comput. 9 (1990), 375-403.