When unlearning is free: leveraging low influence points to reduce computational costs

Anat Kleiman, Robert Fisher, Ben Deaner, Udi Wieder
12/4/2025
cs.LG

No confident code implementation found for this paper. 1 possible match can be shown below.

Abstract

As concerns around data privacy in machine learning grow, the ability to unlearn, or remove, specific data points from trained models becomes increasingly important. While state of the art unlearning methods have emerged in response, they typically treat all points in the forget set equally. In this work, we challenge this approach by asking whether points that have a negligible impact on the model's learning need to be removed. Through a comparative analysis of influence functions across language and vision tasks, we identify subsets of training data with negligible impact on model outputs. Leveraging this insight, we propose an efficient unlearning framework that reduces the size of datasets before unlearning leading to significant computational savings (up to approximately 50 percent) on real world empirical examples.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. 1 weaker match is hidden by default — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{kleiman2025when,
  title  = {When unlearning is free: leveraging low influence points to reduce computational costs},
  author = {Anat Kleiman and Robert Fisher and Ben Deaner and Udi Wieder},
  year   = {2025},
  eprint = {2512.05254},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2512.05254v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2512.05254.svg)](https://codeofpaper.com/paper/2512.05254)

Discussion