mlsanityData to 7 Oct 2026

Learning Randomly Perturbed Structured Predictors for Direct Loss Minimization

arXiv 2007.05724 ↗First posted 11 Jul 2020stat.ML cs.LGcited by 6

Not on the map. Why?

Abstract (arXiv)

Direct loss minimization is a popular approach for learning predictors over structured label spaces. This approach is computationally appealing as it replaces integration with optimization and allows to propagate gradients in a deep net using loss-perturbed prediction. Recently, this technique was extended to generative models, while introducing a randomized predictor that samples a structure from a randomly perturbed score function. In this work, we learn the variance of these randomized structured predictors and show that it balances better between the learned score function and the randomized noise in structured prediction. We demonstrate empirically the effectiveness of learning the balance between the signal and the random noise in structured discrete spaces.

Key facts. Cited by 6 papers in the map (data through 7 Oct 2026). First posted on arXiv 11 Jul 2020.

Builds on

No reference list yet.

Built on by

Cited by year

Citing papers per year: 2021: 1; 2022: 0; 2023: 1; 2024: 3; 2025: 1.

6 papers.