Softmax Q-Distribution Estimation for Structured Prediction: A Theoretical Interpretation for RAML
Not on the map. Why?
Abstract (arXiv)
Reward augmented maximum likelihood (RAML), a simple and effective learning framework to directly optimize towards the reward function in structured prediction tasks, has led to a number of impressive empirical successes. RAML incorporates task-specific reward by performing maximum-likelihood updates on candidate outputs sampled according to an exponentiated payoff distribution, which gives higher probabilities to candidates that are close to the reference output. While RAML is notable for its simplicity, efficiency, and its impressive empirical successes, the theoretical properties of RAML, especially the behavior of the exponentiated payoff distribution, has not been examined thoroughly. In this work, we introduce softmax Q-distribution estimation, a novel theoretical interpretation of RAML, which reveals the relation between RAML and Bayesian decision theory. The softmax Q-distribution can be regarded as a smooth approximation of the Bayes decision boundary, and the Bayes decision rule is achieved by decoding with this Q-distribution. We further show that RAML is equivalent to approximately estimating the softmax Q-distribution, with the temperature τ controlling approximation error. We perform two experiments, one on synthetic data of multi-class classification and one on real data of image captioning, to demonstrate the relationship between RAML and the proposed softmax Q-distribution estimation method, verifying our theoretical analysis. Additional experiments on three structured prediction tasks with rewards defined on sequential (named entity recognition), tree-based (dependency parsing) and irregular (machine translation) structures show notable improvements over maximum likelihood baselines.
Key facts. Cited by 4 papers in the map (data through 7 Oct 2026). First posted on arXiv 19 May 2017.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2019: 1; 2020: 0; 2021: 0; 2022: 1; 2023: 0; 2024: 2.
4 papers.
- 2024Adaptive Preference Scaling for Reinforcement Learning with Human Feedbackcited by 20
- 2024To Cool or not to Cool? Temperature Network Meets Large Foundation Models via DROcited by 11
- 2019Transfer Reward Learning for Policy Gradient-Based Text Generationcited by 1
- 2022Fine-tune your Classifier: Finding Correlations With Temperaturecited by 0
- 2024Adaptive Preference Scaling for Reinforcement Learning with Human Feedback4 Jun 2024
- 2024To Cool or not to Cool? Temperature Network Meets Large Foundation Models via DRO6 Apr 2024
- 2022Fine-tune your Classifier: Finding Correlations With Temperature18 Oct 2022
- 2019Transfer Reward Learning for Policy Gradient-Based Text Generation9 Sep 2019