Minimax-Optimal Predictive Flow Matching under Distribution Drift
Flow matching learns a generative velocity field by regression, but under distribution drift a field must be deployed before the current data arrive. We study this predictive problem for a fixed, possibly nonconvex, neural class, with dynamic regret against the best represented field of each round.
By Aadithya Srikanth, Vaneet AggarwalarXiv cs.LG
Read the full story
Originally published by arXiv cs.LG on Oct 22, 2026.
Comments
Sign in to join the discussion.