The reviewed record of science sign in
Pith

arxiv: 2410.13850 · v5 · pith:RNNTZ6FK · submitted 2024-10-17 · cs.LG · cs.AI

Influence Functions for Scalable Data Attribution in Diffusion Models

Reviewed by Pithpith:RNNTZ6FKopen to challenge →

classification cs.LG cs.AI
keywords datadiffusioninfluencemodelsattributionfunctionsframeworkmethods
0
0 comments X
read the original abstract

Diffusion models have led to significant advancements in generative modelling. Yet their widespread adoption poses challenges regarding data attribution and interpretability. In this paper, we aim to help address such challenges in diffusion models by developing an influence functions framework. Influence function-based data attribution methods approximate how a model's output would have changed if some training data were removed. In supervised learning, this is usually used for predicting how the loss on a particular example would change. For diffusion models, we focus on predicting the change in the probability of generating a particular example via several proxy measurements. We show how to formulate influence functions for such quantities and how previously proposed methods can be interpreted as particular design choices in our framework. To ensure scalability of the Hessian computations in influence functions, we systematically develop K-FAC approximations based on generalised Gauss-Newton matrices specifically tailored to diffusion models. We recast previously proposed methods as specific design choices in our framework and show that our recommended method outperforms previous data attribution approaches on common evaluations, such as the Linear Data-modelling Score (LDS) or retraining without top influences, without the need for method-specific hyperparameter tuning.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 3 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. On the Fragility of Data Attribution When Learning Is Distributed

    cs.LG 2026-05 unverdicted novelty 6.0

    A single adversary in distributed training inflates its attribution value via latent optimization on synthetic batches without degrading accuracy or triggering basic defenses.

  2. DMin: Scalable Training Data Influence Estimation for Diffusion Models

    cs.CV 2024-12 unverdicted novelty 6.0

    DMin uses gradient compression to scalably estimate training data influence in billion-parameter diffusion models.

  3. The Amazing Stability of Flow Matching

    cs.CV 2026-04 unverdicted novelty 5.0

    Flow matching generative models preserve sample quality, diversity, and latent representations despite pruning 50% of the CelebA-HQ dataset or altering architecture and training configurations.