Empirical risk minimization with approximations of probabilistic grammars

Advances in Neural Information Processing Systems 23: 24th Annual Conference on Neural Information Processing Systems 2010, NIPS 2010

Volumn , Issue , 2010, Pages

  Cohen, Shay B ^a   Smith, Noah A ^a  

^a Carnegie Mellon University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPOSITIONAL STRUCTURE; EMPIRICAL RISK MINIMIZATION; PROBABILISTIC GRAMMARS; SAMPLE COMPLEXITY BOUNDS; SEQUENTIAL STRUCTURE; STATISTIC MODELING; STRUCTURAL RISK MINIMIZATION;

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

References (22)

1. N. Abe, J. Takeuchi, and M. Warmuth. Polynomial learnability of probabilistic concepts with respect to the Kullback-Leiber divergence. In ACM Conference on Computational Learning Theory, 1990.
2. N. Abe and M. Warmuth. On the computational complexity of approximating distributions by probabilistic automata. Machine Learning, 2:205-260, 1992.
3. M. Anthony and P. L. Bartlett. Neural Network Learning: Theoretical Foundations. Cambridge University Press, 1999.
4. E. Charniak and M. Johnson. Coarse-to-fine n-best parsing and maxent discriminative reranking. In Proc. of ACL, 2005.
5. S. B. Cohen and N. A. Smith. Viterbi training for PCFGs: Hardness results and competitiveness of uniform initialization. In Proceedings of ACL, 2010.
6. S. B. Cohen and N. A. Smith. Empirical risk minimization for probabilistic grammars: Sample complexity and hardness of learning, in preparation.
7. M. Collins. Head-driven statistical models for natural language processing. Computational Linguistics, 29:589-637, 2003.
8. M. Collins. Parameter estimation for statistical parsing models: theory and practice of distribution-free methods. Text, Speech and Language Technology (new developments in parsing technology), pages 19-55, 2004.
9. S. Dasgupta. The sample complexity of learning fixed-structure Bayesian networks. Machine Learning, 29(2-3):165-180, 1997.
10. J. Eisner. Three new probabilistic models for dependency parsing: An exploration. In Proc. of COLING, 1996.
11. E. M. Gold. Language identification in the limit. Information and Control, 10(5):447-474, 1967.
12. G. Guerra and Y. Aloimonos. Discovering a language for human activity. In AAAI Workshop on Anticipation in Cognitive Systems, 2005.
13. D. Haussler. Decision-theoretic generalizations of the PAC model for neural net and other learning applications. Information and Computation, 100:78-150, 1992.
14. D. Klein and C. D. Manning. Corpus-based induction of syntactic structure: Models of dependency and constituency. In Proc. of ACL, 2004.
15. V. Koltchinskii. Local Rademacher complexities and oracle inequalities in risk minimization. The Annals of Statistics, 34(6):2593-2656, 2006.
16. L. Lin, T. Wu, J. Porway, and Z. Xu. A stochastic graph grammar for compositional object representation and recognition. Pattern Recognition, 8, 2009.
17. S. Petrov and D. Klein. Improved inference for unlexicalized parsing. In Proc. of HLT-NAACL, 2007.
18. D. Pollard. Convergence of Stochastic Processes. New York: Springer-Verlag, 1984.
19. Y. Sakakibara, M. Brown, R. Hughey, S. Mian, K. Sjölander, R. C. Underwood, and D. Haussler. Stochastic context-free grammars for tRNA modeling. Nucleic Acids Research, 22, 1994.
20. A. Tsybakov. Optimal aggregation of classifiers in statistical learning. The Annals of Statistics, 32(1):135-166, 2004.
21. V. N. Vapnik. Statistical Learning Theory. Wiley-Interscience, 1998.
22. D. Weiss and B. Taskar. Structured prediction cascades. In Proceedings of AISTATS, 2010.