Improving Autoregressive Training with Dynamic Oracles
Jianing Yang, Harshine Visvanathan, Yilin Wang, Xinyi Hu, Matthew Gormley
TL;DR
The paper addresses exposure bias and metric misalignment in autoregressive sequence training by integrating DAgger with metric-specific dynamic oracles. It develops exact dynamic oracles for decomposable metrics like partial and exact F1, and approximate dynamic oracles for non-decomposable metrics such as ROUGE and BLEU using beam search, preserving no-regret guarantees for decomposable cases. Empirically, DAgger with these dynamic oracles improves partial F1 on NER and ROUGE on summarization, while MT (BLEU) results are mixed, sometimes not exceeding strong baselines. The work provides a practical, metric-aware training paradigm that can be extended to other metrics and model families, with runtime considerations and future directions for stochastic oracles and broader metric support.
Abstract
Many tasks within NLP can be framed as sequential decision problems, ranging from sequence tagging to text generation. However, for many tasks, the standard training methods, including maximum likelihood (teacher forcing) and scheduled sampling, suffer from exposure bias and a mismatch between metrics employed during training and inference. DAgger provides a solution to mitigate these problems, yet it requires a metric-specific dynamic oracle algorithm, which does not exist for many common metrics like span-based F1, ROUGE, and BLEU. In this paper, we develop these novel dynamic oracles and show they maintain DAgger's no-regret guarantee for decomposable metrics like span-based F1. We evaluate the algorithm's performance on named entity recognition (NER), text summarization, and machine translation (MT). While DAgger with dynamic oracle yields less favorable results in our MT experiments, it outperforms the baseline techniques in NER and text summarization.
