用潜在奖励引导搜索,让视频生成更快更准。
LatSearch: Latent Reward-Guided Search for Faster Inference-Time Scaling in Video Diffusion
- 在去噪过程中引入中间奖励信号,动态优化噪声初始值。
- 在VBench-2.0上相比Wan2.1模型,多维度生成质量均提升。
- 适合追求高效高质量视频生成的研究者与开发者。
大型语言模型的推理时缩放近期取得成功,启发了视频扩散模型的类似探索。尽管已有研究尝试通过优化或搜索更好的初始噪声来提升生成效果,但受限于初期先验假设及仅在解码后视频上评估奖励,导致误差累积、奖励信号延迟稀疏且计算成本过高,难以使用更强的搜索算法。而更强的搜索本可显著提升可控性、样本效率和生成质量,前提是降低计算开销。为此,我们提出潜空间奖励引导的高效推理时缩放方法,通过在去噪轨迹中提供中间、丰富且高效的反馈,实现快速优化。我们构建了一个潜空间奖励模型,可在任意时间步对部分去噪潜变量进行视觉质量、运动质量和文本对齐性的评分。基于此,提出新机制LatSearch,包含奖励引导重采样与剪枝(RGRP):重采样阶段按奖励归一化概率采样,减少对奖励模型的依赖;剪枝阶段在最终预定步骤仅保留累积奖励最高的候选,兼顾质量与效率。在VBench-2.0基准上的实验表明,相比基线模型Wan2.1,LatSearch在多个评估维度上持续提升视频生成性能。
原文摘要 · Abstract (English)
The recent success of inference-time scaling in large language models has inspired similar explorations in video diffusion. In particular, motivated by the existence of "golden noise" that enhances video quality, prior work has attempted to improve inference by optimising or searching for better initial noise. However, these approaches have notable limitations: they either rely on priors imposed at the beginning of noise sampling or on rewards evaluated only on the denoised and decoded videos. This leads to error accumulation, delayed and sparse reward signals, and prohibitive computational cost, which prevents the use of stronger search algorithms. Crucially, stronger search algorithms are precisely what could unlock substantial gains in controllability, sample efficiency and generation quality for video diffusion, provided their computational cost can be reduced. To fill in this gap, we enable efficient inference-time scaling for video diffusion through latent reward guidance, which provides intermediate, informative and efficient feedback along the denoising trajectory. We introduce a latent reward model that scores partially denoised latents at arbitrary timesteps with respect to visual quality, motion quality, and text alignment. Building on this model, we propose LatSearch, a novel inference-time search mechanism that performs Reward-Guided Resampling and Pruning (RGRP). In the resampling stage, candidates are sampled according to reward-normalised probabilities to reduce over-reliance on the reward model. In the pruning stage, applied at the final scheduled step, only the candidate with the highest cumulative reward is retained, improving both quality and efficiency. We evaluate LatSearch on the VBench-2.0 benchmark and demonstrate that it consistently improves video generation across multiple evaluation dimensions compared to the baseline Wan2.1 model.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。