(2011), our aim is to minimize expected loss on the true data distribution over sentence/parse pairs (X, Y ): Since the true data distribution is unknown, we substitute the expected loss over the training sample, and regularize our objective in order to reduce sampling variance.
we aim to minimize the regularized empirical risk, given by (8) with J(θ; How slow is exact inference for dependency parsing?