InfoVAE addresses the aggregated posterior mismatch problem in standard VAEs by modifying the objective function to explicitly match the aggregated posterior with the prior distribution.
Key Ideas
- If the aggregated posterior $q_\phi(z)$ becomes a Dirac delta, all inputs $x$ map to the same latent code $z$
- In such a scenario, the latent code $z$ would contain no information about the input $x$
- The standard VAE objective does not directly encourage the matching between $q_\phi(z)$ and the prior $p(z)$
InfoVAE Objective Function
The standard VAE objective is given by:
This can also be written as(derivation skipped):
Here $p_\theta(x|z)$ is inverted encoder distribution. The first term means that $q_\phi(z)$ should match $p(z)$. The second term means that $q_\phi(x|z)$ should match $p_\theta(x|z)$.
Incorporating Mutual Information
To further enhance information retention, the InfoVAE objective incorporates a mutual information term:
Terms Breakdown:
- $I_q(x;z)$: Mutual information between input $x$ and latent code $z$, encouraging $z$ to retain meaningful information about $x$. The mutual information $I_q(x;z)$ is defined as:
$$ I_q(x;z) = \sum_x \sum_z p_\theta(x,z) \log \frac{p_\theta(x,z)}{p_\theta(x)p_\theta(z)} $$
- $\alpha$: Coefficient controlling the importance of the mutual information term
InfoVAE addresses the aggregated posterior mismatch problem by:
- Explicitly minimizing the KL divergence between the aggregated posterior $q_\phi(z)$ and the prior $p_\theta(z)$
- Preserving mutual information between the input $x$ and the latent code $z$
Training InfoVAE
Because optimizing the mutual information term is difficult, we optimize the following objective instead(derivation skipped however it is in paper):