English

Linear combinations of latents in generative models: subspaces and beyond

Machine Learning 2025-11-10 v8 Machine Learning

Abstract

Sampling from generative models has become a crucial tool for applications like data synthesis and augmentation. Diffusion, Flow Matching and Continuous Normalising Flows have shown effectiveness across various modalities, and rely on latent variables for generation. For experimental design or creative applications that require more control over the generation process, it has become common to manipulate the latent variable directly. However, existing approaches for performing such manipulations (e.g. interpolation or forming low-dimensional representations) only work well in special cases or are network or data-modality specific. We propose Latent Optimal Linear combinations (LOL) as a general-purpose method to form linear combinations of latent variables that adhere to the assumptions of the generative model. As LOL is easy to implement and naturally addresses the broader task of forming any linear combinations, e.g. the construction of subspaces of the latent space, LOL dramatically simplifies the creation of expressive low-dimensional representations of high-dimensional objects.

Keywords

Cite

@article{arxiv.2408.08558,
  title  = {Linear combinations of latents in generative models: subspaces and beyond},
  author = {Erik Bodin and Alexandru Stere and Dragos D. Margineantu and Carl Henrik Ek and Henry Moss},
  journal= {arXiv preprint arXiv:2408.08558},
  year   = {2025}
}

Comments

Published at International Conference on Learning Representations (ICLR) 2025

R2 v1 2026-06-28T18:14:27.852Z