The idea behind cutting planes is to instantiate only a minimal subset of the exponentially many constraints.
for the i-th training example, we decode the shortest pathp given our current model and consider two cases: (i) Forp = p i the prediction is erroneous andp is called the most strongly violated constraint as it realises the smallest function value and f (G i ,p) < f (G i , p) holds for all p =p.