Toward attribute efficient learning of decision lists and parities

Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science)

Volumn 3120, Issue , 2004, Pages 224-238

  Klivans, Adam R ^a   Servedio, Rocco A ^b  

^a HARVARD UNIVERSITY   (United States)

^b Columbia University ^*  (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; BOOLEAN FUNCTIONS; COMPUTATIONAL COMPLEXITY; DECISION THEORY; ELECTRIC MACHINE THEORY; POLYNOMIALS; POLYNOMIAL APPROXIMATION;

MACHINE LEARNING THEORY; PARITIES; PARITY FUNCTIONS; THRESHOLD FUNCTIONS; EFFICIENT LEARNING; NEW CONSTRUCTIONS; OPTIMAL TRADEOFFS; POLYNOMIAL THRESHOLD FUNCTIONS; POLYNOMIAL-TIME ALGORITHMS; SAMPLE COMPLEXITY; SIMPLE ALGORITHM;

LEARNING SYSTEMS; LEARNING ALGORITHMS;

EID: 9444280952     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/978-3-540-27819-1_16     Document Type: Conference Paper

References (33)

1. D. Angluin. Queries and concept learning. Machine Learning, 2:319-342, 1988.
2. J. Barzdin and R. Preivald. On the prediction of general recursive functions. Soviet Mathematics Doklady, 13:1224-1228, 1972.
3. R. Beigel. When do extra majority gates help? polylog(n) majority gates are equivalent to one. Computational Complexity, 4:314-324, 1994.
4. A. Blum. Learning boolean functions in an infinite attribute space. In Proceedings of the Twenty-Second Annual Symposium on Theory of Computing, pages 64-72, 1990.
5. A. Blum. On-line algorithms in machine learning, available at http://www.cs.emu.edu/~avrim/Papers/pubs.html, 1996.
6. A. Blum. Empirical support for winnow and weighted-majority algorithms: results on a calendar scheduling domain. Machine Learning, 26:5-23, 1997.
7. A. Blum, L. Hellerstein, and N. Littlestone. Learning in the presence of finitely or infinitely many irrelevant attributes. Journal of Computer and System Sciences, 50:32-40, 1995.
8. A. Blum and P. Langley. Selection of relevant features and examples in machine learning. Artificial Intelligence, 97(1-2):245-271, 1997.
9. E. Cheney. Introduction to approximation theory. McGraw-Hill, New York, New York, 1966.
10. A. Dhagat and L. Hellerstein. Pac learning with irrelevant attributes. In Proceedings of the Thirty-Fifth Annual Symposium on Foundations of Computer Science, pages 64-74, 1994.
11. A. Ehrenfeucht and D. Haussler. Learning decision trees from random examples. Information and Computation, 82(3):231-246, 1989.
12. A.R. Golding and D. Roth. A winnow-based approach to spelling correction. Machine Learning, 34:107-130, 1999.
13. M. Goldmann, J. Hastad, and A. Razborov. Majority gates vs. general weighted threshold gates. Computational Complexity, 2:277-300, 1992.
14. D. Haussler. Space efficient learning algorithms. Technical Report UCSC-CRL-88-2, University of California at Santa Cruz, 1988.
15. D. Helmbold, R. Sloan, and M. Warmuth. Learning integer lattices. SIAM Journal on Computing, 21(2):240-266., 1992.
16. J. Kivinen, M. Warmuth, and P. Auer. The perceptron algorithm vs. winnow: linear vs. logarithmic mistake bounds when few input variables are relevant. Artificial Intelligence, 97(1-2):325-343, 1997.
17. A. Klivans, R. O'Donnell, and R. Servedio. Learning intersections and thresholds of halfspaces. In Proceedings of the 43rd Annual Symposium on Foundations of Computer Science, 2002.
18. A. Klivans and R. Servedio. Learning dnf in time 2õ(n1/3)In Proceedings of the Thirty-Third Annual Symposium on Theory of Computing, pages 258-265, 2001.
19. M. Krause and P. Pudlak. Computing boolean functions by polynomials and threshold circuits. Computational Complexity, 7(4):346-370, 1998.
20. Matthias Krause. On the computational power of boolean decision lists. Lecture Notes in Computer Science (STACS 2002), 2285, 2002.
21. N. Littlestone. Learning quickly when irrelevant attributes abound: a new linear-threshold algorithm. Machine Learning, 2:285-318, 1988.
22. N. Littlestone. Prom online to batch learning. In Proceedings of the Second Annual Workshop on Computational Learning Theory, pages 269-284, 1989.
23. N. Littlestone. Mistake bounds and logarithmic linear-threshold learning algorithms. PhD thesis, University of California at Santa Cruz, 1989.
24. T. Mitchell. Generalization as search. Artificial Intelligence, 18:203-226, 1982.
25. J. Myhill and W. Kautz. On the size of weights required for linear-input switching functions. IRE Trans. on Electronic Computers, EC10(2):288-290, 1961.
26. Z. Nevo and R. El-Yaniv. On online learning of decision lists. Journal of Machine Learning Research, 3:271-301, 2002.
27. R. O'Donnell and R. Servedio. New degree bounds for polynomial threshold functions. Proceedings of the 35th ACM Symposium on Theory of Computing, 2003.
28. R. Rivest. Learning decision lists. Machine Learning, 2(3):229-246, 1987.
29. R. Servedio. Computational sample complexity and attribute-efficient learning. Journal of Computer and System Sciences, 60(1): 161-178, 2000.
30. R. Servedio. Perceptron, Winnow and PAC learning. SIAM Journal on Computing, 31(5):1358-1369, 2002.
31. D. Spielman. Personal communication, 2003.
32. R. Uehara, K. Tsuchida, and I. Wegener. Optimal attribute-efficient learning of disjunction, parity, and threshold functions. In Proceedings of the Third European Conference on Computational Learning Theory, pages 171-184, 1997.
33. L. Valiant. Projection learning. Machine Learning, 37(2):115-130, 1999.