Reflective Decoding: Beyond Unidirectional Generation with Off-the-Shelf Language Models
Not on the map. Why?
Abstract (arXiv)
Publicly available, large pretrained LanguageModels (LMs) generate text with remarkable quality, but only sequentially from left to right. As a result, they are not immediately applicable to generation tasks that break the unidirectional assumption, such as paraphrasing or text-infilling, necessitating task-specific supervision. In this paper, we present Reflective Decoding, a novel unsupervised algorithm that allows for direct application of unidirectional LMs to non-sequential tasks. Our 2-step approach requires no supervision or even parallel corpora, only two off-the-shelf pretrained LMs in opposite directions: forward and backward. First, in the contextualization step, we use LMs to generate ensembles of past and future contexts which collectively capture the input (e.g. the source sentence for paraphrasing). Second, in the reflection step, we condition on these "context ensembles", generating outputs that are compatible with them. Comprehensive empirical results demonstrate that Reflective Decoding outperforms strong unsupervised baselines on both paraphrasing and abductive text infilling, significantly narrowing the gap between unsupervised and supervised methods. Reflective Decoding surpasses multiple supervised baselines on various metrics including human evaluation.
Key facts. Cited by 9 papers in the map (data through 14 Oct 2026). First posted on arXiv 16 Oct 2020.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 1; 2022: 6; 2023: 1; 2024: 1.
9 papers.
- 2022InCoder: A Generative Model for Code Infilling and Synthesiscited by 498
- 2022Deduplicating Training Data Mitigates Privacy Risks in Language Modelscited by 314
- 2022COLD Decoding: Energy-based Constrained Text Generation with Langevin Dynamicscited by 161
- 2021NeuroLogic A*esque Decoding: Constrained Text Generation with Lookahead Heuristicscited by 154
- 2022Novelty Controlled Paraphrase Generation with Retrieval Augmented Conditional Prompt Tuningcited by 25
- 2022Knowledge Infused Decodingcited by 12
- 2022Twist Decoding: Diverse Generators Guide Each Othercited by 4
- 2024Learning to Adapt to Low-Resource Paraphrase Generationcited by 2
- 2023CoRE-CoG: Conversational Recommendation of Entities using Constrained Generationcited by 0
- 2024Learning to Adapt to Low-Resource Paraphrase Generation22 Dec 2024
- 2023CoRE-CoG: Conversational Recommendation of Entities using Constrained Generation14 Nov 2023
- 2022Twist Decoding: Diverse Generators Guide Each Other19 May 2022
- 2022InCoder: A Generative Model for Code Infilling and Synthesis12 Apr 2022
- 2022Knowledge Infused Decoding6 Apr 2022
- 2022COLD Decoding: Energy-based Constrained Text Generation with Langevin Dynamics23 Feb 2022
- 2022Deduplicating Training Data Mitigates Privacy Risks in Language Models14 Feb 2022
- 2022Novelty Controlled Paraphrase Generation with Retrieval Augmented Conditional Prompt Tuning1 Feb 2022
- 2021NeuroLogic A*esque Decoding: Constrained Text Generation with Lookahead Heuristics16 Dec 2021