Conditional log-linear models are a commonly used method for structured prediction. Efficient learning of parameters in these models is therefore an important problem. This paper describes an exponentiated gradient (EG) algorithm for training such models. EG is applied to the convex dual of the maximum likelihood objective; this results in both sequential and parallel update algorithms, where in the sequential algorithm parameters are updated in an online fashion. We provide a convergence proof for both algorithms. Our analysis also simplifies previous results on EG for max-margin models, and leads to a tighter bound on convergence rates. Experiments on a large-scale parsing task show that the proposed algorithm converges much faster than conjugate-gradient and L-BFGS approaches both in terms of optimization objective and test error.
|Number of pages||8|
|State||Published - 2007|
|Event||24th International Conference on Machine Learning, ICML 2007 - Corvalis, OR, United States|
Duration: 20 Jun 2007 → 24 Jun 2007
|Conference||24th International Conference on Machine Learning, ICML 2007|
|Period||20/06/07 → 24/06/07|