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.
A tutorial on UA Vs for wireless networks: Applications, challenges, and open problems.IEEE Communications Surveys & Tutorials, 21(3):2334–2360, 2019
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
background 1
citation-polarity summary
fields
cs.LG 1years
2026 1verdicts
UNVERDICTED 1roles
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.