What Time Is It? How Data Geometry Makes Time Conditioning Optional for Flow Matching
On the map: Diffusion models → Flow matching, time series and science
Abstract (arXiv)
Recent work has shown that models flow matching models can be trained without explicit time conditioning, challenging the standard view that the interpolation time is needed to disambiguate velocity targets. But why should a time-blind model work at all? Decomposing the time-blind flow matching loss, we identify two sources of irreducible error: a coupling variance, which arises from ambiguous velocity targets induced by how noise and data points are paired, and the time-blindness gap, which is the additional error caused by ignoring time. This gap shows that time-blind training is strictly harder than conventional training, reinforcing the puzzle that time-blind models work so well in practice. We resolve this tension by showing that the geometry of high-dimensional data makes time identifiable directly from noisy observations. When data concentrates near a k-dimensional subspace, time can be recovered from the statistical structure of noisy interpolants in directions orthogonal to the data; under a spiked-covariance model, this yields a closed-form estimator that recovers t from a single observation z at rate O(1/√d-k) for ambient dimension d. As a consequence, we prove that the time-blindness gap is asymptotically negligible relative to the coupling variance. We empirically demonstrate our identifiability result on real-world data and show that changing the coupling has a much larger effect on loss and sample quality than removing time conditioning across CIFAR-10, CelebA-HQ, and FFHQ. These results explain why time-blind flow matching works and show that the main practical lever is the choice of coupling, not explicit time conditioning.
Key facts. Cited by 2 papers in the map (data through 14 Oct 2026). Placed in Flow matching, time series and science, one of 14 directions in Diffusion models. Builds on 21 of its 32 references that are in the map. First posted on arXiv 8 May 2026.
Builds on
21 of 32 references.
Closest ancestors · 2
Same direction, newest first
- 2023Improving and generalizing flow-based generative models with minibatch optimal transport1 Feb
- 2022Flow Straight and Fast: Learning to Generate and Transfer Data with Rectified Flow7 Sep
Other references · 19
- 2021High-Resolution Image Synthesis with Latent Diffusion Modelscited by 18,863
- 2021Diffusion Models Beat GANs on Image Synthesiscited by 8,255
- 2018A Style-Based Generator Architecture for Generative Adversarial Networkscited by 6,013
- 2017Progressive Growing of GANs for Improved Quality, Stability, and Variationcited by 2,988
- 2022Building Normalizing Flows with Stochastic Interpolantscited by 995
- 2024SiT: Exploring Flow and Diffusion-based Generative Models with Scalable Interpolant Transformerscited by 737
- 2021The Intrinsic Dimension of Images and Its Impact on Learningcited by 315
- 2019Noise2Self: Blind Denoising by Self-Supervisioncited by 276
- 2018Toward Convolutional Blind Denoising of Real Photographscited by 274
- 2023Score Approximation, Estimation and Distribution Recovery of Diffusion Models on Low-Dimensional Datacited by 174
- 2021Unbalanced minibatch Optimal Transport; applications to Domain Adaptationcited by 125
- 2022Practical Blind Image Denoising via Swin-Conv-UNet and Data Synthesiscited by 86
7 more
- 2022Verifying the Union of Manifolds Hypothesis for Image Datacited by 64
- 2025Is Noise Conditioning Necessary for Denoising Generative Models?cited by 44
- 2024The Unreasonable Effectiveness of Gaussian Score Approximation for Diffusion Models and its Applicationscited by 32
- 2025Equilibrium Matching: Generative Modeling with Implicit Energy-Based Modelscited by 21
- 2026Blind denoising diffusion models and the blessings of dimensionalitycited by 9
- 2014The local low-dimensionality of natural imagescited by 8
- 2026The Geometry of Noise: Why Diffusion Models Don't Need Noise Conditioningcited by 8
Built on by
Citing papers per year: 2026: 2.
2 papers.
- 2026One-Sided Quantile Coupling for Flow Matchingcited by 1
- 2026Does Uniform Discrete Diffusion Need Time?cited by 0
- 2026Does Uniform Discrete Diffusion Need Time?25 Sep 2026
- 2026One-Sided Quantile Coupling for Flow Matching2 Aug 2026
Similar, not cited
Close in wording, no citation either way
- 2026Flow Matching under Noisy Latent Structure: Beyond Exact Low-Dimensional Support
- 2026When do explicit penalties improve flow matching?
- 2026Temporal Pair Consistency for Variance-Reduced Flow Matching
- 2026Beyond the Manifold Hypothesis: Hybrid Spectral Parameterizations for Flow Matching
- 2026Velocity Scaling in Flow Matching
- 2026The Velocity Deficit: Initial Energy Injection for Flow Matching
- 2025Risk-Entropic Flow Matching
- 2024How Do Flow Matching Models Memorize and Generalize in Sample Data Subspaces?