Exploring Zero and Few-shot Techniques for Intent Classification

Soham Parikh, Quaizar Vohra, Prashil Tumbade, Mitul Tiwari
5/11/2023
cs.CLcs.AI

No confident code implementation found for this paper. 4 possible matches can be shown below.

Abstract

Conversational NLU providers often need to scale to thousands of intent-classification models where new customers often face the cold-start problem. Scaling to so many customers puts a constraint on storage space as well. In this paper, we explore four different zero and few-shot intent classification approaches with this low-resource constraint: 1) domain adaptation, 2) data augmentation, 3) zero-shot intent classification using descriptions large language models (LLMs), and 4) parameter-efficient fine-tuning of instruction-finetuned language models. Our results show that all these approaches are effective to different degrees in low-resource settings. Parameter-efficient fine-tuning using T-few recipe (Liu et al., 2022) on Flan-T5 (Chang et al., 2022) yields the best performance even with just one sample per intent. We also show that the zero-shot method of prompting LLMs using intent descriptions

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. 4 weaker matches are hidden by default — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{parikh2023exploring,
  title  = {Exploring Zero and Few-shot Techniques for Intent Classification},
  author = {Soham Parikh and Quaizar Vohra and Prashil Tumbade and Mitul Tiwari},
  year   = {2023},
  eprint = {2305.07157},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2305.07157v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2305.07157.svg)](https://codeofpaper.com/paper/2305.07157)

Discussion