Lower bounds on learning random structures with statistical queries

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

Volumn 6331 LNAI, Issue , 2010, Pages 194-208

  Angluin, Dana ^a   Eisenstat, David ^b   Kontorovich, Leonid ^c   Reyzin, Lev ^d  

^a YALE UNIVERSITY   (United States)

^b BROWN UNIVERSITY   (United States)

^c BEN GURION UNIVERSITY OF THE NEGEV   (Israel)

^d YAHOO RESEARCH   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ARBITRARY DISTRIBUTION; DNF FORMULAS; LOWER BOUNDS; POLYNOMIAL NUMBER; RANDOM STRUCTURES; STATISTICAL QUERIES;

DECISION TREES;

EID: 78249285918     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-16108-7_18     Document Type: Conference Paper

References (13)

1. Aslam, J.A., Decatur, S.E.: General bounds on statistical query learning and PAC learning with noise via hypothesis boosting. Information and Computation 141(2), 85-118 (1998)
2. Blum, A., Furst, M., Jackson, J., Kearns, M., Mansour, Y., Rudich, S.: Weakly learning DNF and characterizing statistical query learning using Fourier analysis. In: STOC 1994: Proceedings of the Twenty-Sixth Annual ACM Symposium on Theory of Computing, pp. 253-262. ACM, New York (1994)
3. Freund, Y., Kearns, M.J., Ron, D., Rubinfeld, R., Schapire, R.E., Sellie, L.: Efficient learning of typical finite automata from random walks. Information and Computation 138(1), 23-48 (1997) (Pubitemid 127451777)
4. Mark Gold, E.: Complexity of automaton identification from given data. Information and Control 37(3), 302-320 (1978)
5. Jackson, J., Lee, H., Servedio, R., Wan, A.: Learning random monotone DNF. In: Goel, A., Jansen, K., Rolim, J.D.P., Rubinfeld, R. (eds.) APPROX and RANDOM 2008. LNCS, vol. 5171, pp. 483-497. Springer, Heidelberg (2008)
6. Jackson, J.C., Servedio, R.A.: Learning random log-depth decision trees under the uniform distribution. SIAM J. Comput. 34(5), 1107-1128 (2005)
7. Kearns, M., Valiant, L.G.: Crytographic limitations on learning boolean formulae and finite automata. In: STOC 1989: Proceedings of the Twenty-First Annual ACM Symposium on Theory of Computing, pp. 433-444. ACM, New York (1989)
8. Kearns, M.: Efficient noise-tolerant learning from statistical queries. J. ACM 45(6), 983-1006 (1998)
9. Lang, K.J.: Random DFA's can be approximately learned from sparse uniform examples. In: COLT 1992: Proceedings of the Fifth Annual Workshop on Computational Learning Theory, pp. 45-52. ACM, New York (1992)
10. Pitt, L., Warmuth, M.K.: Prediction-preserving reducibility. J. Comput. Syst. Sci. 41(3), 430-467 (1990)
11. Sellie, L.: Learning random monotone DNF under the uniform distribution. In: COLT, pp. 181-192 (2008)
12. Sellie, L.: Exact learning of random DNF over the uniform distribution. In: STOC, pp. 45-54 (2009)
13. Trakhtenbrot, B.A., Barzdin, Y.M.: Finite Automata: Behavior and Synthesis. North Holland, Amsterdam (1973)