arXiv:2510.21167cs.CV2025-10NeurIPS被引 4

将生成过程分段建模,提升图像生成速度与质量。

Blockwise Flow Matching: Improving Flow Matching Models For Efficient High-Quality Generation

  • 将生成轨迹分段,每段用小型专用模型建模。
  • 在ImageNet上实现2.1至4.9倍加速,质量相当。
  • 适合追求高效高质生成的开发者使用。

近期,流匹配模型在多个领域推动了高质量数据生成的边界。传统方法通常使用单一大型网络学习从噪声到数据的完整生成轨迹,但该设计难以同时捕捉不同时间步的信号特征,且因需迭代运行整个模型而带来高昂推理成本。为此,我们提出块式流匹配(BFM),将生成轨迹划分为多个时间片段,每个片段由更小但专门化的速度块建模。这种分块设计使各块能有效专注于指定区间,提升推理效率与样本质量。为进一步增强生成保真度,我们引入语义特征引导模块,显式地将预训练表征对齐的语义特征作为速度块的条件。此外,提出轻量级特征残差近似策略,在显著降低推理开销的同时保持语义质量。在ImageNet 256x256上的大量实验表明,BFM在现有流匹配方法基础上实现了显著更优的帕累托前沿,在相近生成性能下推理复杂度提升2.1至4.9倍。代码已开源:https://github.com/mlvlab/BFM。

原文摘要 · Abstract (English)

Recently, Flow Matching models have pushed the boundaries of high-fidelity data generation across a wide range of domains. It typically employs a single large network to learn the entire generative trajectory from noise to data. Despite their effectiveness, this design struggles to capture distinct signal characteristics across timesteps simultaneously and incurs substantial inference costs due to the iterative evaluation of the entire model. To address these limitations, we propose Blockwise Flow Matching (BFM), a novel framework that partitions the generative trajectory into multiple temporal segments, each modeled by smaller but specialized velocity blocks. This blockwise design enables each block to specialize effectively in its designated interval, improving inference efficiency and sample quality. To further enhance generation fidelity, we introduce a Semantic Feature Guidance module that explicitly conditions velocity blocks on semantically rich features aligned with pretrained representations. Additionally, we propose a lightweight Feature Residual Approximation strategy that preserves semantic quality while significantly reducing inference cost. Extensive experiments on ImageNet 256x256 demonstrate that BFM establishes a substantially improved Pareto frontier over existing Flow Matching methods, achieving 2.1x to 4.9x accelerations in inference complexity at comparable generation performance. Code is available at https://github.com/mlvlab/BFM.

流匹配高效生成图像生成

Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。