222 citations · 961 across the 42 of their papers we have counts for
8 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…
A unified perspective on fine-tuning and sampling with diffusion and flow models
Carles Domingo-Enrich, Yuanqi Du, Michael S. Albergo
We study the problem of training diffusion and flow generative models to sample from target distributions defined by an exponential tilting of a base density; a formulation that su…
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…
Graph Energy Matching: Transport-Aligned Energy-Based Modeling for Graph Generation
Michal Balcerak, Suprosanna Shit, Chinmay Prabhakar +4
Generative modeling of discrete data, such as graphs, underpins many scientific and industrial applications, including molecular discovery and materials design. In these domains, p…
A Monte Carlo estimator of flow fields for sampling and noise problems
Michael S. Albergo, Gurtej Kanwar
Learned field transformations may help address ubiquitous critical slowing down and signal-to-noise problems in lattice field theory. In the context of an annealed sequence of dist…
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…