Learning functions of k terms

Proceedings of the 3rd Annual Workshop on Computational Learning Theory, COLT 1990

Volumn , Issue , 1990, Pages 144-153

  Blum, Avrim ^a   Singh, Mona ^a  

^a NONE

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0039248149     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1016/b978-1-55860-146-8.50014-x     Document Type: Conference Paper

References (8)

1. Anselm Blumer Andrzej Ehrenfeucht David Haussler K. Manfred Warmuth Occam's razor Information Processing Letters 24 April 1987 377 380
2. Paul Fischer and Hans Ulrich Simon. On learning ring-sum expansions. In these proceedings.
3. 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.
4. Nick Littlestone Learning when irrelevant attributes abound: A new linear-threshold algorithm Machine Learning 2 1988 285 318
5. Leonard Pitt G. Leslie Valiant Computational limitations on learning from examples July 1986 Harvard University Aiken Computation Laboratory Technical report
6. Leonard Pitt G. Leslie Valiant Computational limitations on learning from examples Journal of the ACM 35 4 1988 965 984
7. Leonard Pitt and Manfred K. Warmuth. Reductions among prediction problems: On the difficulty of predicting automata (extended abstract). In 3rd IEEE Conference on Structure in Complexity Theory , pages 60–69, Washington, DC, June 1988.
8. L. Ronald Rivest Learning decision lists Machine Learning 2 3 1987 229 246