The closer the initial state is to an optimum, the less work remains to be done for the algorithm.
the framework makes it possible to exploit decomposability for efficient scoring without imposing any particular decomposition on the features as beam search does.