To cope with the sparse data problem, we smooth the parameters according to their underlying word similarities by introducing a Laplacian regularizer.
the exact constraint contains a disjunction of two different constraints, which creates a non-convex constraint in w .