Vector-Quantized Prompt Learning for Paraphrase Generation
Not on the map. Why?
Abstract (arXiv)
Deep generative modeling of natural languages has achieved many successes, such as producing fluent sentences and translating from one language into another. However, the development of generative modeling techniques for paraphrase generation still lags behind largely due to the challenges in addressing the complex conflicts between expression diversity and semantic preservation. This paper proposes to generate diverse and high-quality paraphrases by exploiting the pre-trained models with instance-dependent prompts. To learn generalizable prompts, we assume that the number of abstract transforming patterns of paraphrase generation (governed by prompts) is finite and usually not large. Therefore, we present vector-quantized prompts as the cues to control the generation of pre-trained models. Extensive experiments demonstrate that the proposed method achieves new state-of-art results on three benchmark datasets, including Quora, Wikianswers, and MSCOCO. We will release all the code upon acceptance.
Key facts. Cited by 2 papers in the map (data through 7 Oct 2026). Builds on 9 of its 37 references that are in the map. First posted on arXiv 25 Nov 2023.
Builds on
9 of 37 references.
References · 9
- 2017Attention Is All You Needcited by 59,932
- 2020Language Models are Few-Shot Learnerscited by 32,199
- 2019Exploring the Limits of Transfer Learning with a Unified Text-to-Text Transformercited by 14,491
- 2022Scaling Instruction-Finetuned Language Modelscited by 2,997
- 2020Neural Syntactic Preordering for Controlled Paraphrase Generationcited by 56
- 2019Natural Language Understanding with the Quora Question Pairs Datasetcited by 51
- 2022Hierarchical Sketch Induction for Paraphrase Generationcited by 21
- 2021ConRPG: Paraphrase Generation using Contexts as Regularizercited by 13
- 2022Vector-Quantized Input-Contextualized Soft Prompts for Natural Language Understandingcited by 7
Built on by
Citing papers per year: 2025: 1; 2026: 1.
2 papers.