Hyperparameter-free Continuous Learning for Domain Classification in Natural Language Understanding
Not on the map. Why?
Abstract (arXiv)
Domain classification is the fundamental task in natural language understanding (NLU), which often requires fast accommodation to new emerging domains. This constraint makes it impossible to retrain all previous domains, even if they are accessible to the new model. Most existing continual learning approaches suffer from low accuracy and performance fluctuation, especially when the distributions of old and new data are significantly different. In fact, the key real-world problem is not the absence of old data, but the inefficiency to retrain the model with the whole old dataset. Is it potential to utilize some old data to yield high accuracy and maintain stable performance, while at the same time, without introducing extra hyperparameters? In this paper, we proposed a hyperparameter-free continual learning model for text data that can stably produce high performance under various environments. Specifically, we utilize Fisher information to select exemplars that can "record" key information of the original model. Also, a novel scheme called dynamical weight consolidation is proposed to enable hyperparameter-free learning during the retrain process. Extensive experiments demonstrate that baselines suffer from fluctuated performance and therefore useless in practice. On the contrary, our proposed model CCFI significantly and consistently outperforms the best state-of-the-art method by up to 20% in average accuracy, and each component of CCFI contributes effectively to overall performance.
Key facts. Cited by 4 papers in the map (data through 7 Oct 2026). Builds on 14 of its 21 references that are in the map. First posted on arXiv 5 Jan 2022.
Builds on
14 of 21 references.
References · 14
- 2018BERT: Pre-training of Deep Bidirectional Transformers for Language Understandingcited by 40,204
- 2016Overcoming catastrophic forgetting in neural networkscited by 4,718
- 2019Parameter-Efficient Transfer Learning for NLPcited by 4,195
- 2016Learning without Forgettingcited by 2,465
- 2016iCaRL: Incremental Classifier and Representation Learningcited by 2,313
- 2013Rich feature hierarchies for accurate object detection and semantic segmentationcited by 2,160
- 2017Gradient Episodic Memory for Continual Learningcited by 1,871
- 2013DeCAF: A Deep Convolutional Activation Feature for Generic Visual Recognitioncited by 422
- 2019An Evaluation Dataset for Intent Classification and Out-of-Scope Predictioncited by 378
- 2014CNN Features off-the-shelf: an Astounding Baseline for Recognitioncited by 316
- 2017Just ASK: Building an Architecture for Extensible Self-Service Spoken Language Understandingcited by 6
- 2018A Scalable Neural Shortlisting-Reranking Approach for Large-Scale Domain Classification in Natural Language Understandingcited by 6
Built on by
Citing papers per year: 2022: 2; 2023: 0; 2024: 1; 2025: 1.
4 papers.
- 2022Language model compression with weighted low-rank factorizationcited by 192
- 2024Towards Lifelong Learning of Large Language Models: A Surveycited by 60
- 2022Numerical Optimizations for Weighted Low-rank Estimation on Language Modelcited by 14
- 2025From Large to Super-Tiny: End-to-End Optimization for Cost-Efficient LLMscited by 1
- 2025From Large to Super-Tiny: End-to-End Optimization for Cost-Efficient LLMs18 Apr 2025
- 2024Towards Lifelong Learning of Large Language Models: A Survey10 Jun 2024
- 2022Numerical Optimizations for Weighted Low-rank Estimation on Language Model2 Nov 2022
- 2022Language model compression with weighted low-rank factorization30 Jun 2022