paper-with-me

홈 › Papers

Iterative Network Pruning with Uncertainty Regularization for Lifelong Sentiment Classification

2021-06-21 · Binzong Geng, Min Yang, Fajie Yuan, Shupeng Wang, Xiang Ao, Ruifeng Xu

Lifelong learning capabilities are crucial for sentiment classifiers to process continuous streams of opinioned information on the Web. However, performing lifelong learning is non-trivial for deep neural networks as continually training of incrementally available information inevitably results in catastrophic forgetting or interference. In this paper, we propose a novel iterative network pruning with uncertainty regularization method for lifelong sentiment classification (IPRLS), which leverages the principles of network pruning and weight regularization. By performing network pruning with uncertainty regularization in an iterative manner, IPRLS can adapta single BERT model to work with continuously arriving data from multiple domains while avoiding catastrophic forgetting and interference. Specifically, we leverage an iterative pruning method to remove redundant parameters in large deep networks so that the freed-up space can then be employed to learn new tasks, tackling the catastrophic forgetting problem. Instead of keeping the old-tasks fixed when learning new tasks, we also use an uncertainty regularization based on the Bayesian online learning framework to constrain the update of old tasks weights in BERT, which enables positive backward transfer, i.e. learning new tasks improves performance on past tasks while protecting old knowledge from being lost. In addition, we propose a task-specific low-dimensional residual function in parallel to each layer of BERT, which makes IPRLS less prone to losing the knowledge saved in the base BERT network when learning a new task. Extensive experiments on 16 popular review corpora demonstrate that the proposed IPRLS method sig-nificantly outperforms the strong baselines for lifelong sentiment classification. For reproducibility, we submit the code and data at:https://github.com/siat-nlp/IPRLS.

📄 PDF Abstract BibTeX arXiv:2106.11197

Code (1)

siat-nlp/IPRLS 공식 구현 pytorch

Tasks

Lifelong learningNetwork PruningSentiment AnalysisSentiment Classification

Methods 이 논문이 사용한 방법론

Attention 설명 없음
Pruning 설명 없음
Linear Layer A Linear Layer is a projection $\mathbf{XW + b}$.
Adam 설명 없음
Weight Decay 설명 없음
Dropout Dropout is a regularization technique for neural networks that drops a unit (along with connections) at training time with a specified probability $p$ (a common value is…
WordPiece 설명 없음
Multi-Head Attention 설명 없음

Similar Papers 제목 키워드 기반

Long Live the Lottery: The Existence of Winning Tickets in Lifelong Learning

2021-01-01 · ICLR 2021 1 · Tianlong Chen, Zhenyu Zhang, Sijia Liu, Shiyu Chang 외

The lottery ticket hypothesis demonstrates that a highly sparsified sub-network can be trained in isolation, given the appropriate weight initialization. This paper extends that hypothesis from one-shot task leaning, and…

class-incremental learningClass Incremental LearningIncremental LearningKnowledge Distillation+2

Uncertainty-guided Lifelong Learning in Bayesian Networks

2018-09-27 · Sayna Ebrahimi, Mohamed Elhoseiny, Trevor Darrell, Marcus Rohrbach

Sequentially learning of tasks arriving in a continuous stream is a complex problem and becomes more challenging when the model has a fixed capacity. Lifelong learning aims at learning new tasks without forgetting previ…

Continual LearningLifelong learning

Lifelong Learning for Sentiment Classification

2018-01-09 · IJCNLP 2015 7 · Zhiyuan Chen, Nianzu Ma, Bing Liu

This paper proposes a novel lifelong learning (LL) approach to sentiment classification. LL mimics the human continuous learning process, i.e., retaining the knowledge learned from past tasks and use it to help future le…

Bayesian OptimizationClassificationGeneral ClassificationLifelong learning+2

Pruning Pre-trained Language Models with Principled Importance and Self-regularization

2023-05-21 · Siyu Ren, Kenny Q. Zhu

Iterative pruning is one of the most effective compression methods for pre-trained language models. We discovered that finding the optimal pruning decision is an equality-constrained 0-1 Integer Linear Programming proble…

Data-to-Text Generationnamed-entity-recognitionNamed Entity RecognitionNatural Language Understanding+2

Bayes-enhanced Lifelong Attention Networks for Sentiment Classification

2020-12-01 · COLING 2020 8 · Hao Wang, Shuai Wang, Sahisnu Mazumder, Bing Liu 외

The classic deep learning paradigm learns a model from the training data of a single task and the learned model is also tested on the same task. This paper studies the problem of learning a sequence of tasks (sentiment c…

ClassificationSentiment AnalysisSentiment Classification