Feature Selective Model Collapse in Diffusion Models: Total Replacement versus Fixed-Budget Training

cs.LG cs.AI math.ST stat.TH Hanna Malet, Gabriel Turinici · Oct 1, 2026
Local to this browser
What it does
This paper studies model collapse in diffusion models under a fixed-budget data regime, where synthetic data accumulates but each generation trains on a constant-size subsample from the growing pool. Unlike prior work on total replacement...
Why it matters
Unlike prior work on total replacement (rapid collapse) or unbounded accumulation (collapse avoided), the authors argue that fixed budgets yield partial, feature-selective collapse: "fragile" features with large eigenvalues in a linearized...
Main concern
The paper makes a conceptually useful distinction between total-replacement and fixed-budget recursive training, backed by a clean linear-response theory and small-scale experiments. The per-feature halving-time analysis is elegant...
Community signal
0
0 up · 0 down
Sign in to vote with arrows
AI Review AI reviewed
Plain-language introduction

This paper studies model collapse in diffusion models under a fixed-budget data regime, where synthetic data accumulates but each generation trains on a constant-size subsample from the growing pool. Unlike prior work on total replacement (rapid collapse) or unbounded accumulation (collapse avoided), the authors argue that fixed budgets yield partial, feature-selective collapse: "fragile" features with large eigenvalues in a linearized parameter dynamics model decay quickly, while "robust" features with small eigenvalues persist for exponentially many generations. They support this with theory (stochastic recursion giving per-feature halving times) and experiments on 2D spirals, MNIST, Fashion-MNIST, and CIFAR-10.

Critical review
Verdict
Bottom line

The paper makes a conceptually useful distinction between total-replacement and fixed-budget recursive training, backed by a clean linear-response theory and small-scale experiments. The per-feature halving-time analysis is elegant andnovel. However, the theory relies on strong assumptions (fixed symmetric Jacobian, exact parameter-to-dataset correspondence, i.i.d. re-initialization) that real diffusion training only approximately satisfies, and the empirical validation of the "feature" abstraction is limited by tiny models and unconditional sampling. Accept with reservations: the conceptual contribution is solid, but claims about semantic feature selectivity are more interpretive than established.

“Our theory is a first-order, NTK-style linear response resting on assumptions that real recursive training meets only approximately, and the identification of the eigenvectors of M with semantic attributes is an interpretation rather than a consequence of the model.”
Malet and Turinici, Sec. 7 · Section 7
What holds up

The sharp theoretical separation between protocols is compelling. Under total replacement ("last generation"), Theorem 4.1 shows parameters converge to a non-degenerate stationary distribution with halving time $h_{1/2}^{\text{last gen}} = \lceil \log 2 / (-\log|1-\lambda|) \rceil$, while under fixed budget, Theorem 4.2 gives $h_{1/2}^{\text{fixed budget}} = e^{-\gamma} 2^{1/\lambda}(1+O(\lambda))$, which for small $\lambda$ is astronomically larger. This correctly predicts that some features survive far longer under fixed budgets. The positioning relative to Shumailov et al. (replacement) and Gerstgrasser et al. (unbounded accumulation) is accurate and nuanced. The paper honestly acknowledges limitations and makes code available.

“$h_{1/2}^{\text{last gen}}=\left\lceil\frac{\log 2}{-\log|1-\lambda|}\right\rceil$”
Malet and Turinici, Theorem 4.1 · Theorem 4.1
“$h_{1/2}^{\text{fixed budget}}=e^{-\gamma}2^{1/\lambda}(1+O(\lambda))$”
Malet and Turinici, Theorem 4.2 · Theorem 4.2
Main concerns

Several important concerns limit the impact of this work. First, the linear-response model assumes an exact one-to-one map between datasets and parameters (Eq. 1), linear interpolation for data mixtures (Eq. 6), and a fixed symmetric contraction matrix $M$ with spectrum in $(0,1)$; the paper admits these are only "crude first-order" approximations. Second, the theory predicts that under fixed budget, target parameters $T_n \to 0$ pointwise (asymptotic total collapse), yet the paper sells this as "partial" collapse. The practical distinction is valid due to exponentially long halving times, but the framing conflates transient behavior with asymptotic guarantees. Third, the mapping from abstract eigenvectors of $M$ to visible semantic features (e.g., digit shapes, clothing structure, scene texture) is asserted but not rigorously demonstrated—it is, as the authors note, "an interpretation rather than a consequence." Fourth, the models are very small ($\sim$150K parameters for MNIST/Fashion-MNIST, base width $D=8$ for CIFAR-10), trained unconditionally from scratch over 100 generations, which is far removed from realistic large-model or finetuning settings where pretrained weights dominate parameter dynamics.

“for any dataset of interest $\mathcal{D}$ there exists an unique (but unknown) parameter $S\in\mathbb{R}^{d}$ such that $\mathcal{D}=\mathcal{S}_{S}$”
Malet and Turinici, Sec. 3 · Section 3, Eq. 1
“the identification of the eigenvectors of $M$ with semantic attributes is an interpretation rather than a consequence of the model.”
Malet and Turinici, Sec. 7 · Section 7
“base width: $D=8$”
Malet and Turinici, Sec. I.4 · Appendix I.4
Evidence and comparison

The comparison to prior work is fair and well-documented. The authors correctly identify that Gerstgrasser et al.'s protection relies on growing training sets (vanishing synthetic noise share), which the fixed-budget protocol removes. The experiments do show faster degradation under replacement than under fixed budget, consistent with predictions. However, the metrics (FID, pixel-FID, $\mathcal{W}_2$) rise under both protocols; the qualitative claim that fixed budget "spares some features" rests on visual inspection of generated samples in Figure 1, which could benefit from controlled feature-level ablation or attribution. There is no explicit decomposition of FID into "fragile" vs "robust" components to validate the per-feature theory empirically. The paper also omits comparison to the accumulate-subsample experiments of Kazdan et al. and Shi et al. at the metric level, making it harder to assess incremental empirical contribution.

“the fixed training-set size removes the vanishing-noise-share weighting on which the protective effect of accumulation relies”
Malet and Turinici, Sec. 1 · Section 1
“For the 'last generation' protocol all features are lost leading to an almost white noise random generation, while for the 'fixed budget' protocol some features are lost but some are kept”
Malet and Turinici, Fig. 1 caption · Figure 1
Reproducibility

The authors provide a GitHub repository and detailed architectural hyperparameters in Appendices F–I, including layer counts, channel widths, learning rates, EMA decay ($0.8$), and DDIM steps. This is commendable. However, exact reproduction may be hindered by unspecified random seeds, the exact subsampling procedure from the accumulated pool, and potential nondeterminism in the discrete optimal-transport solver used for the 2D spiral $\mathcal{W}_2$ metric. The small model sizes make the experiments computationally reproducible, but the gap between these toy-scale diffusion models and production systems means reproducing the phenomenon at scale would require significant additional engineering not guided by this paper.

“The results can be reproduced using the github available at https://github.com/gabriel-turinici/model_collapse_features”
Malet and Turinici, Sec. 6 · Section 6
“Training epochs: 2000... Optimiser: Adam... Learning rate: $10^{-3}$”
Malet and Turinici, Appendix G.7 · Appendix G.7
Abstract

Model collapse arises when generative models are trained on synthetic data produced by earlier models. The phenomenon has attracted considerable attention because of its societal and technical implications. However, previous studies have reached seemingly contradictory conclusions: replacing real data with synthetic data causes collapse (Shumailov et al.), yet accumulating real data alongside synthetic data can prevent it. For diffusion models, we study an intermediate regime typical of finite-budget pipelines: all past datasets and the real data are kept, but each new model is trained on a fixed-size sample from this growing pool, so the real fraction vanishes without any data being removed. Experiments on a 2D spiral dataset as well as the image benchmarks (MNIST, Fashion-MNIST, and CIFAR-10) show that replacement protocol degrades dataset rapidly as in the literature, whereas the fixed budget degrades only partially, sparing some features. A linear-response model of the multi-generational parameter dynamics, analyzed by stochastic recursion, confirms that the two protocols differ: some features will be fragile and lost within a few generations for both protocols, while some will be robust and preserved over practically unbounded horizons under the fixed budget protocol.

Challenge the Review

Pick a starting point or write your own. Challenges run in the background, so you can keep reading while the AI investigates.

No challenges yet. Disagree with the review? Ask the AI to revisit a specific claim.