Exponentiated gradient algorithms for large-margin structured classification
Bartlett, Peter L., Collins, Michael J., Taskar, Ben, & McAllester, David A. (2005) Exponentiated gradient algorithms for large-margin structured classification. In Saul , Lawrence K. , Weiss, Yair , & Bottou, Léon (Eds.) Advances in Neural Information Processing Systems 17 : Proceedings of the 2004 Conference, MIT Press, Hyatt Regency, Vancouver, pp. 113-120.
We consider the problem of structured classification, where the task is to predict a label y from an input x, and y 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 , using an exponential-family (Gibbs distribution) representation of structured objects. The algorithm is efficient—even in cases where the number of labels y 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.
Impact and interest:
Citation counts are sourced monthly from and citation databases.
Citations counts from theindexing service can be viewed at the linked Google Scholar™ search.
|Item Type:||Conference Paper|
|Keywords:||Neural Information Processing Systems, Markov random fields|
|Subjects:||Australian and New Zealand Standard Research Classification > INFORMATION AND COMPUTING SCIENCES (080000) > INFORMATION SYSTEMS (080600)|
|Divisions:||Past > QUT Faculties & Divisions > Faculty of Science and Technology
Past > Schools > Mathematical Sciences
|Copyright Owner:||Copyright 2005 MIT Press|
|Deposited On:||17 Aug 2011 22:13|
|Last Modified:||17 Aug 2011 22:14|
Repository Staff Only: item control page