TinySubNets: An Efficient and Low Capacity Continual Learning Strategy
Marcin Pietron, Kamil Faber, Dominik Zurek, Roberto Corizzo
Abstract
Continual Learning (CL) is a highly relevant setting gaining traction in recent machine learning research. Among CL works, architectural and hybrid strategies are particularly effective due to their potential to adapt the model architecture as new tasks are presented. However, many existing solutions do not efficiently exploit model sparsity, and are prone to capacity saturation due to their inefficient use of available weights, which limits the number of learnable tasks. In this paper, we propose TinySubNets (TSN), a novel architectural CL strategy that addresses the issues through the unique combination of pruning with different sparsity levels, adaptive quantization, and weight sharing. Pruning identifies a subset of weights that preserve model performance, making less relevant weights available for future tasks. Adaptive quantization allows a single weight to be separated into multiple parts which can be assigned to different tasks. Weight sharing between tasks boosts the exploitation of capacity and task similarity, allowing for the identification of a better trade-off between model accuracy and capacity. These features allow TSN to efficiently leverage the available capacity, enhance knowledge transfer, and reduce computational resources consumption. Experimental results involving common benchmark CL datasets and scenarios show that our proposed strategy achieves better results in terms of accuracy than existing state-of-the-art CL strategies. Moreover, our strategy is shown to provide a significantly improved model capacity exploitation.
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 3337afe3-21db-43f1-9798-44d3d5f048f6Cited by top-tier papers2
- SAMCL: Empowering SAM to Continually Learn from Dynamic Domains with Extreme Storage EfficiencyZeqing Wang, Kangye Ji, Di Wang, Haibin Zhang et al.AAAI 2026 · 2 citations
- MaRS: Memory-Adaptive Routing for Reliable Capacity Expansion and Knowledge RetentionGang YanICLR 2026
Builds on10
- Dark Experience for General Continual Learning: a Strong, Simple BaselinePietro Buzzega, Matteo Boschini, Angelo Porrello, Davide Abati et al.NeurIPS 2020 · 1,494 citations
- Gradient Projection Memory for Continual LearningGobinda Saha, Isha Garg, Kaushik RoyICLR 2021 · 409 citations
- Supermasks in SuperpositionMitchell Wortsman, Vivek Ramanujan, Rosanne Liu, Aniruddha Kembhavi et al.NeurIPS 2020 · 364 citations
- DyTox: Transformers for Continual Learning with DYnamic TOken eXpansionArthur Douillard, Alexandre Ramé, Guillaume Couairon, Matthieu CordCVPR 2022 · 315 citations
- RanPAC: Random Projections and Pre-trained Models for Continual LearningMark D. McDonnell, Dong Gong, Amin Parvaneh, Ehsan Abbasnejad et al.NeurIPS 2023 · 245 citations
Related papers
- 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
- Continual Learning with Adaptive Weights (CLAW)Tameem Adel, Han Zhao, Richard E. TurnerICLR 2020 · 79 citations
- Parameter-Level Soft-Masking for Continual LearningTatsuya Konishi, Mori Kurokawa, Chihiro Ono, Zixuan Ke et al.ICML 2023 · 63 citations
- Learning Bayesian Sparse Networks with Full Experience Replay for Continual LearningQingsen Yan, Dong Gong, Yuhang Liu, Anton van den Hengel et al.CVPR 2022 · 38 citations
- Forget-free Continual Learning with Winning SubnetworksHaeyong Kang, Rusty John Lloyd Mina, Sultan Rizky Hikmawan Madjid, Jaehong Yoon et al.ICML 2022 · 159 citations
