arxiv
PublishedOctober 22, 2026 at 4:00 AM
Minimax-Optimal Predictive Flow Matching under Distribution Drift
Publisher summary· verbatim
arXiv:2610.28898v1 Announce Type: new Abstract: 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 ag
Stay posted· Newsletter
Three short emails a week: Monday, Wednesday and Friday. Top movers, new models and the most-referenced story.
Your email is used only to send The Bubble Brief. Privacy policy
Discussion
No replies yet. Be first.
Related coverage
More from ARXIV
arxivOne Policy, Many Styles: Where to Aggregate Preferences for Steerable Humanoid Control?1harxivHyperDrone: Simulation-to-Reality Transfer at Millions of Frames per Second1harxivCan Quantum Layers offer Performance and Security Advantages in Vision-Language Models?1harxivIs In-Context Reinforcement Learning A Posterior Sampler? An Empirical Study1hThe Bubble Brief
MON · WED · FRIRead AI insights every Monday, Wednesday and Friday — top movers, new models, story of the week.
Your email is used only to send The Bubble Brief. Privacy policy
Originally published on arxiv ↗