IMU: Influence-guided Machine Unlearning
On the map: LLM safety and security → Machine unlearning
Abstract (arXiv)
Machine Unlearning (MU) aims to selectively erase the influence of specific data points from pretrained models. However, most existing MU methods rely on the retain set to preserve model utility, which is often impractical due to privacy restrictions and storage constraints. While several retain-data-free methods attempt to bypass this using geometric feature shifts or auxiliary statistics, they typically treat forgetting samples uniformly, overlooking their heterogeneous contributions. To address this, we propose ulInfluence-guided ulMachine ulUnlearning (IMU), a principled method that conducts MU using only the forget set. Departing from uniform Gradient Ascent (GA) or implicit weighting mechanisms, IMU leverages influence functions as an explicit priority signal to allocate unlearning strength. To circumvent the prohibitive cost of full-model Hessian inversion, we introduce a theoretically grounded classifier-level influence approximation. This efficient design allows IMU to dynamically reweight unlearning updates, aggressively targeting samples that most strongly support the forgetting objective while minimizing unnecessary perturbation to retained knowledge. Extensive experiments across vision and language tasks show that IMU achieves highly competitive results. Compared to standard uniform GA, IMU maintains identical unlearning depth while enhancing model utility by an average of 30%, effectively overcoming the inherent utility-forgetting trade-off.
Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Placed in Machine unlearning, one of 12 directions in LLM safety and security. Builds on 48 of its 73 references that are in the map. First posted on arXiv 3 Aug 2025.
Builds on
48 of 73 references.
Closest ancestors · 18
Same direction, newest first
- 2025OpenUnlearning: Accelerating LLM Unlearning via Unified Benchmarking of Methods and Metrics14 Jun
- 2025LoTUS: Large-Scale Machine Unlearning with a Taste of Uncertainty24 Mar
- 2025Data Unlearning in Diffusion Models2 Mar
- 2024MUNBa: Machine Unlearning via Nash Bargaining23 Nov
- 2024Simplicity Prevails: Rethinking Negative Preference Optimization for LLM Unlearning9 Oct
- 2024Is Retain Set All You Need in Machine Unlearning? Restoring Performance of Unlearned Models with Out-Of-Distribution Images19 Apr
- 2024Negative Preference Optimization: From Catastrophic Collapse to Effective Unlearning8 Apr
- 2024Loss-Free Machine Unlearning29 Feb
- 2024An Information Theoretic Approach to Machine Unlearning2 Feb
- 2024Scissorhands: Scrub Data Influence via Connection Sensitivity in Networks11 Jan
- 2023SalUn: Empowering Machine Unlearning via Gradient-based Weight Saliency in Both Image Classification and Generation19 Oct
- 2023Fast Machine Unlearning Without Retraining Through Selective Synaptic Dampening15 Aug
6 more
- 2023Boundary Unlearning21 Mar
- 2023Learning to Unlearn: Instance-wise Unlearning for Pre-trained Classifiers27 Jan
- 2022Knowledge Unlearning for Mitigating Privacy Risks in Language Models4 Oct
- 2022Towards Adversarial Evaluations for Inexact Machine Unlearning17 Jan
- 2021Unrolling SGD: Understanding Factors Influencing Machine Unlearning27 Sep
- 2021Remember What You Want to Forget: Algorithms for Machine Unlearning4 Mar
Other references · 30
- 2015Deep Residual Learning for Image Recognitioncited by 51,809
- 2023Direct Preference Optimization: Your Language Model is Secretly a Reward Modelcited by 7,916
- 2016Grad-CAM: Visual Explanations from Deep Networks via Gradient-based Localizationcited by 6,690
- 2017Understanding Black-box Predictions via Influence Functionscited by 1,714
- 2019Machine Unlearningcited by 1,020
- 2019Deep Leakage from Gradientscited by 1,004
- 2024SimPO: Simple Preference Optimization with a Reference-Free Rewardcited by 951
- 2015Optimizing Neural Networks with Kronecker-factored Approximate Curvaturecited by 776
- 2020Inverting Gradients -- How easy is it to break privacy in federated learning?cited by 707
- 2019Eternal Sunshine of the Spotless Net: Selective Forgetting in Deep Networkscited by 599
- 2020Estimating Training Data Influence by Tracing Gradient Descentcited by 565
- 2018Do Better ImageNet Models Transfer Better?cited by 560
18 more
- 2019Certified Data Removal from Machine Learning Modelscited by 512
- 2019Making AI Forget You: Data Deletion in Machine Learningcited by 447
- 2020Descent-to-Delete: Gradient-Based Methods for Machine Unlearningcited by 303
- 2017Empirical Analysis of the Hessian of Over-Parametrized Neural Networkscited by 283
- 2020Influence Functions in Deep Learning Are Fragilecited by 247
- 2020Forgetting Outside the Box: Scrubbing Deep Networks of Information Accessible from Input-Output Observationscited by 171
- 2023One-Dimensional Adapter to Rule Them All: Concepts, Diffusion Models and Erasing Applicationscited by 164
- 2020Mixed-Privacy Forgetting in Deep Networkscited by 158
- 2020Explaining Black Box Predictions and Unveiling Data Artifacts through Influence Functionscited by 144
- 2020DeltaGrad: Rapid retraining of machine learning modelscited by 143
- 2022If Influence Functions are the Answer, Then What is the Question?cited by 142
- 2022The Right to be Forgotten in Federated Learning: An Efficient Realization with Rapid Retrainingcited by 109
- 2019On Second-Order Group Influence Functions for Black-Box Predictionscited by 78
- 2022PUMA: Performance Unchanged Model Augmentation for Training Data Removalcited by 56
- 2024Erasing Undesirable Influence in Diffusion Modelscited by 52
- 2020Discriminative Jackknife: Quantifying Uncertainty in Deep Learning via Higher-Order Influence Functionscited by 34
- 2023Revisiting the Fragility of Influence Functionscited by 20
- 2024Boosting Alignment for Post-Unlearning Text-to-Image Generative Modelscited by 15
Built on by
Citing papers per year: 2026: 1.
1 paper.