Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
41 tokens/sec
GPT-4o
59 tokens/sec
Gemini 2.5 Pro Pro
41 tokens/sec
o3 Pro
7 tokens/sec
GPT-4.1 Pro
50 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Towards Textual Out-of-Domain Detection without In-Domain Labels (2203.11396v1)

Published 22 Mar 2022 in cs.CL, cs.AI, and cs.LG

Abstract: In many real-world settings, machine learning models need to identify user inputs that are out-of-domain (OOD) so as to avoid performing wrong actions. This work focuses on a challenging case of OOD detection, where no labels for in-domain data are accessible (e.g., no intent labels for the intent classification task). To this end, we first evaluate different LLM based approaches that predict likelihood for a sequence of tokens. Furthermore, we propose a novel representation learning based method by combining unsupervised clustering and contrastive learning so that better data representations for OOD detection can be learned. Through extensive experiments, we demonstrate that this method can significantly outperform likelihood-based methods and can be even competitive to the state-of-the-art supervised approaches with label information.

User Edit Pencil Streamline Icon: https://streamlinehq.com
Authors (5)
  1. Di Jin (104 papers)
  2. Shuyang Gao (28 papers)
  3. Seokhwan Kim (29 papers)
  4. Yang Liu (2253 papers)
  5. Dilek Hakkani-Tur (94 papers)
Citations (15)