PAC learning with irrelevant attributes

Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS

Volumn , Issue , 1994, Pages 64-74

  Dhagat, Aditi ^a   Hellerstein, Lisa ^b  

^a UNIVERSITY OF WISCONSIN MILWAUKEE   (United States)

^b NORTHWESTERN UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION ALGORITHMS; LEARNING ALGORITHMS;

DECISION LISTS; DNF FORMULAS; MULTIPLICATIVE FACTORS; NEGATIVE EXAMPLES; PAC LEARNING; POLYNOMIAL-TIME; RANDOM SAMPLE; SAMPLE DATA; SET-COVER; TARGET FUNCTIONS;

POLYNOMIAL APPROXIMATION;

EID: 0001797861     PISSN: 02725428     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/SFCS.1994.365704     Document Type: Conference Paper

References (20)

1. M. Anthony, N. Biggs. Computational Learning Theory. Cambridge University Press, 1992.
2. A. Blum, P. Chalasani and J. Jackson. On learning embedded symmetric concepts. In Proceedings of the Sixth Annual ACM Conference on Computational Learning Theory, 337-346, 1993.
3. A. Blumer, A. Ehrenfeucht, D. Haussler and M. Warmuth. Occam's Razor. Information Processing Letters, 24: 377-380, 1987.
4. M. Bellare, S. Goldwasser, C. Lund and A. Russell. Efficient Probabilistically Checkable Proofs and Applications to Approximation. In Proceedings ofthe 25th Annual ACM Symposium on the Theory of Computing, 1993.
5. A. Blum, L. Hellerstein and N. Littlestone. Learning in the presence of finitely or infinitely many attributes. In Proceedings ofthe Fourth Annual Workshop on Computational Learning Theory, 1991.
6. A. Blum and M. Singh. Learning functions of k terms. In Proceedings of the 1990 Workshop on Computational Learning Theory. Morgan Kaufmann, San Mateo, CA.
7. Y. Freund. Boosting a weak learning algorithm by majority. In Proceedings of the Third Annual Workshop on Computational Learning Theory, 1990.
8. D. Haussler. Quantifying inductive bias: AI learning algorithms and Valiant's learning framework. Artificial Intelligence, 36(2):177-222, 1988.
9. D. S. Johnson. Approximation algorithms for combinatorial problems. Journal of Computer and System Sciences, 9:256-278, 1974.
10. T. Hancock, T. Jiang, M. Li, and J. Tromp. Lower Bounds on Learning Decision Lists and Trees, unpublished manuscript, 1994.
11. R. Karp. Reducibility among combinatorial problems. Complexity of Computer Computations, Plenum Press, New York, 85-103, 1972.
12. M. Kearns. Efficient noise-tolerant learning from statistical queries. In Proceedings of the 25th Annual ACM Symposium on the Theory of Computing, 1993.
13. M. Kearns and U. Vazirani. Introduction to Computational Learning Theory, 41-42, MIT Press, 1994.
14. N. Littlestone. Personal communication.
15. N. Littlestone. Learning quickly when irrelevant attributes abound: a new linear threshold learning algorithm. Machine Learning, 2(4): 245-318.
16. L. Lovasz. On the ratio of optimal integral and fractional covers. Discrete Mathematics, 13:383-390, 1975.
17. C. Lund and M. Yannakakis. On the Hardness of Approximating Minimization Problems. In Proceedings of the 25th Annual ACM Symposium on Theory of Computing, 1993.
18. L. Pitt and L.G. Valiant. Computational limitations from learning from examples. Journal of the ACM, 35(4): 965-984, 1988.
19. R. L. Rivest. Learning decision lists. Machine Learning, 2(3):229-246, 1987.
20. L. G. Valiant. A theory of the learn-able. Communications of the ACM, 27(11):1134-1142, 1984.