mlsanityData to 7 Oct 2026

EsaCL: Efficient Continual Learning of Sparse Models

arXiv 2401.05667 ↗First posted 11 Jan 2024cs.LG cs.AIcited by 2

Not on the map. Why?

Abstract (arXiv)

A key challenge in the continual learning setting is to efficiently learn a sequence of tasks without forgetting how to perform previously learned tasks. Many existing approaches to this problem work by either retraining the model on previous tasks or by expanding the model to accommodate new tasks. However, these approaches typically suffer from increased storage and computational requirements, a problem that is worsened in the case of sparse models due to need for expensive re-training after sparsification. To address this challenge, we propose a new method for efficient continual learning of sparse models (EsaCL) that can automatically prune redundant parameters without adversely impacting the model's predictive power, and circumvent the need of retraining. We conduct a theoretical analysis of loss landscapes with parameter pruning, and design a directional pruning (SDP) strategy that is informed by the sharpness of the loss function with respect to the model parameters. SDP ensures model with minimal loss of predictive accuracy, accelerating the learning of sparse models at each stage. To accelerate model update, we introduce an intelligent data selection (IDS) strategy that can identify critical instances for estimating loss landscape, yielding substantially improved data efficiency. The results of our experiments show that EsaCL achieves performance that is competitive with the state-of-the-art methods on three continual learning benchmarks, while using substantially reduced memory and computational resources.

Key facts. Cited by 2 papers in the map (data through 7 Oct 2026). Builds on 22 of its 31 references that are in the map. First posted on arXiv 11 Jan 2024.

Builds on

22 of 31 references.

References · 22

  1. 2021Convex optimizationcited by 2,479
  2. 2016Learning without Forgettingcited by 2,465
  3. 2016iCaRL: Incremental Classifier and Representation Learningcited by 2,313
  4. 2017Understanding Black-box Predictions via Influence Functionscited by 1,714
  5. 2020Sharpness-Aware Minimization for Efficiently Improving Generalizationcited by 1,404
  6. 2016On Large-Batch Training for Deep Learning: Generalization Gap and Sharp Minimacited by 1,337
  7. 2018Experience Replay for Continual Learningcited by 1,074
  8. 2020Dark Experience for General Continual Learning: a Strong, Simple Baselinecited by 895
  9. 2023A Comprehensive Survey of Continual Learning: Theory, Method and Applicationcited by 860
  10. 2021Sparsity in Deep Learning: Pruning and growth for efficient inference and training in neural networkscited by 521
  11. 2021Gradient Projection Memory for Continual Learningcited by 338
  12. 2022Towards Efficient and Scalable Sharpness-Aware Minimizationcited by 129
10 more
  1. 2020Dynamic Model Pruning with Feedbackcited by 125
  2. 2019Continual Learning via Neural Pruningcited by 101
  3. 2022Fisher SAM: Information Geometry and Sharpness Aware Minimisationcited by 84
  4. 2022SparCL: Sparse Continual Learning on the Edgecited by 55
  5. 2016Stochastic Frank-Wolfe Methods for Nonconvex Optimizationcited by 40
  6. 2022NISPA: Neuro-Inspired Stability-Plasticity Adaptation for Continual Learning in Sparse Networkscited by 38
  7. 2022Exploring Edge Disentanglement for Node Classificationcited by 23
  8. 2020Deep Neural Network Training with Frank-Wolfecited by 22
  9. 2021Semi-Supervised Graph-to-Graph Translationcited by 18
  10. 2020Directional Pruning of Deep Neural Networkscited by 16

Built on by

Cited by year

Citing papers per year: 2024: 2.

2 papers.