Sequential Subspace Noise Injection Prevents Accuracy Collapse in Certified Unlearning
Polina Dolgova, Sebastian U. Stich

TL;DR
The paper introduces sequential subspace noise injection for certified unlearning, significantly improving model accuracy while maintaining privacy guarantees, thus making certified unlearning more practical.
Contribution
It proposes a novel noise scheduling method that distributes noise across subspaces, enhancing accuracy without sacrificing privacy guarantees.
Findings
Subspace noise scheduling improves accuracy after unlearning.
Method maintains the same privacy guarantees as traditional approaches.
Empirical results show robustness against membership inference attacks.
Abstract
Certified unlearning based on differential privacy offers strong guarantees but remains largely impractical: the noisy fine-tuning approaches proposed so far achieve these guarantees but severely reduce model accuracy. We propose sequential noise scheduling, which distributes the noise budget across orthogonal subspaces of the parameter space, rather than injecting it all at once. This simple modification mitigates the destructive effect of noise while preserving the original certification guarantees. We extend the analysis of noisy fine-tuning to the subspace setting, proving that the same privacy budget is retained. Empirical results on image classification benchmarks show that our approach substantially improves accuracy after unlearning while remaining robust to membership inference attacks. These results show that certified unlearning can achieve both…
Peer Reviews
Decision·Submitted to ICLR 2026
1. The paper identifies the limitations of current certified unlearning based on differential privacy and validates the root cause through both theoretical analyses. 2. The idea of decomposing the noise injection process into orthogonal subspaces and applying it sequentially can preserve the theoretical guarantees of certified unlearning while alleviating the accuracy degradation issue. 3. Experiments on standard image classification benchmarks consistently demonstrate the efficacy of the propos
1. The paper assumes that the parameter space can be partitioned into strictly orthogonal subspaces. Please explain how to correctly distinguish orthogonal parameter subspaces, and why exactly K subspaces can always be partitioned? 2. The parameter space of deep neural networks exhibits high non-convexity and strong coupling characteristics. Could you explain how strong assumptions impact the practical scenario? 3. The proposed approach critically depends on knowing the upper bound $\Delta(\rho)
1. The paper is very well written, with a clear and thoughtful analytical presentation. 2. The theoretical results are rigorously proved, and the authors carefully address limitations in prior theorem assumptions. 3. The supporting experiments are well designed and effectively validate the theoretical insights presented in the analysis.
1. The experiments are conducted primarily on smaller models such as ResNet, raising concerns about the scalability of the proposed method. It remains unclear how well the approach would translate to large-scale, billion-parameter models, or how practical it would be to perform layer-wise orthogonal decomposition across complex architectures. 2. While the empirical results show minimal accuracy loss for block-wise noisy fine-tuning (Block-NFT), it is not clearly established whether the total fi
This paper is easy to follow and the algorithm is lised clearly. The proposed sequential subspace noisy fine-tuning approach for certified unlearning is original and theoretically solid. The theoretical guarantee makes this approach very promising and have valuable potentials. The authors provide theoretical results to validate the reliability of the proposed approach. They also provide theoretical analysis to explain utility collapse in over-parameterized models and motivates the subspace sche
My main concern is about the unvalidated $\Delta(\rho)$. The paper's certificates replace the unconditional model-clipping threshold $C_{0}$ from Koloskova et al. with a high-probability proximity $\Delta(\rho)$ between the full-data model and the retained-only retrain, and then calibrate noise by substituting $C_{0}$ by $\Delta(\rho)/2$. $\Delta(\rho)$ is the key component of the paper's guarantee and calibration. It replaces the standard clipping thresold $C_{0}$ everywhere in the analysis
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsPrivacy-Preserving Technologies in Data · Adversarial Robustness in Machine Learning · Stochastic Gradient Optimization Techniques
