Relevant Examples and Relevant Features: Thoughts from Computational Learning Theory

AAAI Fall Symposium - Technical Report

Volumn FS-94-02, Issue , 1994, Pages 14-18

  Blum, Avrim L ^a  

^a CARNEGIE MELLON UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84974698517     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (33)

1. D. Angluin, L. Hellerstein, and M. Karpinski. Learning read-once formulas with queries. Technical Report UCB/CSD 89/528, University of California Berkeley Computer Science Division, 1989.
2. Dana Angluin. Learning regular sets from queries and counterexamples. Information and Computation, 75:87-106, November 1987.
3. A. Blum and R. Kannan. Learning an intersection of k halfspaces over a uniform distribution. In Proceedings of the 34th Annual IEEE Symposium on Foundations of Computer Science, pages 312-320, November 1993.
4. A. Blum, L. Hellerstein, and N. Littlestone. Learning in the presence of finitely or infinitely many irrelevant attributes. In Proceedings of the Fourth Annual Workshop on Computational Learning Theory, pages 157-166, Santa Cruz, California, August 1991. Morgan Kaufmann.
5. A. Blum, M. Furst, M. Kearns, and D. Lipton. Cryptographic primitives based on hard learning problems. In D. Stinson, editor, Proceedings CRYPTO 93. Springer, 1994. Lecture Notes in Computer Science No. 773.
6. Anselm Blumer, Andrzej Ehrenfeucht, David Haussler, and Manfred K. Warmuth. Occam's razor. Information Processing Letters, 24:377-380, April 1987.
7. Anselm Blumer, Andrzej Ehrenfeucht, David Haussler, and Manfred K. Warmuth. Learnability and the Vapnik-Chervonenkis dimension. Journal of the ACM, 36(4):929-965, 1989.
8. Raymond Board and Leonard Pitt. On the necessity of Occam algorithms. Theoretical Computer Science, 100:157-184, 1992.
9. N. H. Bshouty. Exact learning via the monotone theory. In Proceedings of the IEEE Symp. on Foundation of Computer Science, pages 302-311, Palo Alto, CA., 1993.
10. N. Cesa-Bianchi, Y. Freund, D.P. Helmbold, D. Haussler, R.E. Schapire, and M.K. Warmuth. How to use expert advice. In Proceedings of the Annual ACM Symp. on the Theory of Computing, pages 382-391, 1993.
11. A. Dhagat and L. Hellerstein. PAC learning with irrelevant attributes. In Proceedings of the IEEE Symp. on Foundation of Computer Science, 1994. To appear.
12. M. Dyer, A. Frieze, and R. Kannan. A random polynomial time algorithm for approximating the volume of convex bodies. In Proceedings of the Annual ACM Symp. on the Theory of Computing, pages 375-381, 1989.
13. Yoav Freund. Boosting a weak learning algorithm by majority. In Proceedings of the Third Annual Workshop on Computational Learning Theory, pages 202-216. Morgan Kaufmann, 1990.
14. Yoav Freund. An improved boosting algorithm and its implications on learning complexity. In Proceedings of the Fifth Annual ACM Workshop on Computational Learning Theory, pages 391-398. ACM Press, 1992.
15. M. Garey and D. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman, San Francisco, 1979.
16. Thomas Hancock. Learning 2μ DNF formulas and ku decision trees. In Proceedings of the Fourth Annual Workshop on Computational Learning Theory, pages 199-209, Santa Cruz, California, August 1991. Morgan Kaufmann.
17. David Haussler. Quantifying the inductive bias in concept learning. In Proceedings AAAI-86, pages 485-489. American Association for Artificial Intelligence, August 1986.
18. J. Jackson. An efficient membership-query algorithm for learning DNF with respect to the uniform distribution. In Proceedings of the IEEE Symp. on Foundation of Computer Science, 1994. To Appear.
19. D.S. Johnson. Approximation algorithms for combinatorial problems. J. of Computer and System Sciences, 9:256-278, 1974.
20. Michael Kearns, Ming Li, Leonard Pitt, and Leslie Valiant. On the learnability of boolean formulae. In Proceedings of the Nineteenth Annual ACM Symposium on Theory of Computing, pages 285-295, New York, New York, May 1987.
21. Ron Kohavi. Feature subset selection as search with probability estimates. This workshop, 1994.
22. N. Littlestone and M. K. Warmuth. The weighted majority algorithm. Information and Computation, 108(2):212-261, 1994.
23. Nick Littlestone, Philip M. Long, and Manfred K. Warmuth. On-line learning of linear functions. In Proceedings of the Twenty-third Annual ACM Symposium on Theory of Computing, pages 465-475, New Orleans, Louisiana, May 1991. ACM.
24. Nick Littlestone. Learning quickly when irrelevant attributes abound: A new linear-threshold algorithm. Machine Learning, 2:285-318, 1988.
25. L. Lovász and M. Simonovits. On the randomized complexity of volume and diameter. In Proceedings of the IEEE Symp. on Foundation of Computer Science, pages 482-491, 1992.
26. C. Lund and M. Yannakakis. On the hardness of approximating minimization problems. In Proceedings of the Annual ACM Symp. on the Theory of Computing, pages 286-293, 1993.
27. Robert E. Schapire. The strength of weak learnability. Machine Learning, 5(2):197-227, 1990.
28. Alistair Sinclair and Mark Jerrum. Approximate counting, uniform generation and rapidly mixing markov chains. Information and Computation, 82(1):93-133, July 1989.
29. Leslie G. Valiant. A theory of the learnable. Communications of the ACM, 27(11):1134-1142, November 1984.
30. K. Verbeurgt. Learning DNF under the uniform distribution in polynomial time. In Proceedings of the Third Annual Workshop on Computational Learning Theory, pages 314-325. Morgan Kaufmann, 1990.
31. V. Vovk. Aggregating strategies. In Proceedings of the Third Annual Workshop on Computational Learning Theory, pages 371-383. Morgan Kaufmann, 1990.
32. Bernard Widrow and Marcian E. Hoff. Adaptive switching circuits. 1960 IRE WESCON Convention Record, pages 96-104, 1960. Reprinted in Neurocomputing (MIT Press, 1988).
33. Patrick H. Winston. Learning structural descriptions from examples. In Patrick H. Winston, editor, The Psychology of Computer Vision. McGraw-Hill, New York, 1975.