1 citations · 1 across the 12 of their papers we have counts for
5 papers · 1 filter
Beckmann Transport Models: From Autonomous Flows to One-Step Maps
Lee Cheuk-Kit, Florentin Coeurdoux, Yuyuan Chen +5
We propose an instantiation of flow matching that relies on a time-independent velocity field (an \emph{autonomous flow}) to exactly map between two distributions, so long as the t…
Itô maps for any-step SDEs
Zhengkai Pan, Peter Potaptchik, Wenxi Yao +2
Recent one-step generative models accelerate sampling by learning deterministic flow maps of the underlying dynamics. These methods rely on learning from ordinary differential equa…
Discrete Tilt Matching
Yuyuan Chen, Shiyi Wang, Peter Potaptchik +2
Masked diffusion large language models (dLLMs) are a promising alternative to autoregressive generation. While reinforcement learning (RL) methods have recently been adapted to dLL…
Discrete Flow Maps
Peter Potaptchik, Jason Yim, Adhi Saravanan +3
The sequential nature of autoregressive next-token prediction imposes a fundamental speed limit on large language models. While continuous flow models offer a path to parallel gene…
Meta Flow Maps enable scalable reward alignment
Peter Potaptchik, Adhi Saravanan, Abbas Mammadov +3
Controlling generative models is computationally expensive. This is because optimal alignment with a reward function--whether via inference-time steering or fine-tuning--requires e…