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.
J., Mohamed, S., and Lakshminarayanan, B
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
citation-role summary
background 1
citation-polarity summary
fields
cs.LG 2years
2026 2roles
background 1polarities
background 1representative citing papers
citing papers explorer
-
Ergodic Trajectory Design by Learned Pushforward Maps: Provable Coverage via Conditional Flow Matching
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.
- Understanding Self-Supervised Learning via Latent Distribution Matching