Generative Modeling by Value-Driven Transport
AuthorsPablo Moreno-Muñoz, Adrian Müller, Gergely Neu
Resources
This paper turns generative modeling into a control problem and uses value functions to learn fast, straight transport paths for sampling data efficiently.
Key results
On the moons-to-8-Gaussians 2D benchmark, 1-step VDT+ generation had Wasserstein-2 distance 1.365 to the target.
On the same moons-to-8-Gaussians benchmark, 10-step VDT+ generation reduced Wasserstein-2 distance to 0.626, close to the 100-step result.
The paper reports that using Htest = 10 at test time instead of the training horizon H = 100 gives a tenfold speedup with nearly identical sample quality.
What the paper found
Generative Modeling by Value-Driven Transport reframes sample generation as a discrete-time stochastic control problem for Wasserstein-2 optimal transport, then solves the resulting constrained linear program with a primal-dual algorithm that learns a scalar value function rather than a transport policy directly. The key novelty is the value-driven transport (VDT) policy, π_h(x)=x-(H+1)^{-1}∇V_h(x), which is derived from the LP dual and provably recovers the optimal straight-line interpolation paths of dynamic OT; the final-time dual variable also acts as a discriminator enforcing the target distribution. Training is simulation-free: each minibatch is initialized with an approximate coupling, particle clouds are refined by Wasserstein gradient descent, and a single neural network parameterizes the value function, using no learned trajectory simulator. On 2D benchmarks including two moons, s-curve, 8 Gaussians, and moons-to-8-Gaussians, OT-initialized VDT matched or approached state-of-the-art flow and Schrödinger bridge baselines, with 10-step generation essentially matching 100-step generation; for example, on moons-to-8-Gaussians it reduced Wasserstein-2 error from 1.365 to 0.626 when moving from 1 to 10 steps, while preserving path energy near the oracle. On MNIST, the same framework handled paired deblurring, unpaired EMNIST-to-MNIST translation, reverse generation, and classifier-free guidance, showing that OT-style straight-path geometry can support conditional and bidirectional generation within one unified control-based model.
Original abstract
We propose a new framework for generative modeling based on a discrete-time stochastic control formulation of measure transport. Adapting classic results from control theory, we formulate our problem as a linear program whose dual variables correspond to the \emph{optimal value function} of the control problem, which directly encodes the optimal control policy. Exploiting this LP formulation, we develop an efficient simulation-free primal-dual algorithm for computing approximately optimal value functions and the associated \emph{value-driven transport} (VDT) policies which approximate the true optimal policy. We show that well-trained VDT policies enjoy numerous favorable properties in comparison with other state-of-the-art methods based on flows, diffusions, or Schrödinger bridges: they lead to straight transport paths which can be simulated quickly and robustly, and can be enhanced in all the same ways as diffusion and flow-based models (e.g., conditional generation, classifier-free guidance, unpaired data-to-data translation are all easy to incorporate). We evaluate our methodology in a range of experiments, with results that indicate strong performance and good potential for scalability.
Read the original paperMore in Generative Models
Browse all 63 papers →RULER: Instance-aware Rubric Rewards for SVG Generation
Hangyu Ran, Yuhao Zheng, Yingying Zhang, Kevin Qinghong Lin, Han Peng
RULER uses instruction-specific visual rubrics as reinforcement-learning rewards to make SVG generation more faithful, stylish, and resistant to reward hacking.
Think Before You Score: Thinking Reward Model for Visual Generation
Xuehai Bai, Zhenchen Tang, Yang Shi, Dianyi Wang, Tengfei Liu, Wanshun Su, Xuanyu Zhu, Ruohui Wang, Haiwen Diao, Haotian Wang, Xiaoling Gu, Yuanxing Zhang
A visual reward model that first decides what matters in each image-generation case, then scores outputs with detailed rubrics to provide better training signals.
WanPE: Towards Cinematic Prompt Enhancement for Modern Text-to-Video Generation
Yubo Zhu, Yawen Shao, Ziyun Dai, Zixun Fang, Kai Zhu, Siyang Sun, Haolan Xue, Chuxin Wang, Tingyu Weng, Jingming Luo, Chen Shi, Lianghua Huang, Yufeng Ai, Yuzheng Wang, Wenyuan Zhang, Yu Shang, Yuxiang Bao, Zoubin Bi, Jie Xiao, Jinbo Xing, Jiaxing Zhao, Chongyang Zhong, Hengjian Chen, Chenwei Xie, Akide Liu, Zhehan Kan, Yu Liu, Wei Zhai, Sheng Zhong, Wei Tong
WanPE turns ordinary text prompts into director-level cinematic plans, substantially improving the quality and consistency of long-form AI-generated videos.