Cost-Effective Incremental Deep Model: Matching Model Capacity With the Least Sampling
- 7 December 2021
- journal article
- research article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Knowledge and Data Engineering
- Vol. 35 (4) , 3575-3588
Abstract
Real-world data is always in stream form. Thereby, there exits two challenges for building incremental deep models: a) Capacity Scalability. b) Capacity Sustainability. To this end, we develop an incremental deep model (IDM). However, IDM ignores another significant challenge with streaming data: c) Capacity Demand. Training a deep model always needs a large amount of labeled data, whereas it is almost impossible to label all unlabeled instances in real time. Thereby, we further improve IDM to a cost-effective incremental deep model (CE-IDM), which can adaptively select the most discriminative newly coming instances for query to reduce the manual labeling costs. Specifically, CE-IDM adopts a novel extensible deep network structure by using an extra attention model for hidden layers. Based on the adaptive attention weights, CE-IDM develops a novel instance selection criterion by jointly estimating unlabeled instances' representative and informative degree to satisfy the capacity demand. With the newly labeled instances, CE-IDM can quickly update the model with adaptive depth from streaming data and enable capacity scalability. Also, we address capacity sustainability by exploiting the attention based fisher information matrix, which can slow down the forgetting in consequence. We conduct extensive experiments on real-world data.Keywords
Funding Information
- National Natural Science Foundation of China (62006118, 61906092, 61773198, 91746301)
- Natural Science Foundation of Jiangsu Province of China (BK20200460, BK20190441)
- Jiangsu Shuangchuang
- CAAI-Huawei MindSpore Open Fund (CAAIXSJLJJ-2021-014B)
This publication has 43 references indexed in Scilit:
- Ensemble Learning in Fixed Expansion Layer Networks for Mitigating Catastrophic ForgettingIEEE Transactions on Neural Networks and Learning Systems, 2013
- Online Multiple Kernel ClassificationMachine Learning, 2012
- A survey on instance selection for active learningKnowledge and Information Systems, 2012
- Dual Strategy Active Learning2007
- Learning from Time-Changing Data with Adaptive Windowing2007
- Gradient-based learning applied to document recognitionProceedings of the IEEE, 1998
- A Sequential Algorithm for Training Text Classifiers1994
- A note on distributed estimation and sufficiencyIEEE Transactions on Information Theory, 1993
- Connectionist models of recognition memory: Constraints imposed by learning and forgetting functions.Psychological Review, 1990
- A Computer Method for Calculating Kendall's Tau with Ungrouped DataJournal of the American Statistical Association, 1966