mlsanityData to 14 Oct 2026

On Newton's Method to Unlearn Neural Networks

arXiv 2406.14507 ↗First posted 20 Jun 2024cs.LG cs.AIcited by 5

On the map: LLM safety and security → Machine unlearning

Abstract (arXiv)

With the widespread applications of neural networks (NNs) trained on personal data, machine unlearning has become increasingly important for enabling individuals to exercise their personal data ownership, particularly the "right to be forgotten" from trained NNs. Since retraining is computationally expensive, we seek approximate unlearning algorithms for NNs that return identical models to the retrained oracle. While Newton's method has been successfully used to approximately unlearn linear models, we observe that adapting it for NN is challenging due to degenerate Hessians that make computing Newton's update impossible. Additionally, we show that when coupled with popular techniques to resolve the degeneracy, Newton's method often incurs offensively large norm updates and empirically degrades model performance post-unlearning. To address these challenges, we propose CureNewton's method, a principle approach that leverages cubic regularization to handle the Hessian degeneracy effectively. The added regularizer eliminates the need for manual finetuning and affords a natural interpretation within the unlearning context. Experiments across different models and datasets show that our method can achieve competitive unlearning performance to the state-of-the-art algorithm in practical unlearning settings, while being theoretically justified and efficient in running time.

Key facts. Cited by 5 papers in the map (data through 14 Oct 2026). Placed in Machine unlearning, one of 12 directions in LLM safety and security. Builds on 30 of its 50 references that are in the map. First posted on arXiv 20 Jun 2024.

Builds on

30 of 50 references.

Closest ancestors · 6

Same direction, newest first

  1. 2022A Survey of Machine Unlearning6 Sep
  2. 2022Can Bad Teaching Induce Forgetting? Unlearning in Deep Networks using an Incompetent Teacher17 May
  3. 2021Fast Yet Effective Machine Unlearning17 Nov
  4. 2021Machine Unlearning of Features and Labels26 Aug
  5. 2021Remember What You Want to Forget: Algorithms for Machine Unlearning4 Mar
  6. 2021Machine Unlearning via Algorithmic Stability25 Feb

Other references · 24

  1. 2015Deep Residual Learning for Image Recognitioncited by 52,096
  2. 2021LoRA: Low-Rank Adaptation of Large Language Modelscited by 14,380
  3. 2023Llama 2: Open Foundation and Fine-Tuned Chat Modelscited by 13,028
  4. 2017Fashion-MNIST: a Novel Image Dataset for Benchmarking Machine Learning Algorithmscited by 4,349
  5. 2022Robust Speech Recognition via Large-Scale Weak Supervisioncited by 4,057
  6. 2016Membership Inference Attacks against Machine Learning Modelscited by 2,281
  7. 2017Understanding Black-box Predictions via Influence Functionscited by 1,741
  8. 2019Machine Unlearningcited by 1,061
  9. 2019Eternal Sunshine of the Spotless Net: Selective Forgetting in Deep Networkscited by 618
  10. 2019Certified Data Removal from Machine Learning Modelscited by 535
  11. 2019Making AI Forget You: Data Deletion in Machine Learningcited by 465
  12. 2020Descent-to-Delete: Gradient-Based Methods for Machine Unlearningcited by 311
12 more
  1. 2019An Investigation into Neural Net Optimization via Hessian Eigenvalue Densitycited by 292
  2. 2017Empirical Analysis of the Hessian of Over-Parametrized Neural Networkscited by 290
  3. 2020Forgetting Outside the Box: Scrubbing Deep Networks of Information Accessible from Input-Output Observationscited by 180
  4. 2020Mixed-Privacy Forgetting in Deep Networkscited by 163
  5. 2020Machine Unlearning for Random Forestscited by 131
  6. 2016Matrix Completion has No Spurious Local Minimumcited by 125
  7. 2020Machine Unlearning: Linear Filtration for Logit-based Classifierscited by 95
  8. 2017Stochastic Cubic Regularization for Fast Nonconvex Optimizationcited by 55
  9. 2021Analytic Insights into Structure and Rank of Neural Network Hessian Mapscited by 52
  10. 2017Newton-Type Methods for Non-Convex Optimization Under Inexact Hessian Informationcited by 41
  11. 2015When Are Nonconvex Problems Not Scary?cited by 28
  12. 2016Gradient Descent Finds the Cubic-Regularized Non-Convex Newton Stepcited by 18

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2024: 2; 2025: 1; 2026: 2.

5 papers.

Similar, not cited

Close in wording, no citation either way

  1. 2024Hessian-Free Online Certified Unlearning
  2. 2023Certified Minimax Unlearning with Generalization Rates and Deletion Capacity
  3. 2025Certified Data Removal Under High-dimensional Settings
  4. 2025Provable Unlearning with Gradient Ascent on Two-Layer ReLU Neural Networks
  5. 2026On Optimization Complexity of Second-Order Certified Unlearning
  6. 2024Machine Unlearning with Minimal Gradient Dependence for High Unlearning Ratios
  7. 2023Model Sparsity Can Simplify Machine Unlearning
  8. 2024Unified Gradient-Based Machine Unlearning with Remain Geometry Enhancement