# Structured Prediction: From Gaussian Perturbations to Linear-Time Principled Algorithms

arXiv: https://arxiv.org/abs/1508.00945 · HTML: https://mlsanity.com/paper/1508.00945/

## Key facts

- Cited by 1 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 5 Aug 2015.

## Built on by (most cited first, 1 of 1)

- [Randomized Deep Structured Prediction for Discourse-Level Processing](https://mlsanity.com/paper/2101.10435/) (2021)

## Abstract (arXiv)

Margin-based structured prediction commonly uses a maximum loss over all possible structured outputs citeAltun03,Collins04b,Taskar03. In natural language processing, recent work citeZhang14,Zhang15 has proposed the use of the maximum loss over random structured outputs sampled independently from some proposal distribution. This method is linear-time in the number of random structured outputs and trivially parallelizable. We study this family of loss functions in the PAC-Bayes framework under Gaussian perturbations citeMcAllester07. Under some technical conditions and up to statistical accuracy, we show that this family of loss functions produces a tighter upper bound of the Gibbs decoder distortion than commonly used methods. Thus, using the maximum loss over random structured outputs is a principled way of learning the parameter of structured prediction models. Besides explaining the experimental success of citeZhang14,Zhang15, our theoretical results show that more general techniques are possible.