The core generative-modeling problem
On this page 4 headings
Given samples from an unknown , our goal is to learn a mechanism that produces samples with a distribution close to . The example’s setup assumes a parameterized model distribution , defines a discrepancy , and optimizes the model parameters to reduce it.
Here argmin returns parameter choices, not the smallest divergence value itself. We should not assume the optimum is reached or that training always succeeds.
Gaussian noise and the generator
A common starting point is : a standard multivariate Gaussian with zero mean vector and identity covariance. The neural generator maps latent noise to a synthetic sample:
The probability distribution of is induced by the random input z and the mapping . It is written . Sampling means drawing a fresh z and passing it through the trained generator.
What changes when the generator changes?
Let and .
Then : changing shifts the generated distribution without changing the noise source.
If the target were , choosing would match this simplified target exactly. Real neural generators are far more complicated.
Turning latent randomness into data
Let Z take values and , each with probability , and define . If , the generator outputs 1 or 5, each with probability . Thus is a distribution over . If changes to 4, the possible outputs become 2 and 6. This tiny example shows how a fixed source of randomness plus a parameterized mapping induces a model distribution.
Check yourself
If and with equal probabilities, what does the model generate when ?
Show solution
9 and 11, each with probability .
