An analytic uniform ergodic latent trajectory is pushed forward by a conditional flow matching map to produce asymptotically ergodic trajectories matching any target density with provable coverage bounds.
Convergence of continuous normalizing flows for learning probability distributions
5 Pith papers cite this work. Polarity classification is still indexing.
citation-role summary
citation-polarity summary
years
2026 5verdicts
UNVERDICTED 5roles
background 1polarities
background 1representative citing papers
Panel Flow Matching is a generative method to estimate panel densities from longitudinal data with statistical guarantees under irregular sampling, supporting completion, synthetic data, and classification.
Sharp Lipschitz regularity for flow-matching vector fields and diffusion scores, with optimal time/dimension dependence, gives √d/N Wasserstein discretization error for Euler samplers and globally Lipschitz Gaussian-to-target transport maps implying Poincaré and log-Sobolev inequalities.
dFlowGRPO is a new rate-aware RL method for discrete flow models that outperforms prior GRPO approaches on image generation and matches continuous flow models while supporting broad probability paths.
RepFlow combines representation learning and conditional flow matching to estimate both point and distributional causal effects while mitigating selection bias via entropically regularized Wasserstein distance on normalized latent representations.
citing papers explorer
-
Lipschitz regularity in Flow Matching and Diffusion Models: sharp sampling rates and functional inequalities
Sharp Lipschitz regularity for flow-matching vector fields and diffusion scores, with optimal time/dimension dependence, gives √d/N Wasserstein discretization error for Euler samplers and globally Lipschitz Gaussian-to-target transport maps implying Poincaré and log-Sobolev inequalities.