Hugging Face Trending Papers

Difficulty Calibration Across Time for Membership Inference in Diffusion Models

The paper introduces techniques to improve membership inference attacks on diffusion models by accounting for image reconstruction difficulty. It proposes Reference-Model Calibration (RMC), which compares a fine‑tuned model’s loss to an earlier checkpoint to isolate newly memorized data, and Temporal Self‑Calibration (TSC), which uses a single model’s loss across diffusion timesteps to adjust for inherent image difficulty. Both methods outperform existing attacks and generalize across various model parameterizations.

arXiv Machine Learning
Oct 9

Early Signatures of Memorization in Diffusion Models via Basin Geometry and Cyclic Denoising

The paper demonstrates that diffusion models encode memorization in the geometry of their learned energy landscape before it becomes visible in generated samples. By analyzing score divergence and basin volume, the authors show that localized basins form around training images early in training, and that cyclic denoising can recover these images even when one‑shot generation shows no copies. Experiments on Gaussian mixtures, CelebA, CIFAR‑10, and Stable Diffusion v1.4 confirm that basin geometry reveals memorization across various settings.

By Nikhil Verma, Siddharthan Dileep, Anoop Singh, Srikanth Sastry, Ramya Hebbalaguppe, Sayan Ranu, N. M. Anoop Krishnan
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 Machine Learning
Oct 9

Beyond Sample Copying: Structural Memorization in Diffusion Models

The paper investigates why diffusion models, despite their practical success, can fully memorize training data when optimal. It shows that as training proceeds, the denoising objective causes overfitting at intermediate noise levels, creating a gap between validation and training performance. In a 2D toy model, this gap arises from the interplay between model error and the data distribution’s support density, leading to a smooth, generalizing flow field rather than exact recall of training points. The study also reveals that predictions from intermediate inference states become increasingly similar to training data in feature space, even as overall similarity to validation data remains unchanged.

By Tim Kaiser, Markus Kollmann
arXiv Machine Learning
3d ago

Information-Theoretic Scaling Laws for Generative Diffusion Training

The paper introduces an information-theoretic measure called model information to quantify how much a diffusion model’s outputs depend on its specific training dataset. By analyzing how this measure scales with model size and dataset size, the authors identify two distinct regimes: a nonlinear regime where memorization transitions to imperfect generalization, and a linear regime where generalization improves and sample quality rises. They propose a scaling law that captures these regimes and demonstrate that it can predict memorization and sample quality beyond the fitted data range.

By Druv Pai, Dejan Stancevic, Yi Ma, Luca Ambrogioni
arXiv AI
Oct 15

Correction Training for Diffusion Models

arXiv:2610.14136v2 Announce Type: new Abstract: Iterative sampling in diffusion models can lead to error accumulation due to exposure bias. The denoiser is trained on real images interpolated with no...

By Donghoon Ahn, Runqian Wang, Alexei A. Efros, Taesung Park, Yash Belhe
arXiv Machine Learning
Oct 3

The Null Is the Hard Part: Exact Tests for Memorization in Generative Models

The paper critiques current memorization audits for generative models, arguing that lacking a proper null distribution leads to misleading conclusions. It introduces two exact null tests—one permutation test for whole models and a calibrated test for single images—showing that many previously flagged memorizations disappear under these stricter controls. The authors also propose a scale‑restricted statistic based on the Intersection Euler Characteristic Profile to better detect distinct copied images.

By Sushovan Majhi, Pramita Bagchi