Learning sub-classes of monotone DNF on the uniform distribution

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1501, Issue , 1998, Pages 385-399

  Verbeurgt, Karsten A ^a  

^a UNIVERSITY OF WATERLOO   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

FOURIER ANALYSIS;

APPROXIMATION THEOREM; COMMON FACTORS; DNF FORMULAS; FOURIER COEFFICIENTS; SUB CLASS; UNIFORM DISTRIBUTION;

LEARNING ALGORITHMS;

EID: 84961312329     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-49730-7_27     Document Type: Conference Paper

References (20)

1. Aizenstein, H., Pitt, L.: On the Learnability of Disjunctive Normal Form Formulas. Machine Learning 19 (1995) 183-208
2. Angluin, D., Valiant, L.: Fast Probabilistic Algorithms for Hamiltonian Circuits and Matchings. Journal of Computer and Systems Sciences 18 (1979) 155-193
3. Angluin, D., Hellerstein, L., Karpinski, M.: Learning Read-Once Formulas with Queries. Journal of the ACM 40 (1993) 185-210
4. Chernoff, H.: A measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the Sum of Observations. Annals of Mathematical Statistics 23 (1952) 493-509
5. Goldman, S., Kearns, M., Schapire, R.: Exact Identification of Circuits Using Fixed Points of Amplification Functions. Proceedings of the 31st Annual Symposium on Foundations of Computer Science (1990) 193-202
6. Hancock, T.R.: The Complexity of Learning Formulas and Decision Trees that have Restricted Reads. PhD Thesis, Department of Computer Science, Harvard University, Technical Report TR-15-92 (1992)
7. Haussler, D., Kearns, M., Littlestone, N., Warmuth, M.K.: Equivalence of Models for Polynomial Learnability. Proceedings of the 1988 Workshop on Computational Learning Theory (1988)
8. Jackson, J.: An Efficient Membership-Query Algorithm for Learning DNF with Respect to the Uniform Distribution. Proceedings of the 35th Annual Symposium on Foundations of Computer Science (1994) 42-53
9. Kearns, M., Li, M., Pitt, L., Valiant, L.: On the Learnability of Boolean Formulae. Proceedings of the 19th Annual ACM Symposium on the Theory of Computing (1987) 285-295
10. Kearns, M., Li, M., Valiant, L.: Learning Boolean Formulas. Journal of the ACM 41-6 (1994) 1298-1328
11. Kearns, M., Valiant, L.G.: Learning Boolean Formulae or Finite Automata is As Hard as Factoring. Tech Report TR-14-88, Aiken Computer Laboratory, Harvard University (1988)
12. Khardon, R.: On using the Fourier transform to learn Disjoint DNF. Information Processing Letters, 49 (1994) 219-222
13. Linial, N., Mansour, Y., Nisan, N.: Constant Depth Circuits, Fourier Transform, and Learnability. Proceedings of the 30th Annual IEEE Symposium on Foundations of Computer Science (1989) 574-579
14. Lund, C., Yannakakis, Y.: On the Hardness of Approximating Minimization Problems. Proceedings of the 25th Annual ACM Symposium on the Theory of Computing (1993) 286-293
15. log log n) Learning Algorithm for DNF under the Uniform Distribution. Proceedings of the 5th Annual Workshop on Computational Learning Theory (1992) 53-61
16. Pitt, L., Valiant, L.: Computational Limits on Learning from Examples. Tech. Rep. TR-05-86, Aiken Computer Laboratory, Harvard University (1986)
17. Schapire, R.: The Design and Analysis of Efficient Learning Algorithms. Doctoral Dissertation, MIT, The MIT Press (1992)
18. Valiant, L.: A Theory of the Learnable. Communications of the ACM 27-11 (1984) 1134-1142
19. Verbeurgt, K.: On the Learnability of DNF Formulae. Master's Thesis, University of Toronto (1990)
20. Verbeurgt, K.: Learning DNF Under the Uniform Distribution in Quasi-polynomial Time. Proceedings of the 3rd Annual Workshop on Computational Learning Theory (1990) 314-326