- Rating
- 3
- Confidence
- 3
- Informativeness
- 3
- Presentation
- 3
- Soundness
- 3
Read review
Paper summary
This paper proposes an interpretable differentially private continual learning framework using DP prototypes and DP-friendly loss functions to mitigate catastrophic forgetting. Experiments on Split-CIFAR-100 and Split-ImageNet-R show competitive performance against existing baselines. The authors also introduce methods to visualize DP prototypes using public and generated images.
Critical strengths
The authors propose an interpretable DP prototype-based continual learning framework, supported by theoretical analysis and comprehensive experimental evaluations.
Critical weaknesses
The theoretical analysis in Section 4.4 only considers Gaussian perturbations of class prototypes under a fixed projection. It does not account for representation drift caused by updating the projection when learning new tasks, which is a central challenge in continual learning. Consequently, the theoretical results do not capture the continual learning dynamics or explain how the proposed method mitigates catastrophic forgetting.
Questions for authors
Could the authors provide a theoretical analysis of the impact of differential privacy in the continual learning setting? If a rigorous theoretical analysis is challenging, even some intuitive insights into how DP affects continual learning dynamics would be valuable.
2 comments
Thank you for the clarification. I will maintain my positive score.
Response
Thank you for your thoughtful and constructive feedback. Your comments helped us identify an important limitation of our original theoretical analysis. We have revised Section 4.4, now titled "Prototype stability and continual adaptation", and added Appendix C with four new theorems and proofs. All changes are highlighted in blue.
We agree that our original analysis did not account for representation drift across tasks. We now examine how old-class classification margins evolve from the initialization of the projection matrix through successive task updates.
The central idea is to study the classification margin: the difference between an input's similarity to its correct prototype and its most similar competing prototype. A positive margin means the correct prototype is preferred. Our analysis characterizes how this margin changes under local projection updates and how representation drift accumulates across tasks. If the initial margin is sufficiently large relative to these accumulated changes, the prediction remains correct among previously learned classes. This connects representation drift to the preservation of old-class predictions.
The revised Section 4.4 summarizes the following results, with proofs in Appendix C:
These results also help explain the roles of our losses. PCL and push-away encourage separation from competing prototypes, while preservation uses synthetic support points to limit changes to old-class representations.
Importantly, our analysis provides sufficient conditions for preserving old-class predictions, not an end-to-end guarantee against catastrophic forgetting. The representation drift analysis is local, and we do not establish that minimizing our objective necessarily satisfies these conditions or prevents interference from newly introduced classes.
We have also revised Section 6 (Conclusion and Discussion) to acknowledge these limitations and identify stronger, end-to-end guarantees against catastrophic forgetting as an open research question.
Thank you for this suggestion. We have also added Theorem 5 (Appendix C.2), which extends our local representation drift analysis to DP-SGD. For sufficiently small updates, it separates the first-order effects of clipped learning gradients and privacy noise on old-class margins, with a bounded higher-order error. We also derive a high-probability bound on the first-order noise contribution.
This provides two insights:
Theorem 5 is a local analysis of DP-SGD, not a global convergence or forgetting guarantee. Although our experiments use DP-Adam, Theorem 4 also applies to sufficiently small DP-Adam updates, while the Gaussian noise bound in Theorem 5 is specific to DP-SGD.
Together, these results provide further insight into how continual adaptation and privacy noise affect previously learned classes and identify conditions for preserving their predictions. We hope these additions address the reviewer's concerns and strengthen our theoretical contribution.