mlsanityData to 7 Oct 2026

kNN-ICL: Compositional Task-Oriented Parsing Generalization with Nearest Neighbor In-Context Learning

arXiv 2312.10771 ↗First posted 17 Dec 2023cs.CLcited by 3

Not on the map. Why?

Abstract (arXiv)

Task-Oriented Parsing (TOP) enables conversational assistants to interpret user commands expressed in natural language, transforming them into structured outputs that combine elements of both natural language and intent/slot tags. Recently, Large Language Models (LLMs) have achieved impressive performance in synthesizing computer programs based on a natural language prompt, mitigating the gap between natural language and structured programs. Our paper focuses on harnessing the capabilities of LLMs for semantic parsing tasks, addressing the following three key research questions: 1) How can LLMs be effectively utilized for semantic parsing tasks? 2) What defines an effective prompt? and 3) How can LLM overcome the length constraint and streamline prompt design by including all examples as prompts? We introduce k Nearest Neighbor In-Context Learning(kNN-ICL), which simplifies prompt engineering by allowing it to be built on top of any design strategy while providing access to all demo examples. Extensive experiments show that: 1)Simple ICL without kNN search can achieve a comparable performance with strong supervised models on the TOP tasks, and 2) kNN-ICL significantly improves the comprehension of complex requests by seamlessly integrating ICL with a nearest-neighbor approach. Notably, this enhancement is achieved without the need for additional data or specialized prompts.

Key facts. Cited by 3 papers in the map (data through 7 Oct 2026). Builds on 47 of its 65 references that are in the map. First posted on arXiv 17 Dec 2023.

Builds on

47 of 65 references.

References · 47

  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. 2019Exploring the Limits of Transfer Learning with a Unified Text-to-Text Transformercited by 14,491
  4. 2019RoBERTa: A Robustly Optimized BERT Pretraining Approachcited by 13,266
  5. 2021Evaluating Large Language Models Trained on Codecited by 8,053
  6. 2022PaLM: Scaling Language Modeling with Pathwayscited by 5,304
  7. 2021Prefix-Tuning: Optimizing Continuous Prompts for Generationcited by 3,878
  8. 2021The Power of Scale for Parameter-Efficient Prompt Tuningcited by 3,769
  9. 2017Billion-scale similarity search with GPUscited by 2,477
  10. 2020REALM: Retrieval-Augmented Language Model Pre-Trainingcited by 2,126
  11. 2023Code Llama: Open Foundation Models for Codecited by 2,105
  12. 2022BLOOM: A 176B-Parameter Open-Access Multilingual Language Modelcited by 1,968
35 more
  1. 2022Competition-Level Code Generation with AlphaCodecited by 1,427
  2. 2022Rethinking the Role of Demonstrations: What Makes In-Context Learning Work?cited by 1,413
  3. 2021Improving language models by retrieving from trillions of tokenscited by 1,278
  4. 2021What Makes Good In-Context Examples for GPT-3?cited by 1,184
  5. 2022When Not to Trust Language Models: Investigating Effectiveness of Parametric and Non-Parametric Memoriescited by 1,103
  6. 2022Program of Thoughts Prompting: Disentangling Computation from Reasoning for Numerical Reasoning Taskscited by 1,057
  7. 2022Large Language Models Are Human-Level Prompt Engineerscited by 1,020
  8. 2022Atlas: Few-shot Learning with Retrieval Augmented Language Modelscited by 940
  9. 2021CodeT5: Identifier-aware Unified Pre-trained Encoder-Decoder Models for Code Understanding and Generationcited by 890
  10. 2022CodeGen: An Open Large Language Model for Code with Multi-Turn Program Synthesiscited by 876
  11. 2021Towards a Unified View of Parameter-Efficient Transfer Learningcited by 863
  12. 2019Generalization through Memorization: Nearest Neighbor Language Modelscited by 788
  13. 2023REPLUG: Retrieval-Augmented Black-Box Language Modelscited by 786
  14. 2018MultiWOZ -- A Large-Scale Multi-Domain Wizard-of-Oz Dataset for Task-Oriented Dialogue Modellingcited by 760
  15. 2022GPT-NeoX-20B: An Open-Source Autoregressive Language Modelcited by 711
  16. 2022InCoder: A Generative Model for Code Infilling and Synthesiscited by 492
  17. 2023CodeT5+: Open Code Large Language Models for Code Understanding and Generationcited by 327
  18. 2020Nearest Neighbor Machine Translationcited by 209
  19. 2019BERT for Joint Intent Classification and Slot Fillingcited by 195
  20. 2021Structured Prediction as Translation between Augmented Natural Languagescited by 183
  21. 2021Constrained Language Models Yield Few-Shot Semantic Parserscited by 162
  22. 2016Attention-Based Recurrent Neural Network Models for Joint Intent Detection and Slot Fillingcited by 137
  23. 2022Large Language Models are few(1)-shot Table Reasonerscited by 116
  24. 2018Coarse-to-Fine Decoding for Neural Semantic Parsingcited by 110
  25. 2018Semantic Parsing for Task Oriented Dialog using Hierarchical Representationscited by 101
  26. 2020Low-Resource Domain Adaptation for Compositional Task-Oriented Semantic Parsingcited by 72
  27. 2023kNN Prompting: Beyond-Context Learning with Calibration-Free Nearest Neighbor Inferencecited by 47
  28. 2019Program Synthesis and Semantic Parsing with Learned Code Idiomscited by 34
  29. 2023CoF-CoT: Enhancing Large Language Models with Coarse-to-Fine Chain-of-Thought Prompting for Multi-domain NLU Taskscited by 18
  30. 2022Uni-Parser: Unified Semantic Parser for Question Answering on Knowledge Base and Databasecited by 16
  31. 2021Low-Resource Task-Oriented Semantic Parsing via Intrinsic Modelingcited by 10
  32. 2022Compositional Task-Oriented Parsing as Abstractive Question Answeringcited by 10
  33. 2022Dialog2API: Task-Oriented Dialogue with API Description and Example Programscited by 9
  34. 2021Semantic Parsing in Task-Oriented Dialog with Recursive Insertion-based Encodercited by 8
  35. 2023Localize, Retrieve and Fuse: A Generalized Framework for Free-Form Question Answering over Tablescited by 6

Built on by

Cited by year (2026 to 7 Oct)

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

3 papers.