mlsanityData to 7 Oct 2026

Density-Based Dynamic Curriculum Learning for Intent Detection

arXiv 2108.10674 ↗First posted 24 Aug 2021cs.CLcited by 7

Not on the map. Why?

Abstract (arXiv)

Pre-trained language models have achieved noticeable performance on the intent detection task. However, due to assigning an identical weight to each sample, they suffer from the overfitting of simple samples and the failure to learn complex samples well. To handle this problem, we propose a density-based dynamic curriculum learning model. Our model defines the sample's difficulty level according to their eigenvectors' density. In this way, we exploit the overall distribution of all samples' eigenvectors simultaneously. Then we apply a dynamic curriculum learning strategy, which pays distinct attention to samples of various difficulty levels and alters the proportion of samples during the training process. Through the above operation, simple samples are well-trained, and complex samples are enhanced. Experiments on three open datasets verify that the proposed density-based algorithm can distinguish simple and complex samples significantly. Besides, our model obtains obvious improvement over the strong baselines.

Key facts. Cited by 7 papers in the map (data through 7 Oct 2026). Builds on 6 of its 12 references that are in the map. First posted on arXiv 24 Aug 2021.

Builds on

6 of 12 references.

References · 6

  1. 2020Efficient Intent Detection with Dual Sentence Encoderscited by 419
  2. 2019An Evaluation Dataset for Intent Classification and Out-of-Scope Predictioncited by 378
  3. 2020CLUE: A Chinese Language Understanding Evaluation Benchmarkcited by 277
  4. 2018CurriculumNet: Weakly Supervised Learning from Large-Scale Web Imagescited by 126
  5. 2020Norm-Based Curriculum Learning for Neural Machine Translationcited by 60
  6. 2019Curriculum Learning Strategies for IR: An Empirical Study on Conversation Response Rankingcited by 8

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2022: 1; 2023: 3; 2024: 0; 2025: 1; 2026: 2.

7 papers.