Exponentiated Gradient Algorithms for Large-margin Structured Classification
Peter L. Bartlett, Michael Collins, Ben Taskar, David McAllester · QUT ePrints (Queensland University of Technology) · 2004
We consider the problem of structured classification, where the task is to predict a label from an input, and has meaningful internal structure. Our framework includes supervised training of Markov random fields and weighted context-free grammars as special cases. We describe an algorithm that solves the large-margin optimization problem defined in [12], using an exponential-family (Gibbs distribution) representation of structured objects. The algorithm is efficient—even in cases where the number of labels is exponential in size—provided that certain expectations under Gibbs distributions can be calculated efficiently. The method for structured labels relies on a more general result, specifically the application of exponentiated gradient updates [7, 8] to quadratic programs. 1