This is equivalent to using a structured discriminative model with rich features on ngrams of candidate compressions.
we limit the maximum iteration number to 50 and return the best primal solution y (i) among all previous iterations for cases that do not converge in reasonable time.