What We Don't C: Manifold Disentanglement for Structured Discovery
Not on the map. Why?
Abstract (arXiv)
Accessing information in learned representations is critical for annotation, discovery, and data filtering in disciplines where high-dimensional datasets are common. We introduce What We Don't C, a novel approach based on latent flow matching that disentangles latent subspaces by explicitly removing information included in conditional guidance, resulting in meaningful residual representations. This allows factors of variation which have not already been captured in conditioning to become more readily available. We show how guidance in the flow path necessarily represses the information from the guiding, conditioning variables. Our results highlight this approach as a simple yet powerful mechanism for analyzing, controlling, and repurposing latent representations, providing a pathway toward using generative models to explore what we don't capture, consider, or catalog.
Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 39 of its 64 references that are in the map. First posted on arXiv 12 Nov 2025.
Builds on
39 of 64 references.
References · 39
- 2015U-Net: Convolutional Networks for Biomedical Image Segmentationcited by 19,604
- 2020A Simple Framework for Contrastive Learning of Visual Representationscited by 11,979
- 2023DINOv2: Learning Robust Visual Features without Supervisioncited by 7,764
- 2021Masked Autoencoders Are Scalable Vision Learnerscited by 7,339
- 2022Classifier-Free Diffusion Guidancecited by 5,717
- 2022Flow Matching for Generative Modelingcited by 5,426
- 2020Bootstrap your own latent: A new approach to self-supervised Learningcited by 4,712
- 2024Scaling Rectified Flow Transformers for High-Resolution Image Synthesiscited by 4,094
- 2018UMAP: Uniform Manifold Approximation and Projection for Dimension Reductioncited by 2,841
- 2017FiLM: Visual Reasoning with a General Conditioning Layercited by 2,286
- 2020ColBERT: Efficient and Effective Passage Search via Contextualized Late Interaction over BERTcited by 1,160
- 2023Self-Supervised Learning from Images with a Joint-Embedding Predictive Architecturecited by 982
27 more
- 2018Challenging Common Assumptions in the Unsupervised Learning of Disentangled Representationscited by 929
- 2023Improving and generalizing flow-based generative models with minibatch optimal transportcited by 835
- 2019Self-labelling via simultaneous clustering and representation learningcited by 525
- 2014Semi-Supervised Learning with Deep Generative Modelscited by 494
- 2022A Continuous Time Framework for Discrete Denoising Modelscited by 437
- 2023Emergent Correspondence from Image Diffusioncited by 437
- 2023Voicebox: Text-Guided Multilingual Universal Speech Generation at Scalecited by 373
- 2018Understanding disentangling in β-VAEcited by 332
- 2018Variational Autoencoders for Collaborative Filteringcited by 308
- 2024Discrete Flow Matchingcited by 301
- 2023Flow Matching on General Geometriescited by 260
- 2017Variational Inference of Disentangled Latent Concepts from Unlabeled Observationscited by 240
- 2022ADBench: Anomaly Detection Benchmarkcited by 230
- 2025LeJEPA: Provable and Scalable Self-Supervised Learning Without the Heuristicscited by 227
- 2023Diffusion Hyperfeatures: Searching Through Time and Space for Semantic Correspondencecited by 211
- 2023Flow Matching in Latent Spacecited by 155
- 2015Deep Convolutional Inverse Graphics Networkcited by 121
- 2023Guided Flows for Generative Modeling and Decision Makingcited by 99
- 2022Deep Clustering: A Comprehensive Surveycited by 78
- 2017Learning Disentangled Representations with Semi-Supervised Deep Generative Modelscited by 72
- 2022Efficient Video Prediction via Sparsely Conditioned Flow Matchingcited by 54
- 2024Diffusion Models and Representation Learning: A Surveycited by 53
- 2025An Introduction to Flow Matching and Diffusion Modelscited by 33
- 2024LLMs are Also Effective Embedding Models: An In-depth Overviewcited by 32
- 2019Learning Discrete and Continuous Factors of Data via Alternating Disentanglementcited by 23
- 2014Discovering Hidden Factors of Variation in Deep Networkscited by 21
- 2023Flow Factorized Representation Learningcited by 11
Built on by
Not cited yet.
Similar, not cited
Close in wording, no citation either way
- 2026Disentangled Representation Learning via Flow Matching
- 2024Disentangling Disentangled Representations: Towards Improved Latent Units via Diffusion Models
- 2026Structured Coupling for Flow Matching
- 2026Generative Modeling of Discrete Data Using Geometric Latent Subspaces
- 2025Sculpting Latent Spaces With MMD: Disentanglement With Programmable Priors
- 2026RiT: Vanilla Diffusion Transformers Suffice in Representation Space
- 2025Coupled Flow Matching
- 2024Isometric Representation Learning for Disentangled Latent Space of Diffusion Models