MAGIC: Near-Optimal Data Attribution for Deep Learning

Andrew Ilyas, Logan Engstrom
4/23/2025
cs.LGcs.CLcs.CV

No confident code implementation found for this paper.

Abstract

The goal of predictive data attribution is to estimate how adding or removing a given set of training datapoints will affect model predictions. In convex settings, this goal is straightforward (i.e., via the infinitesimal jackknife). In large-scale (non-convex) settings, however, existing methods are far less successful -- current methods' estimates often only weakly correlate with ground truth. In this work, we present a new data attribution method (MAGIC) that combines classical methods and recent advances in metadifferentiation to (nearly) optimally estimate the effect of adding or removing training data on model predictions.

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. Any repos shown below are weak matches — 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{ilyas2025magic,
  title  = {MAGIC: Near-Optimal Data Attribution for Deep Learning},
  author = {Andrew Ilyas and Logan Engstrom},
  year   = {2025},
  eprint = {2504.16430},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2504.16430v1}
}

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/2504.16430.svg)](https://codeofpaper.com/paper/2504.16430)

Discussion