Paper recorded by Signals 4 on 2026-08-30 in cs.LG. Abstract reproduced from arXiv; link to the original below.
Published 2026-08-30 on arXiv · recorded by Signals 4 on 2026-09-01
Category: cs.LG · 机器学习 · first seen 2026-09-01
To mitigate the time complexity of generative models, one-step generative models have recently emerged through direct mapping from noise to data in a single forward pass. However, the reward-guided fine-tuning method of one-step generative models remains largely unexplored. To address this, we consider one-step generators from an optimal transport view, investigating Wasserstein Gradient Flow (WGF