file.pdf (412.97 kB)

Dual Decomposition with Many Overlapping Components

Download (412.97 kB)
journal contribution
posted on 01.07.2011 by Andre F.T. Martins, Noah A. Smith, Pedro M.Q. Aguiar, Mario A. T. Figueiredo

Dual decomposition has been recently proposed as a way of combining complementary models, with a boost in predictive power. However, in cases where lightweight decompositions are not readily available (e.g., due to the presence of rich features or logical constraints), the original subgradient algorithm is inefficient. We sidestep that difficulty by adopting an augmented Lagrangian method that accelerates model consensus by regularizing towards the averaged votes. We show how first-order logical constraints can be handled efficiently, even though the corresponding subproblems are no longer combinatorial, and report experiments in dependency parsing, with state-of-the-art results.


Publisher Statement

Copyright 2011 ACL