Browse State-of-the-Art › Open Intent Detection

Open Intent Detection

6 papers with code · 17 benchmarks · 3 datasets archive 2025-07-28

Natural Language Processing

Open intent detection aims to identify n-class known intents, and detect one-class open intent.

Description from the archive archive 2025-07-28.

Benchmarks archive 2025-07-28

17 leaderboard tables shown for this task, 17 with rows (a “benchmark” on this site is a table with at least one row, as on /sota), ordered by row count. “Best model” is the first row in the archive's own order at snapshot; nothing is re-ranked here and metric direction is not recorded in the archive. PwC's Trend sparklines are not in the archive, so that column is omitted. 10 shown of 17 until expanded.

DatasetBest model (first row in archive order)PaperCodeSyntologyCompare
BANKING-77 (50% known) (2 rows) Metric learning + Adaptive Decision Boundary Metric Learning and Adaptive Boundary for Out-of-Domain Detection code — Compare
BANKING-77 (75% known) (2 rows) Metric learning + Adaptive Decision Boundary Metric Learning and Adaptive Boundary for Out-of-Domain Detection code — Compare
BANKING77 (25%known) (2 rows) Metric learning + Adaptive Decision Boundary Metric Learning and Adaptive Boundary for Out-of-Domain Detection code — Compare
OOS(25%known) (2 rows) Metric learning + Adaptive Decision Boundary Metric Learning and Adaptive Boundary for Out-of-Domain Detection code — Compare
OOS(50%known) (2 rows) Metric learning + Adaptive Decision Boundary Metric Learning and Adaptive Boundary for Out-of-Domain Detection code — Compare
OOS(75%known) (2 rows) Metric learning + Adaptive Decision Boundary Metric Learning and Adaptive Boundary for Out-of-Domain Detection code — Compare
ATIS (25% known) (1 row) LMCL Deep Unknown Intent Detection with Margin Loss code Syntology ran 0 of 1 samples · 1 unverified Compare
ATIS (50% known) (1 row) LMCL Deep Unknown Intent Detection with Margin Loss code Syntology ran 0 of 1 samples · 1 unverified Compare
Banking_CG (1 row) ADB+GPTAUG-F4 ChatGPT as Data Augmentation for Compositional Generalization: A... code — Compare
OOS_CG (1 row) ADB+GPTAUG-F4 ChatGPT as Data Augmentation for Compositional Generalization: A... code — Compare
SNIPS (25% known) (1 row) LMCL Deep Unknown Intent Detection with Margin Loss code Syntology ran 0 of 1 samples · 1 unverified Compare
SNIPS (50% known) (1 row) LMCL Deep Unknown Intent Detection with Margin Loss code Syntology ran 0 of 1 samples · 1 unverified Compare
SNIPS (75% known) (1 row) LMCL Deep Unknown Intent Detection with Margin Loss code Syntology ran 0 of 1 samples · 1 unverified Compare
StackOverFlow(25%known) (1 row) ADB Deep Open Intent Classification with Adaptive Decision Boundary code — Compare
StackOverFlow(50%known) (1 row) ADB Deep Open Intent Classification with Adaptive Decision Boundary code — Compare
StackOverFlow(75%known) (1 row) ADB Deep Open Intent Classification with Adaptive Decision Boundary code — Compare
StackOverflow_CG (1 row) DA-ADB ChatGPT as Data Augmentation for Compositional Generalization: A... code — Compare

Syntology column: samples harvested from the paper's repositories and executed on synthesized fixtures; “ran” is not a correctness claim and does not order the table. A dash means no Syntology record for that paper, not a recorded non-run. Read from the graph 2026-09-24.

Libraries

Not in the archive: the export carries no per-task library table, so there is nothing to show at snapshot 2025-07-28.

Datasets archive 2025-07-28

3 datasets whose archive record lists this task, ordered by the archive's paper count.

Subtasks archive 2025-07-28

No subtask under this task in the archive's task tree.

Parent tasks archive 2025-07-28

Most implemented papers archive 2025-07-28

6 shown of 6 papers with code (6 tagged with this task in all), ordered by repositories listed in the archive, not by stars (the archive holds no stars, so PwC's “Social” and “Latest” sorts cannot be reproduced). Papers without a page here are shown as plain text.

Syntology lines on 1 of the papers shown; no Syntology record for the others (a paper without an arXiv id cannot be joined to the graph, and absence from the graph layer is not a recorded non-run). “Ran” means the sample executed on a synthesized fixture, not that the paper's result was reproduced. Read from the graph 2026-09-24.

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections