On Conditional and Compositional Language Model Differentiable Prompting
Not on the map. Why?
Abstract (arXiv)
Prompts have been shown to be an effective method to adapt a frozen Pretrained Language Model (PLM) to perform well on downstream tasks. Prompts can be represented by a human-engineered word sequence or by a learned continuous embedding. In this work, we investigate conditional and compositional differentiable prompting. We propose a new model, Prompt Production System (PRopS), which learns to transform task instructions or input metadata, into continuous prompts that elicit task-specific outputs from the PLM. Our model uses a modular network structure based on our neural formulation of Production Systems, which allows the model to learn discrete rules -- neural functions that learn to specialize in transforming particular prompt input patterns, making it suitable for compositional transfer learning and few-shot learning. We present extensive empirical and theoretical analysis and show that PRopS consistently surpasses other PLM adaptation techniques, and often improves upon fully fine-tuned models, on compositional generalization tasks, controllable summarization and multilingual translation, while needing fewer trainable parameters.
Key facts. Cited by 2 papers in the map (data through 7 Oct 2026). Builds on 32 of its 44 references that are in the map. First posted on arXiv 4 Jul 2023.
Builds on
32 of 44 references.
References · 32
- 2017Attention Is All You Needcited by 59,932
- 2019Exploring the Limits of Transfer Learning with a Unified Text-to-Text Transformercited by 14,491
- 2021LoRA: Low-Rank Adaptation of Large Language Modelscited by 14,084
- 2019BART: Denoising Sequence-to-Sequence Pre-training for Natural Language Generation, Translation, and Comprehensioncited by 5,874
- 2018GLUE: A Multi-Task Benchmark and Analysis Platform for Natural Language Understandingcited by 4,854
- 2019Parameter-Efficient Transfer Learning for NLPcited by 4,195
- 2021Prefix-Tuning: Optimizing Continuous Prompts for Generationcited by 3,878
- 2021The Power of Scale for Parameter-Efficient Prompt Tuningcited by 3,769
- 2019Language Models as Knowledge Bases?cited by 1,922
- 2018Don't Give Me the Details, Just the Summary! Topic-Aware Convolutional Neural Networks for Extreme Summarizationcited by 1,308
- 2020Multilingual Denoising Pre-training for Neural Machine Translationcited by 1,028
- 2019How Can We Know What Language Models Know?cited by 953
20 more
- 2020Exploiting Cloze Questions for Few Shot Text Classification and Natural Language Inferencecited by 934
- 2021GPT Understands, Toocited by 715
- 2021Multimodal Few-Shot Learning with Frozen Language Modelscited by 657
- 2020Parameter-Efficient Transfer Learning with Diff Pruningcited by 351
- 2016NewsQA: A Machine Comprehension Datasetcited by 330
- 2019Measuring Compositional Generalization: A Comprehensive Method on Realistic Datacited by 280
- 2017The E2E Dataset: New Challenges For End-to-End Generationcited by 252
- 2019Simple, Scalable Adaptation for Neural Machine Translationcited by 239
- 2021PTR: Prompt Tuning with Rules for Text Classificationcited by 238
- 2019Recurrent Independent Mechanismscited by 219
- 2020Exploring Versatile Generative Language Model Via Parameter-Efficient Transfer Learningcited by 139
- 2016Neural Summarization by Extracting Sentences and Wordscited by 114
- 2020Compositional Generalization in Semantic Parsing: Pre-training vs. Specialized Architecturescited by 95
- 2019On Extractive and Abstractive Neural Document Summarization with Transformer Language Modelscited by 83
- 2020The Turking Test: Can Language Models Understand Instructions?cited by 82
- 2021Neural Production Systems: Learning Rule-Governed Visual Dynamicscited by 75
- 2018Modular Networks: Learning to Decompose Neural Computationcited by 62
- 2021Continual Learning via Local Module Compositioncited by 61
- 2020Conditionally Adaptive Multi-Task Learning: Improving Transfer Learning in NLP Using Fewer Parameters & Less Datacited by 50
- 2022Learning to Transfer Prompts for Text Generationcited by 22
Built on by
Citing papers per year: 2024: 1; 2025: 0; 2026: 1.
2 papers.