Memorisation, convergence and generalisation in generative models

TL;DR

This paper analytically investigates how generative models transition from memorising training data to generalising, revealing that convergence and latent factor recovery are distinct objectives with different data requirements.

Contribution

It provides an exact analytical characterization of the memorisation-generalisation transition in linear generative models and extends findings to convolutional denoisers and real data.

Findings

Models memorize at low data load

Convergence occurs when sample size is linear in input dimension

Convergence is insensitive to latent factor recovery

Abstract

Generative neural networks learn how to produce highly realistic images from a large, but finite number of examples - or do they simply memorise their training set? To settle this question, Kadkhodaie, Guth, Simoncelli and Mallat (ICLR '24) trained diffusion models independently on disjoint subsets of a dataset and showed that they converge to nearly the same density when the number of training images is large enough. This result raises two basic questions: how much data do you need for convergence, and what does convergence capture about learning the data distribution? Here, we address these questions by providing an exact analytical characterisation of the transition from memorisation to generalisation in linear generative models. We find that these models memorise at small load, while convergence emerges continuously when the number of samples is linear in the input dimension. Strikingly, we find that convergence is insensitive to recovery of the principal latent factors of the data, which are recovered in a sharp transition. After extending our approach to data with power-law spectra, we find the same distinction between convergence and latent recovery in our experiments with convolutional denoisers and in the data of Kadkhodaie et al. We thus show that generalisation in generative models decomposes into at least two distinct objectives: matching the bulk of the data distribution and recovering the principal latent factors. These objectives correspond to two different distances between true and learnt data distribution, and only the first one is captured by convergence.