Semi-Supervised Few-Shot Intent Classification and Slot Filling
Not on the map. Why?
Abstract (arXiv)
Intent classification (IC) and slot filling (SF) are two fundamental tasks in modern Natural Language Understanding (NLU) systems. Collecting and annotating large amounts of data to train deep learning models for such systems is not scalable. This problem can be addressed by learning from few examples using fast supervised meta-learning techniques such as prototypical networks. In this work, we systematically investigate how contrastive learning and unsupervised data augmentation methods can benefit these existing supervised meta-learning pipelines for jointly modelled IC/SF tasks. Through extensive experiments across standard IC/SF benchmarks (SNIPS and ATIS), we show that our proposed semi-supervised approaches outperform standard supervised meta-learning methods: contrastive losses in conjunction with prototypical networks consistently outperform the existing state-of-the-art for both IC and SF tasks, while data augmentation strategies primarily improve few-shot IC by a significant margin.
Key facts. Cited by 3 papers in the map (data through 7 Oct 2026). Builds on 18 of its 26 references that are in the map. First posted on arXiv 17 Sep 2021.
Builds on
18 of 26 references.
References · 18
- 2020A Simple Framework for Contrastive Learning of Visual Representationscited by 11,979
- 2017Model-Agnostic Meta-Learning for Fast Adaptation of Deep Networkscited by 4,861
- 2017Prototypical Networks for Few-shot Learningcited by 3,001
- 2020Supervised Contrastive Learningcited by 2,803
- 2019EDA: Easy Data Augmentation Techniques for Boosting Performance on Text Classification Taskscited by 800
- 2015Improving Neural Machine Translation Models with Monolingual Datacited by 784
- 2018Snips Voice Platform: an embedded Spoken Language Understanding system for private-by-design voice interfacescited by 376
- 2019Meta-Dataset: A Dataset of Datasets for Learning to Learn from Few Examplescited by 312
- 2018Marian: Fast Neural Machine Translation in C++cited by 202
- 2018QANet: Combining Local Convolution with Global Self-Attention for Reading Comprehensioncited by 164
- 2020Meta-Learning Requires Meta-Augmentationcited by 57
- 2021Neural Data Augmentation via Example Extrapolationcited by 54
6 more
- 2019Robust Zero-Shot Cross-Domain Slot Filling with Example Valuescited by 38
- 2020Data Augmentation for Meta-Learningcited by 38
- 2020Learning to Classify Intents and Slot Labels Given a Handful of Examplescited by 31
- 2019Syntax-Infused Transformer and BERT models for Machine Translation and Natural Language Understandingcited by 20
- 2020Task Augmentation by Rotating for Meta-Learningcited by 18
- 2020Encoding Syntactic Knowledge in Transformer Encoder for Intent Detection and Slot Fillingcited by 10
Built on by
Citing papers per year: 2022: 2; 2023: 1.
3 papers.