Certified Per-Instance Unlearning Using Individual Sensitivity Bounds
On the map: LLM safety and security → Machine unlearning
Abstract (arXiv)
Certified machine unlearning can be achieved through noise injection, with differential privacy guarantees obtained by calibrating the noise to worst-case sensitivity. Yet, the influence of individual training points is highly heterogeneous, making such uniform calibration unnecessarily conservative for most deletion requests. We consider certified per-instance unlearning, a data-dependent notion of certified deletion in which the unlearning mechanism and its certificate can adapt to the point being removed. Our framework turns point-specific sensitivity information into formal unlearning guarantees, allowing the amount of noise to reflect the difficulty of the deletion request rather than the worst case. When training is deterministic, we derive explicit per-instance unlearning certificates. For noisy gradient descent, in the case of ridge regression, similar certificates are obtained through high-probability sensitivity bounds. Experiments on NYU-Depth with frozen DINOv2 features show substantial variation in deletion difficulty across points, and demonstrate that per-instance calibration can substantially improve utility over uniform worst-case calibration.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Placed in Machine unlearning, one of 12 directions in LLM safety and security. Builds on 24 of its 34 references that are in the map. First posted on arXiv 17 Feb 2026.
Builds on
24 of 34 references.
Closest ancestors · 10
Same direction, newest first
- 2025Certified Unlearning for Neural Networks8 Jun
- 2025A Certified Unlearning Approach without Access to Source Data6 Jun
- 2025System-Aware Unlearning Algorithms: Use Lesser, Forget Faster6 Jun
- 2025Leveraging Per-Instance Privacy for Machine Unlearning24 May
- 2025When to Forget? Complexity Trade-offs in Machine Unlearning24 Feb
- 2025Position: Bridge the Gaps between Machine Unlearning and AI Regulation18 Feb
- 2024Attribute-to-Delete: Machine Unlearning via Datamodel Matching30 Oct
- 2024Rewind-to-Delete: Certified Machine Unlearning for Nonconvex Functions15 Sep
- 2024Langevin Unlearning: A New Perspective of Noisy Gradient Descent for Machine Unlearning18 Jan
- 2021Remember What You Want to Forget: Algorithms for Machine Unlearning4 Mar
Other references · 14
- 2023DINOv2: Learning Robust Visual Features without Supervisioncited by 7,974
- 2016Deep Learning with Differential Privacycited by 2,728
- 2017Understanding Black-box Predictions via Influence Functionscited by 1,741
- 2017Renyi Differential Privacycited by 650
- 2014Convex Optimization: Algorithms and Complexitycited by 575
- 2019Certified Data Removal from Machine Learning Modelscited by 535
- 2019Making AI Forget You: Data Deletion in Machine Learningcited by 465
- 2020Descent-to-Delete: Gradient-Based Methods for Machine Unlearningcited by 311
- 2020Approximate Data Deletion from Machine Learning Modelscited by 255
- 2018Privacy Amplification by Iterationcited by 100
- 2021Differential Privacy Dynamics of Langevin Diffusion and Noisy Gradient Descentcited by 73
- 2022Differential Privacy Guarantees for Stochastic Gradient Langevin Dynamicscited by 19
2 more
- 2024Shifted Interpolation for Differential Privacycited by 13
- 2023Gradients Look Alike: Sensitivity is Often Overestimated in DP-SGDcited by 11
Built on by
Not cited yet.
Similar, not cited
Close in wording, no citation either way
- 2026Less Noise, Same Certificate: Retain Sensitivity for Unlearning
- 2026Sequential Subspace Noise Injection Prevents Accuracy Collapse in Certified Unlearning
- 2026Unlearning with Asymmetric Sources: Improved Unlearning-Utility Trade-off with Public Data
- 2024Certified Machine Unlearning via Noisy Stochastic Gradient Descent
- 2026Minimax Gaussian Mechanisms for Continual Machine Unlearning
- 2025Gaussian Certified Unlearning in High Dimensions: A Hypothesis Testing Approach
- 2024The Utility and Complexity of in- and out-of-Distribution Machine Unlearning
- 2026Near-Optimal Machine Unlearning Utility for Smooth Strongly Convex Losses