A Continuous-Time Markov Chain Framework for Insertion Language Models
About
Insertion Language Models (ILMs) offer several advantages over left-to-right generation and mask-based generation. However, existing formulations of insertion-based generation have largely been ad-hoc. In this paper, we derive a diffusion-style denoising objective for ILMs from first principles by formulating the noising process as a continuous-time Markov chain on the space of variable-length sequences. We show that previous formulations of ILMs can be viewed as special cases of this denoising framework. Through empirical evaluation on a synthetic planning task, we show that the proposed approach retains the benefits of insertion-based generation over left-to-right generation and masked diffusion models. In language modeling, our diffusion-based approach is competitive with left-to-right generation and masked diffusion models, while offering additional flexibility in sampling compared to existing insertion language models.
Related benchmarks
| Task | Dataset | Result | Rank | |
|---|---|---|---|---|
| Text Generation | LM1B (test) | Entropy2.87 | 90 | |
| Planning Task | Star graph task (Starhard) synthetic (test) | Sequence-level Exact Match Accuracy99.3 | 5 | |
| Planning Task | Star graph task Starmedium synthetic (test) | Exact Match Accuracy (Sequence-level)100 | 5 | |
| Planning Task | Star graph Stareasy synthetic (test) | Sequence-level Exact Match Accuracy100 | 5 | |
| Unconditional Generation | OpenWebText padded (test) | NLL3.74 | 4 |