Latent Space
The compressed space a model thinks in — where similar things sit close together, and where the famous vector arithmetic works better in demos than in practice.
When not to use it
- (It's a concept, not a technique — the question is when to distrust it.)*
- When you're reading latent directions as meaningful. They're entangled. "The smile dimension" is a simplification.
- When you expect a plain autoencoder's latent space to be smooth. It isn't — that's what VAEs are for.
- When the compression loses what you needed. A latent keeps what the training objective valued, which may not be what you value.
Reach for something else instead
- PCA — a linear latent space. Interpretable, deterministic, and much weaker.
- Working in pixel space — exact, and you lose every editing operation that made latents worth it.
- Task-specific embeddings — a latent space trained for your actual job rather than reconstruction.
Sources & further reading
- Bengio, Courville & Vincent (2013), Representation Learning: A Review and New Perspectives — the framing of what a good representation is and why it matters.
- Radford, Metz & Chintala (2015), Unsupervised Representation Learning with Deep Convolutional Generative Adversarial Networks — DCGAN; where latent arithmetic became famous.
- Locatello et al. (2019), Challenging Common Assumptions in the Unsupervised Learning of Disentangled Representations — the impossibility result; disentanglement needs supervision or bias.
Primary sources, listed so you can check the claims on this page rather than take them on trust.
Where people go wrong
- Believing the vector arithmetic story uncritically. The famous results depend on details that get dropped in the retelling.
- Expecting disentangled dimensions. There's a proof that unsupervised disentanglement doesn't come free.
- Assuming any autoencoder's latent space is navigable. Plain autoencoders have holes; VAEs exist to fix that.
- Treating embeddings and latent spaces as different topics. They're the same idea.