High-memorization training examples are forgotten fastest in class-incremental learning, and a cheap proxy based on learning iteration can guide buffer policies, favoring typical samples for small buffers and memorized ones for large buffers.
Continual Learning with Differential Privacy
1 Pith paper cite this work. Polarity classification is still indexing.
abstract
In this paper, we focus on preserving differential privacy (DP) in continual learning (CL), in which we train ML models to learn a sequence of new tasks while memorizing previous tasks. We first introduce a notion of continual adjacent databases to bound the sensitivity of any data record participating in the training process of CL. Based upon that, we develop a new DP-preserving algorithm for CL with a data sampling strategy to quantify the privacy risk of training data in the well-known Averaged Gradient Episodic Memory (A-GEM) approach by applying a moments accountant. Our algorithm provides formal guarantees of privacy for data records across tasks in CL. Preliminary theoretical analysis and evaluations show that our mechanism tightens the privacy loss while maintaining a promising model utility.
citation-role summary
citation-polarity summary
fields
cs.LG 1years
2025 1verdicts
CONDITIONAL 1roles
background 1polarities
unclear 1representative citing papers
citing papers explorer
-
What is the role of memorization in Continual Learning?
High-memorization training examples are forgotten fastest in class-incremental learning, and a cheap proxy based on learning iteration can guide buffer policies, favoring typical samples for small buffers and memorized ones for large buffers.