Summary
The paper performs a theoretical analysis of recursive training loops in language model training, i.e., where synthetic data generated by language models contaminates the data used for training future iterations of language models. Prior work has found that this phenomenon leads to "model collapse," where models' outputs become very limited as the amount of synthetic data in the training set increases. This paper builds on one of these works (Shumailov et. al. 2023), particularly exploring the setting of models for next token prediction. They conclude that theoretically, model collapse should consistently occur in the fully synthetic scenario. In the partially synthetic scenario, an upper bound on the proportion of synthetically generated data in the training set is identified to mitigate model collapse. The authors confirm these results using experiments with toy models.
Reasons to accept
* The topic of the paper is very relevant, since the amount of model generated data on the web has drastically increased in recent years. Previous studies have explored this phenomenon empirically, but few have provided theoretical insights, which are important when deciding how to build the next generation of of language models.
* The derivations seem sound, although there is a chance that I missed an error in one or more of the proofs.
* There is a comprehensive discussion of related work, giving a nice overview of the recent study of model collapse
* The authors generally provide good intuition for the mathematical results
Reasons to reject
* The presentation could generally use some work. The paper is dense and hard to follow. For example, in the setup in 2.1, there’s switching between terms, e.g., x_l and e_j which are multiplied in the final linear layer, and N and M for number of training samples. I can’t follow the reasoning for the use of these multiple terms, and they make section 2.1 hard to understand.
* The theoretical analysis is only for a single context. It’s unclear which conclusions would change when considering the large number of possible contexts. While the authors point this shortcoming out, the absence of such an analysis makes the paper much weaker, in my opinion, since this is the main contribution.
* Experimental results are only for toy settings, although it would be difficult to perform experiments on realistically-sized language models with realistically-sized datasets
* The contributions above Shumailov et. al. 2023 are arguably limited
Questions to authors
* When commenting on the issue that it “is impossible that the learned model captures all the information about the original distribution”, is the issue that results from this related to the capacity of the model being trained, or to the data generated from previous models?
* By canonical vectors, do you mean canonical basis vectors? They’re called one hot embeddings elsewhere, and it may be more clear to stick to one term.
* After some thought, I can see why all models p^{(m)} are unbiased, but I think it would be best to explain this more explicitly to the reader