Compositional Generalization via Forced Rendering of Disentangled Latents
Not on the map. Why?
Abstract (arXiv)
Composition-the ability to generate myriad variations from finite means-is believed to underlie powerful generalization. However, compositional generalization remains a key challenge for deep learning. A widely held assumption is that learning disentangled (factorized) representations naturally supports this kind of extrapolation. Yet, empirical results are mixed, with many generative models failing to recognize and compose factors to generate out-of-distribution (OOD) samples. In this work, we investigate a controlled 2D Gaussian "bump" generation task with fully disentangled (x,y) inputs, demonstrating that standard generative architectures still fail in OOD regions when training with partial data, by re-entangling latent representations in subsequent layers. By examining the model's learned kernels and manifold geometry, we show that this failure reflects a "memorization" strategy for generation via data superposition rather than via composition of the true factorized features. We show that when models are forced-through architectural modifications with regularization or curated training data-to render the disentangled latents into the full-dimensional representational (pixel) space, they can be highly data-efficient and effective at composing in OOD regions. These findings underscore that disentangled latents in an abstract representation are insufficient and show that if models can represent disentangled factors directly in the output representational space, it can achieve robust compositional generalization.
Key facts. Cited by 4 papers in the map (data through 7 Oct 2026). Builds on 14 of its 27 references that are in the map. First posted on arXiv 30 Jan 2025.
Builds on
14 of 27 references.
References · 14
- 2015Domain-Adversarial Training of Neural Networkscited by 3,023
- 2018Challenging Common Assumptions in the Unsupervised Learning of Disentangled Representationscited by 929
- 2018Disentangling by Factorisingcited by 614
- 2024An analytic theory of creativity in convolutional diffusion modelscited by 103
- 2023Compositional Abilities Emerge Multiplicatively: Exploring Diffusion Models on a Synthetic Taskcited by 91
- 2018Bias and Generalization in Deep Generative Models: An Empirical Studycited by 83
- 2023Compositional Generalization from First Principlescited by 62
- 2022Compositional Generalization in Unsupervised Compositional Representation Learning: A Study on Disentanglement and Emergent Languagecited by 42
- 2024The Complexity Dynamics of Grokkingcited by 21
- 2024When does compositional structure yield compositional generalization? A kernel theorycited by 19
- 2024How Diffusion Models Learn to Factorize and Composecited by 13
- 2023Vector-based Representation is the Key: A Study on Disentanglement and Compositional Generalizationcited by 6
Built on by
Citing papers per year: 2025: 2; 2026: 2.
4 papers.
- 2025A mathematical theory for understanding when abstract representations emerge in neural networkscited by 3
- 2026Learning Compositional Latent Structure with Vector Networkscited by 1
- 2025Modular connectivity in neural networks emerges from Poisson noise-motivated regularisation, and promotes robustness and compositional generalisationcited by 0
- 2026Seeing Through the PRISM: Compound & Controllable Restoration of Scientific Imagescited by 0
- 2026Learning Compositional Latent Structure with Vector Networks27 May 2026
- 2026Seeing Through the PRISM: Compound & Controllable Restoration of Scientific Images14 Mar 2026
- 2025Modular connectivity in neural networks emerges from Poisson noise-motivated regularisation, and promotes robustness and compositional generalisation5 Dec 2025
- 2025A mathematical theory for understanding when abstract representations emerge in neural networks10 Oct 2025