mlsanityData to 7 Oct 2026

Concentrate Attention: Towards Domain-Generalizable Prompt Optimization for Language Models

arXiv 2406.10584 ↗First posted 15 Jun 2024cs.CLcited by 7

Not on the map. Why?

Abstract (arXiv)

Recent advances in prompt optimization have notably enhanced the performance of pre-trained language models (PLMs) on downstream tasks. However, the potential of optimized prompts on domain generalization has been under-explored. To explore the nature of prompt generalization on unknown domains, we conduct pilot experiments and find that (i) Prompts gaining more attention weight from PLMs' deep layers are more generalizable and (ii) Prompts with more stable attention distributions in PLMs' deep layers are more generalizable. Thus, we offer a fresh objective towards domain-generalizable prompts optimization named "Concentration", which represents the "lookback" attention from the current decoding token to the prompt tokens, to increase the attention strength on prompts and reduce the fluctuation of attention distribution. We adapt this new objective to popular soft prompt and hard prompt optimization methods, respectively. Extensive experiments demonstrate that our idea improves comparison prompt optimization methods by 1.42% for soft prompt generalization and 2.16% for hard prompt generalization in accuracy on the multi-source domain generalization setting, while maintaining satisfying in-domain performance. The promising results validate the effectiveness of our proposed prompt optimization objective and provide key insights into domain-generalizable prompts.

Key facts. Cited by 7 papers in the map (data through 7 Oct 2026). Builds on 48 of its 59 references that are in the map. First posted on arXiv 15 Jun 2024.

Builds on

48 of 59 references.

References · 48

  1. 2018BERT: Pre-training of Deep Bidirectional Transformers for Language Understandingcited by 40,204
  2. 2020Language Models are Few-Shot Learnerscited by 32,199
  3. 2023GPT-4 Technical Reportcited by 18,132
  4. 2023LLaMA: Open and Efficient Foundation Language Modelscited by 13,958
  5. 2019RoBERTa: A Robustly Optimized BERT Pretraining Approachcited by 13,266
  6. 2023Judging LLM-as-a-Judge with MT-Bench and Chatbot Arenacited by 8,393
  7. 2018GLUE: A Multi-Task Benchmark and Analysis Platform for Natural Language Understandingcited by 4,854
  8. 2021Prefix-Tuning: Optimizing Continuous Prompts for Generationcited by 3,878
  9. 2021The Power of Scale for Parameter-Efficient Prompt Tuningcited by 3,769
  10. 2021Pre-train, Prompt, and Predict: A Systematic Survey of Prompting Methods in Natural Language Processingcited by 2,222
  11. 2020Making Pre-trained Language Models Better Few-shot Learnerscited by 1,255
  12. 2021Fantastically Ordered Prompts and Where to Find Them: Overcoming Few-Shot Prompt Order Sensitivitycited by 1,122
36 more
  1. 2019What Does BERT Look At? An Analysis of BERT's Attentioncited by 994
  2. 2019How Can We Know What Language Models Know?cited by 953
  3. 2020Exploiting Cloze Questions for Few Shot Text Classification and Natural Language Inferencecited by 934
  4. 2021The Surprising Effectiveness of PPO in Cooperative, Multi-Agent Gamescited by 903
  5. 2021BARTScore: Evaluating Generated Text as Text Generationcited by 719
  6. 2021GPT Understands, Toocited by 715
  7. 2021P-Tuning v2: Prompt Tuning Can Be Comparable to Fine-tuning Universally Across Scales and Taskscited by 686
  8. 2020It's Not Just Size That Matters: Small Language Models Are Also Few-Shot Learnerscited by 668
  9. 2022RLPrompt: Optimizing Discrete Text Prompts with Reinforcement Learningcited by 361
  10. 2022Dynamic Prompt Learning via Policy Gradient for Semi-structured Mathematical Reasoningcited by 347
  11. 2021True Few-Shot Learning with Language Modelscited by 343
  12. 2019A Multiscale Visualization of Attention in the Transformer Modelcited by 292
  13. 2022PromptSource: An Integrated Development Environment and Repository for Natural Language Promptscited by 288
  14. 2019Challenges of Real-World Reinforcement Learningcited by 282
  15. 2021SPoT: Better Frozen Model Adaptation through Soft Prompt Transfercited by 235
  16. 2023Label Words are Anchors: An Information Flow Perspective for Understanding In-Context Learningcited by 235
  17. 2021PPT: Pre-trained Prompt Tuning for Few-shot Learningcited by 232
  18. 2023Cross-Entropy Loss Functions: Theoretical Analysis and Applicationscited by 206
  19. 2019Commonsense Knowledge Mining from Pretrained Modelscited by 189
  20. 2022Domain Adaptation via Prompt Learningcited by 128
  21. 2022GrIPS: Gradient-free, Edit-based Instruction Search for Prompting Large Language Modelscited by 127
  22. 2019Open Sesame: Getting Inside BERT's Linguistic Knowledgecited by 119
  23. 2019Do Attention Heads in BERT Track Syntactic Dependencies?cited by 87
  24. 2021BERTese: Learning to Speak to BERTcited by 82
  25. 2022Controllable Natural Language Generation with Contrastive Prefixescited by 75
  26. 2022TEMPERA: Test-Time Prompting via Reinforcement Learningcited by 50
  27. 2023Prompt-based Distribution Alignment for Unsupervised Domain Adaptationcited by 44
  28. 2023TRAM: Benchmarking Temporal Reasoning for Large Language Modelscited by 39
  29. 2023Query-Dependent Prompt Evaluation and Optimization with Offline Inverse RLcited by 37
  30. 2022Input-Tuning: Adapting Unfamiliar Inputs to Frozen Pretrained Modelscited by 34
  31. 2022Multi-Prompt Alignment for Multi-Source Unsupervised Domain Adaptationcited by 25
  32. 2022Making Pre-trained Language Models End-to-end Few-shot Learners with Contrastive Prompt Tuningcited by 19
  33. 2022Improving the Sample Efficiency of Prompt Tuning with Domain Adaptationcited by 15
  34. 2023Dialogue for Prompting: a Policy-Gradient-Based Discrete Prompt Generation for Few-shot Learningcited by 7
  35. 2022Paying More Attention to Self-attention: Improving Pre-trained Language Models via Attention Guidingcited by 6
  36. 2024StablePT: Towards Stable Prompting for Few-shot Learning via Input Separationcited by 3

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2025: 6; 2026: 1.

7 papers.