(2011b) showed that the success of the sub-gradient algorithm is strongly tied to the ability of finding a good decomposition, i.e., one involving few overlapping slaves.
for generalized higher order graphical models, a lightweight decomposition is not at hand and many overlapping slaves may be involved.