Simple learning algorithms for decision trees and multivariate polynomials

SIAM Journal on Computing

Volumn 31, Issue 6, 2002, Pages 1909-1925

  Bshouty, Nader H ^a   Mansour, Yishay ^b  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

^b TEL AVIV UNIVERSITY   (Israel)

Author keywords

Decision tree learning; Learning interpolation; Multivariate polynomial

Indexed keywords

APPROXIMATION THEORY; BOOLEAN FUNCTIONS; BOUNDARY CONDITIONS; COMPUTATIONAL COMPLEXITY; INTERPOLATION; LEARNING ALGORITHMS; LEARNING SYSTEMS; MEMBERSHIP FUNCTIONS; POLYNOMIALS;

BOUNDED PRODUCT DISTRIBUTION; DECISION TREES; DISJUNCTIVE NORMAL FORM; LEARNING INTERPOLATION; MEMBERSHIP QUERIES; MULTIVARIATE POLYNOMIALS;

TREES (MATHEMATICS);

EID: 0036767111     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/S009753979732058X     Document Type: Article

References (19)

1. D. Angluin, Queries and concept learning, Machine Learning, 2 (1988), pp. 319-342.
2. N. Alon and J. H. Spencer, The Probabilistic Method, John Wiley and Sons, New York, 1992.
3. M. Ben-Or and P. Tiwari, A deterministic algorithm for sparse multivariate polynomial interpolation, in Proceedings of the 20th Annual ACM Symposium on Theory of Computing, 1988, pp. 301-309.
4. N. H. Bshouty, Exact learning of boolean functions via the monotone theory, Inform. Comput., 123 (1995), pp. 146-153.
5. N. H. Bshouty, A note on learning multivariate polynomials under the uniform distribution, in Proceedings of the Annual ACM Workshop on Computational Learning Theory, 1995.
6. A. Beimel, F. Bergadano, N. H. Bshouty, E. Kushilevitz, and S. Varricchio, On the applications of multiplicity automata in learning, in Proceedings of the 37th Symposium on Foundations of Computer Science, 1996. IEEE Computer Society, pp. 349-358.
7. F. Bergadano, D. Catalano, and S. Varricchio, Learning sat-k-DNF formulas from membership queries, in Proceedings of the 28th Annual ACM Symposium on Theory of Computing, 1996, pp. 126-130.
8. F. Bergadano and S. Varricchio, Learning behaviors of automata from multiplicity and equivalence queries, SIAM J. Comput., 25 (1996), pp. 1268-1280.
9. M. Clausen, A. Dress, J. Grabmeier, and M. Karpinski, On zero-testing and interpolation of k-sparse multivariate polynomials over finite fields, Theoret. Comput. Sci., 84 (1991), pp. 151-164.
10. M.-D. A. Huang and A. J. Rao, Interpolation of sparse multivariate polynomials over large finite fields with applications, in Proceedings of the 7th Annual ACM-SIAM Symposium on Discrete Algorithms, 1996, pp. 508-517.
11. J. Jackson, An efficient membership-query algorithm for learning DNF with respect to the uniform distribution, in Proceeding of the 35th Annual Symposium on Foundations of Computer Science, 1994, IEEE Computer Society.
12. J. Jackson, On Learning DNF and Related Circuit Classes from Helpful and Not-So-Helpful Teachers, Ph.D. thesis, Carnegie Mellon University, Pittsburgh, PA, 1995.
13. R. Khardon, On using the Fourier transform to learn disjoint DNF, Inform. Process. Lett., 49 (1994), pp. 219-222.
14. E. Kushilevitz and Y. Mansour, Learning decision trees using the Fourier spectrum, SIAM J. Comput., 22 (1993), pp. 1331-1348.
15. H. Ohnishi, H. Seki, and T. Kasami, A polynomial time learning algorithm for recognizable series, IEIICE Transactions on Information and Systems, E77-D(10)(5) (1994), pp. 1077-1085.
16. R. M. Roth and G. M. Benedek, Interpolation and approximation of sparse multivariate polynomials over GF(2), SIAM J. Comput., 20 (1991), pp. 291-314.
17. R. E. Schapire and L. M. Sellie, Learning sparse multivariate polynomial over a field with queries and counterexamples, in Proceedings of the Sixth Annual ACM Workshop on Computational Learning Theory, 1993.
18. L. Valiant, A theory of the learnable, Commun. ACM, 27 (1984), pp. 1134-1142.
19. R. Zippel, Interpolating polynomials from their values, J. Symbolic Comput., 9 (1990), pp. 375-403.