Exponentiated gradient algorithms for log-linear structured prediction

ACM International Conference Proceeding Series

Volumn 227, Issue , 2007, Pages 305-312

  Globerson, Amir ^a   Koo, Terry Y ^a   Carreras, Xavier ^a   Collins, Michael ^a  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CONJUGATE GRADIENT METHOD; LINEAR SYSTEMS; MATHEMATICAL MODELS; MAXIMUM LIKELIHOOD ESTIMATION;

EXPONENTIATED GRADIENT (EG) ALGORITHM; SEQUENTIAL ALGORITHMS; STRUCTURED PREDICTION;

LEARNING ALGORITHMS;

EID: 34547969126     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1273496.1273535     Document Type: Conference Paper

References (20)

1. Baker, J. (1979). Trainable grammars for speech recognition. 97th meeting of the Acoustical Society of America.
2. Bartlett, P., Collins, M., Taskar, B., & McAllester, D. (2004). Exponentiated gradient algorithms for large-margin structured classification. NIPS.
3. Beck, A., & Teboulle, M. (2003). Mirror descent and nonlinear projected subgradient methods for convex optimization. Operations Research Letters, 31, 167-175.
4. Buchholz, S., & Marsi, E. (2006). CoNLL-X shared task on multilingual dependency parsing. Proc. of CoNLL-X.
5. Collins, M., Schapire, R., & Singer, Y. (2002). Logistic regression, adaboost and bregman distances. Machine Learning, 48, 253-285.
6. Cover, T., & Thomas, J. (1991). Elements of information theory. Wiley.
7. Jaakkok, T., & Haussier, D. (1999). Probabilistic kernel regression models. Proc. of AISTATS.
8. Keerthi, S., Duan, K., Shevade, S., &, Poo, A. N. (2005). A fast dual algorithm for kernel logistic regression. Machine Learning, 61, 151-165.
9. Kivinen, J., & Warmuth, M. (1997). Exponentiated gradient versus gradient descent for linear predictors. Information and Computation, 132, 1-63.
10. Lafferty, J., McCallum, A., & Pereira, F. (2001). Conditonal random fields: Probabilistic models for segmenting and labeling sequence data. Proc. of ICML.
11. Lebanon, G., & Lafferty, J. (2001). Boosting and maximum likelihood for exponential models. NIPS.
12. McDonald, R., Crammer, K., & Pereira, F. (2005). Online large-margin training of dependency parsers. Proc. of the 43rd Annual Meeting of the ACL.
13. Memisevic, R. (2006). Dual optimization of conditional probability models (Technical Report). Univ. of Toronto.
14. Minka, T. (2003). A comparison of numerical optimizers for logistic regression (Technical Report). CMU.
15. Piatt, J. (1998). Fast training of support vector machines using sequential minimal optimization. In Advances in kernel methods - support vector learning. MIT Press.
16. Sha, F., & Pereira, F. (2003). Shallow parsing with conditional random fields. Proc. of HLT-NAACL.
17. Shalev-Shwartz, S., &: Singer, Y. (2006). Convex repeated games and fenchel duality. NIPS.
18. Taskar, B., Guestrin, C., & Koller, D. (2003). Max margin markov networks. NIPS.
19. Vishwanathan, S. N., Schraudolph, N. N., Schmidt, M. W., & Murphy, K. P. (2006). Accelerated training of conditional random fields with stochastic gradient methods. Proc. of ICML.
20. Zhu, J., & Hastie, T. (2001). Kernel logistic regression and the import vector machine. NIPS.