Agnostically learning decision trees

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2008, Pages 527-536

  Gopalan, Parikshit ^a   Kalai, Adam Tauman ^b   Klivans, Adam R ^c  

^a UNIVERSITY OF WASHINGTON   (United States)

^b GEORGIA INSTITUTE OF TECHNOLOGY   (United States)

^c UNIVERSITY OF TEXAS AT AUSTIN   (United States)

Author keywords

Agnostic boosting; Agnostic learning; Decision trees

Indexed keywords

BINARY TREES; COMPUTATION THEORY; CONVEX OPTIMIZATION; DECISION TREES; LEARNING SYSTEMS; POLYNOMIAL APPROXIMATION; TREES (MATHEMATICS);

AGNOSTIC BOOSTING; AGNOSTIC LEARNING; APPROXIMATE GRADIENT; BINARY FUNCTIONS; CONVEX OPTIMIZATION PROBLEMS; N-DIMENSIONAL HYPERCUBE; POLYNOMIAL-TIME ALGORITHMS; UNIFORM DISTRIBUTION;

LEARNING ALGORITHMS;

EID: 57049167124     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1374376.1374451     Document Type: Conference Paper

References (20)

1. A. BEIMEL, F. BERGADANO, N. H. BSHOUTY, E. KUSHILEVITZ, AND S. VARRICCHIO, Learning functions represented as multiplicity automata, J. ACM, 47 (2000), pp. 506-530.
2. L. BREIMAN, J. FRIEDMAN, R. OLSHEN, AND C. STONE, Classification of Regression Trees, Wadsworth, 1984.
3. N. H. BSHOUTY, The monotone theory for the PAC-model, Inf. Comput, 186(1) (2003), pp. 20-35.
4. rd Intl. Conf. Machine learning (ICML'06), 2006, pp. 161-168.
5. A. EHRENFEUCHT AND D. HAUSSLER, Learning decision trees from random examples. Information and Computation, 82 (1989), pp. 231-246.
6. th IEEE Symp. on Foundations of Computer Science (FOCS'06), 2006.
7. A. FLAXMAN, A. T. KALAI, AND H. B. MCMAHAN, Online convex optimization in the bandit setting: gradient descent without a gradient, in ACM Symposium on Discrete Algorithms (SODA'05), 2005, pp. 385-394.
8. th Ann. ACM Symp. on Theory of Computing (STOC'02), 2002, pp. 152-161.
9. th ACM Symposium on the Theory of Computing (STOC'07), 2007.
10. st ACM Symp. on the Theory of Computing (STOC'89), 1989, pp. 25-32.
11. J. JACKSON, The Harmonic sieve: a novel application of Fourier analysis to machine learning theory and practice, PhD thesis, Carnegie Mellon University, August 1995.
12. J. C. JACKSON, Uniform-distribution learnability of noisy linear threshold functions with restricted focus of attention, in Proc. Conf. on Learning Theory (COLT'06), 2006, pp. 304-318.
13. th IEEE Symp. on Foundations of Computer Science (FOCS'05), 2005.
14. M. KEARNS, R. SCHAPIRE, AND L. SELLIE, Toward Efficient Agnostic Learning, Machine Learning, 17 (1994), pp. 115-141.
15. E. KUSHILEVITZ AND Y. MANSOUR, Learning decision trees using the Fourier spectrum, SIAM Journal of Computing, 22(6) (1993), pp. 1331-1348.
16. N. LINIAL, Y. MANSOUR, AND N. NISAN, Constant depth circuits. Fourier transform and learnability, Journal of the ACM, 40 (1993), pp. 607-620.
17. J. R. QUINLAN, C4.5: Programs for Machine Learning, Morgan Kaufmann, 1992.
18. J. B. ROSEN, The gradient projection method for nonlinear programming, part i. linear constraints, Journal of the Society for Industrial and Applied Mathematics, 8 (1960), pp. 181-217.
19. L. VALIANT, A theory of the learnable, Communications of the ACM, 27 (1984), pp. 1134-1142.
20. th Intl. Conf. on Machine Learning (ICML'03), 2003, pp. 928-936.