| | |
Summary: Dual Decomposition with Many Overlapping Components
Andr´e F. T. Martins
Noah A. Smith
Pedro M. Q. Aguiar
M´ario A. T. Figueiredo
School of Computer Science, Carnegie Mellon University, Pittsburgh, PA 15213, USA
Instituto de Sistemas e Rob´otica, Instituto Superior T´ecnico, Lisboa, Portugal
Instituto de Telecomunicac¸~oes, Instituto Superior T´ecnico, Lisboa, Portugal
{afm,nasmith}@cs.cmu.edu, aguiar@isr.ist.utl.pt, mtf@lx.it.pt
Abstract
Dual decomposition has been recently pro-
posed as a way of combining complemen-
tary models, with a boost in predictive power.
However, in cases where lightweight decom-
positions are not readily available (e.g., due to
the presence of rich features or logical con-
straints), the original subgradient algorithm
|
