arXiv AI

Distilling Diffusion Score Discrepancy for Efficient Training Data Attribution

The paper introduces a new method for training data attribution in diffusion models called TID, which uses a local score discrepancy measure and can be estimated without retraining. It further distills this approach into TIDE, a forward‑only student that reproduces the teacher’s rankings using internal activations, achieving comparable accuracy at dramatically lower query cost. Experiments on CIFAR‑10, ArtBench‑10, and MS‑COCO show that TID outperforms existing methods and TIDE attributes samples in milliseconds, faster than generation itself.

arXiv Machine Learning
Nov 5

Quantifying Error Propagation and Model Collapse in Diffusion Models

The paper investigates how repeatedly training score-based diffusion models on synthetic data can cause their outputs to drift from the target distribution. It provides theoretical upper and lower bounds on the divergence accumulated over successive training rounds, distinguishing regimes based on score estimation error and the fraction of fresh data used. Empirical experiments on synthetic data and images support the theoretical findings.

By Nail B. Khelifa, Richard E. Turner, Ramji Venkataramanan
arXiv Machine Learning
Jun 10

The Emergence of Reproducibility and Generalizability in Diffusion Models

arXiv:2310. 05264v5 Announce Type: replace Abstract: In this work, we investigate an intriguing and prevalent phenomenon of diffusion models which we term as "consistent model reproducibility": given the same starting noise input and a deterministic sampler, different diffusion models often yield remarkably similar outputs.

By Huijie Zhang, Jinfan Zhou, Yifu Lu, Minzhe Guo, Peng Wang, Liyue Shen, Qing Qu
arXiv AI
Oct 15

Training data attribution in diffusion models via mirrored unlearning and noise-consistent skew

The paper introduces MUCS, a method for training data attribution (TDA) in diffusion models that uses mirrored unlearning and noise-consistent skew. By fine-tuning a second model with bounded mirrored gradient ascent and measuring its normalized skew relative to the original model using consistent noise samples, MUCS achieves significantly better performance than existing TDA methods across three datasets. The authors also explore design choices, overlap of influential instances, and the potential of ensembling TDA approaches.

By Joan Serr\`a, Dipam Goswami, Fabio Morreale, Wei-Hsiang Liao, Yuki Mitsufuji
arXiv Computer Vision
Oct 9

Attributing HOW, Not Just WHICH: Counterfactual Response Trajectories for Diffusion Models

The paper introduces CADT, a Concept Attribution method through Dynamic Trajectories, which attributes diffusion model outputs by tracking factor-induced internal response trajectories rather than scalar responses. CADT constructs matched counterfactual pairs at identical noisy states to isolate factor-specific representation displacements and models their directional and magnitude evolution across denoising as dynamic attribution signatures. Experiments on multiple public datasets demonstrate consistent improvements over existing diffusion attribution baselines for hierarchical, compositional, and style attribution tasks.

By Haoqian Zhang, Ziyuan Yang, Zerui Shao, Yi Zhang
arXiv Machine Learning
Oct 2

Visualizing Distribution Coverage in Generative Diffusion Models

The paper introduces pass@k, a metric that evaluates how well generative diffusion models cover their output distribution by measuring the probability that at least one of k independent samples meets a quality criterion. Using this metric, the authors show that while classifier‑free guidance improves single‑draw quality, its advantage diminishes or reverses as k increases, revealing a trade‑off between quality and distribution coverage. They further demonstrate that the choice of training objective in diffusion distillation—whether distribution‑matching or consistency/trajectory‑based—determines whether a few‑step model retains its teacher’s coverage or sacrifices it for higher single‑draw performance, a phenomenon that also appears in few‑step causal video generation.

By Yifei Wang, Xiaoyu Wu, Tsu-Jui Fu, Chen Chen, Liang-Chieh Chen, Zhe Gan, Chen Wei
arXiv Machine Learning
Oct 8

Consistent Distribution Matching for Data-Free Diffusion Distillation

Consistent Distribution Matching is a data‑free distillation technique that accelerates diffusion and flow models by unifying sample generation and score estimation in a single student network. The method requires only a frozen teacher and a trainable student, optimizing a single objective that provably leads to Wasserstein convergence of the student’s flow‑map to the teacher’s marginals. On ImageNet 256×256, it achieves an FID of 2.04 with one function evaluation and 1.37 with four evaluations after just 40 training epochs, outperforming existing data‑free baselines.

By Yuxiang Fu, Qi Yan, Zike Wu, Yongxing Zhang, Purang Abolmaesumi, Lele Wang, Renjie Liao