Learning DNF under the uniform distribution in quasi-polynomial time

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

Volumn , Issue , 1990, Pages 314-326

  Verbeurgt, Karsten ^a  

^a NONE

Author keywords

[No Author keywords available]

Indexed keywords

EID: 49049103976     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1016/b978-1-55860-146-8.50027-8     Document Type: Conference Paper

References (18)

1. Blumer A., A. Ehrenfeucht, D. Haussler, M. Warmuth, “Learnability and the Vapnik Chervonenkis Dimension”, Tech Rep. UCSC-CRL-87- 20, 1987.
2. H. Chernoff “A measure of asymptotic efficiency for tests of a hypothesis based on the sum of observations” Annals of Mathematical Statistics 23 1952 493 509
3. D. Haussler “Quantifying Inductive Bias: AI Learning Algorithms and Valiant's Learning Framework” Artificial Intelligence 36 No. 2 Sept 1988
4. Haussler D., M. Kearns, N. Littlestone, M.K. Warmuth, “Equivalence of Models for Polynomial Learnability”, In Proceedings of the 1988 Workshop on Computational Learning Theory , Morgan Kaufmann, San Mateo, CA, 1988.
5. th Annual ACM Symposium on the Theory of Computation , Chicago, 1988, pp. 267–279.
6. th Annual ACM Symposium on the Theory of Computation , New York, 1987, pp. 285–295.
7. Kearns M., L. Pitt, “A Polynomial-time Algorithm for Learning k -variable Pattern Languages from Examples”, In Proceedings of the 1989 Workshop on Computational Learning Theory , Morgan Kaufmann, San Mateo, CA, 1989, pp. 57–71.
8. Kearns M., L. G. Valiant, “Learning Boolean Formulae or Finite Automata is As Hard as Factoring”, Tech Report TR- 14–88, Aiken Computer Laboratory , Harvard University, 1988.
9. th Annual IEEE Symposium on Foundations of Computer Science , 1989, pp. 574–579.
10. th Annual Symposium on the Foundations of Computer Science , 1987, pp. 68–77.
11. Littlestone N. “Mistake Bounds and Logarithmic Linear Threshold Learning Algorithms”, Tech. Rep. UCSC-CRL-89–11, UC Santa Cruz , 1989.
12. Pagallo G., “Adaptive Decision Tree Algorithms For Learning From Examples”, PhD Thesis, University of California at Santa Cruz , Santa Cruz, California, June 1990.
13. L. Pitt L. Valiant “Computational Limits on Learning from Examples” 1986 Aiken Computer Laboratory, Harvard University Tech. Rep. TR-05–86
14. th Annual IEEE Symposium on Foundations of Computer Science , 1989, pp. 28–33.
15. L. Valiant “A Theory of the Learnable” Communications of the ACM 27 no. 11 1984 1134 1142
16. th IJCAI , Vol. 1, Los Angeles, CA, Aug. 1985, pp. 560–566.
17. Verbeurgt K., “On the Learnability of DNF Formulae”, Master's Thesis, University of Toronto , Toronto, Ontario, 1990.
18. Warmuth, M., Personal Communciation, September, 1989.