At the heart of generative modeling lies the objective of capturing the underlying structure and probability distribution of a given dataset. Imagine you have a collection of images, say, handwritten digits. A generative model aims to understand how these digits are formed, not just classify them. More formally, if we represent our data points (images, audio signals, text sequences) as $x$ , the goal is to learn or approximate the true data distribution, often denoted as $p_{data}(x)$ . This function tells us the probability (or probability density for continuous data) of observing any particular data point $x$ .

Why is learning $p_{data}(x)$ useful?

Generation (Sampling): If we have a good model of $p_{data}(x)$ , we can draw new samples from it. This means generating novel images, music, or text that resemble the data the model was trained on. This is the core task of synthetic data generation.
Density Estimation: The model can assign a probability (or likelihood) to any given point $x$ , indicating how typical or anomalous it is according to the learned distribution. This is valuable for tasks like anomaly detection.
Representation Learning: In the process of learning $p_{data}(x)$ , the model often learns meaningful, compressed representations (features) of the data, which can be useful for downstream tasks.

However, $p_{data}(x)$ is almost always unknown and incredibly complex, especially for high-dimensional data like natural images. A 256x256 pixel color image resides in a space with $256 \times 256 \times 3 = 196,608$ dimensions. Directly modeling the probability distribution in such a high-dimensional space is computationally challenging and requires vast amounts of data.

Therefore, instead of finding $p_{data}(x)$ exactly, we use a model distribution, $p_{model}(\theta; x)$ , which is defined by a set of learnable parameters $\theta$ . These parameters are typically the weights and biases of a deep neural network. The core task of training a generative model is to adjust $\theta$ such that $p_{model}(\theta; x)$ becomes as close as possible to the true (but unknown) $p_{data}(x)$ .

Diagram illustrating the relationship between the true data distribution ( $p_{data}$ ), observed data samples, the generative model's distribution ( $p_{model}$ ), its parameters ( $\theta$ ), and the generated samples. The training process aims to adjust $\theta$ so that $p_{model}$ closely approximates $p_{data}$ .

How do we measure the "closeness" between $p_{model}$ and $p_{data}$ and optimize $\theta$ ? Different families of generative models employ different strategies:

Explicit Density Models: These models define an explicit mathematical formula for $p_{model}(\theta; x)$ and often use Maximum Likelihood Estimation (MLE) for training. The goal is to find parameters $\theta$ that maximize the (log) probability of observing the training data: $\theta^* = \arg \max_\theta \sum_{i=1}^N \log p_{model}(\theta; x^{(i)})$ where $x^{(i)}$ are the data points in the training set. While theoretically appealing, calculating or optimizing this likelihood can be intractable for many flexible models (like deep neural networks) due to complex dependencies or normalization constants. Techniques like Variational Autoencoders (VAEs), Flow-based Models, and Autoregressive Models fall under this umbrella, each using different methods to make the likelihood tractable or approximate it. Diffusion models, as we will see, also often connect to likelihood estimation, although their training objective might be formulated differently (e.g., score matching or denoising objectives).
Implicit Density Models: These models do not define an explicit $p_{model}(\theta; x)$ . Instead, they provide a mechanism to sample from the distribution they implicitly represent. Generative Adversarial Networks (GANs) are the prime example. A GAN's generator network $G$ learns a transformation from a simple prior distribution $p_z(z)$ (e.g., Gaussian noise) to the complex data distribution. It learns to produce samples $G(z)$ that are indistinguishable from real data $x \sim p_{data}(x)$ , guided by the discriminator $D$ . The min-max objective function you saw earlier drives this process, implicitly shaping the distribution of $G(z)$ to match $p_{data}(x)$ without ever needing to write down or compute the probability density of a generated sample.

Understanding this probabilistic foundation is essential. Whether explicitly maximizing likelihood or implicitly matching distributions through an adversarial game, the fundamental goal remains the same: to create a model capable of generating data that faithfully reflects the characteristics and variations present in the original dataset. As we progress, we will see how GANs and Diffusion Models leverage these probabilistic principles in distinct and powerful ways to achieve state-of-the-art results in synthetic data generation.

Was this section helpful?