Enhancing Knowledge Transfer for Task Incremental Learning with Data-free Subnetwork
Qiang Gao, Xiaojun Shan, Yuchen Zhang, Fan Zhou
Abstract
As there exist competitive subnetworks within a dense network in concert with Lottery Ticket Hypothesis , we introduce a novel neuron-wise task incremental learning method, namely Data-free Subnetworks (DSN) , which attempts to enhance the elastic knowledge transfer across the tasks that sequentially arrive. Specifically, DSN primarily seeks to transfer knowledge to the new coming task from the learned tasks by selecting the affiliated weights of a small set of neurons to be activated, including the reused neurons from prior tasks via neuron-wise masks. And it also transfers possibly valuable knowledge to the earlier tasks via data-free replay. Especially, DSN inherently relieves the catastrophic forgetting and the unavailability of past data or possible privacy concerns. The comprehensive experiments conducted on four benchmark datasets demonstrate the effectiveness of the proposed DSN in the context of task-incremental learning by comparing it to several state-of-the-art baselines. In particular, DSN enables the knowledge transfer to the earlier tasks, which is often overlooked by prior efforts.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext 99bc67ff-d58e-4765-86e7-cf45fe63c73eCited by top-tier papers6
- Navigating Complexity: Toward Lossless Graph Condensation via Expanding Window MatchingYuchen Zhang, Tianle Zhang, Kai Wang, Ziyao Guo et al.ICML 2024 · 38 citations
- Orchestrate Latent Expertise: Advancing Online Continual Learning with Multi-Level Supervision and Reverse Self-DistillationHongwei Yan, Liyuan Wang, Kaisheng Ma, Yi ZhongCVPR 2024 · 15 citations
- Revisiting Weight Regularization for Low-Rank Continual LearningYaoyue Zheng, Yin Zhang, Joost van de Weijer, Gido van de Ven et al.ICLR 2026 · 7 citations
- ContiGuard: A Framework for Continual Toxicity Detection Against Evolving Evasive PerturbationsHankun Kang, Xin Miao, Jianhao Chen, Jintao Wen et al.WWW 2026
- Lethe: Plasticity-aware Active Forgetting for Resource-Efficient On-Device Continual LearningHaibo Liu, Chenxin Mao, Zhenzhe Zheng, Fan Wu et al.KDD 2026
Builds on19
- Supermasks in SuperpositionMitchell Wortsman, Vivek Ramanujan, Rosanne Liu, Aniruddha Kembhavi et al.NeurIPS 2020 · 364 citations
- Proving the Lottery Ticket Hypothesis: Pruning is All You NeedEran Malach, Gilad Yehudai, Shai Shalev-Shwartz, Ohad ShamirICML 2020 · 327 citations
- Continual Learning with Node-Importance based Adaptive Group Sparse RegularizationSangwon Jung, Hongjoon Ahn, Sungmin Cha, Taesup MoonNeurIPS 2020 · 176 citations
- Continual Learning of a Mixed Sequence of Similar and Dissimilar TasksZixuan Ke, Bing Liu, Xingchang HuangNeurIPS 2020 · 173 citations
- Achieving Forgetting Prevention and Knowledge Transfer in Continual LearningZixuan Ke, Bing Liu, Nianzu Ma, Hu Xu et al.NeurIPS 2021 · 167 citations
Related papers
- Forget-free Continual Learning with Winning SubnetworksHaeyong Kang, Rusty John Lloyd Mina, Sultan Rizky Hikmawan Madjid, Jaehong Yoon et al.ICML 2022 · 159 citations
- On the Soft-Subnetwork for Few-Shot Class Incremental LearningHaeyong Kang, Jaehong Yoon, Sultan Rizky Hikmawan Madjid, Sung Ju Hwang et al.ICLR 2023 · 12 citations
- Task-aware Orthogonal Sparse Network for Exploring Shared Knowledge in Continual LearningYusong Hu, De Cheng, Dingwen Zhang, Nannan Wang et al.ICML 2024 · 14 citations
- Looking Back on Learned Experiences For Class/task Incremental LearningMozhgan PourKeshavarz, Guoying Zhao, Mohammad SabokrouICLR 2022 · 42 citations
- Parameter-Level Soft-Masking for Continual LearningTatsuya Konishi, Mori Kurokawa, Chihiro Ono, Zixuan Ke et al.ICML 2023 · 63 citations
