cd /news/machine-learning/double-descent-and-malign-overfittin… · home topics machine-learning article
[ARTICLE · art-138537] src=arxiv.org ↗ pub= topic=machine-learning verified=true sentiment=· neutral

Double Descent and Malign Overfitting in Diffusion Models

A paper submitted to arXiv on 22 Sep 2026 resolves why diffusion models overfit catastrophically rather than benignly, showing through U-Net experiments on CelebA and a random-features model with closed-form learning curves that with a fixed number m of noise realizations per training sample, an interpolation peak occurs at p~nm rather than p~n, while the test loss begins rising much earlier at p~n independently of m. The authors attribute this "malign overfitting" to a bias-variance mechanism in which the score estimator's bias starts growing at p~n and keeps growing past the peak while variance decays, driving the model toward the empirical score that memorizes the training set. Because diffusion models train with m much greater than 1, the peak is pushed to very large model sizes, leaving models on the rising branch where malign overfitting is already in play; optimally regularized large models via a ridge penalty or early stopping outperform any unregularized models.

read2 min views1 publishedSep 23, 2026
Double Descent and Malign Overfitting in Diffusion Models
Image: source
  [Submitted on 22 Sep 2026]


[View PDF](https://arxiv.org/pdf/2609.26392)

[HTML (experimental)](https://arxiv.org/html/2609.26392v1)

Abstract:Conventional wisdom in deep learning holds that overparameterization---having more parameters $p$ than training samples $n$---is benign: larger models generalize better and, even without regularization, interpolating models generalize well, the test error following a double-descent curve. One might expect the same benign overfitting for diffusion models, whose training reduces to regression, i.e. to minimizing a quadratic score-matching loss. Yet the opposite is observed: overfitting here is catastrophic, driving the model into a memorization regime. We resolve this paradox by combining experiments on U-Nets trained on CelebA with a random-features model for which we derive closed-form learning curves. We show that with a fixed number $m$ of noise realizations per training sample, an interpolation peak does occur, but at $p\sim nm$ rather than at $p\sim n$ as in standard regression. The rise of the test loss, however, sets in much earlier, at $p\sim n$, independently of $m$. This overfitting is malign because, although the implicit regularization of training is fully at work, it drives the model toward the empirical score, which memorizes the training set, rather than toward the true score. A bias-variance decomposition pinpoints the mechanism: the bias of the score estimator starts to grow at $p\sim n$; past the peak the variance decays, as in regression, whereas the bias keeps growing and both saturate at a large value. Since diffusion models are trained with $m\gg1$, the peak is pushed to very large model sizes, and therefore sit on the rising branch that precedes it, where malign overfitting is already in play. Nevertheless, overparameterization remains beneficial when paired with regularization: in the random-features theory and in U-Net experiments, optimally regularized large models---via a ridge penalty or early stopping, respectively---outperform any unregularized models.

Current browse context:

cs.LG

Change to browse by:

References & Citations

...

Bibliographic Explorer

(What is the Explorer?) Connected Papers

(What is Connected Papers?) Litmaps

(What is Litmaps?) scite Smart Citations

(What are Smart Citations?) alphaXiv

(What is alphaXiv?) CatalyzeX Code Finder for Papers

(What is CatalyzeX?) DagsHub

(What is DagsHub?) Gotit.pub

(What is GotitPub?) Hugging Face

(What is Huggingface?) ScienceCast

(What is ScienceCast?) Influence Flower

(What are Influence Flowers?) CORE Recommender

(What is CORE?) IArxiv Recommender

(What is IArxiv?) arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

── more in #machine-learning 4 stories · sorted by recency
── more on @arxiv 3 stories trending now
sponsored brought to you by zahid.host 4,200+ EU-deployed projects
reading about agents? ship yours in a single git push.

Run your AI side-project on zahid.host

EU-based hosting, git-push deploys, automatic HTTPS, no cold starts. Free tier with a custom domain — perfect for shipping the agent you just read about.

$git push zahid main
Live at https://your-agent.zahid.host
Get free account → Pricing
from €0/mo · no card required
LIVE [news/double-descent-and-m…] indexed:0 read:2min 2026-09-23 ·