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.
Improving Classifier-Free Guidance of Flow Matching via Manifold Projection
Department of Mathematics, The Hong Kong University of Science;IAS Center for AI for Scientific Discoveries, The Hong Kong University of Science;School of Mathematics;Statistics \& Institute of Interdisciplinary Research for Mathematics;Applied Science \& Hubei Key Laboratory of Engineering Modeling;Scientific Computing, Huazhong University of Science;Department of Statistics;Data Science, Southern University of Science
Efficient Flow Matching for Sparse-View CT Reconstruction
Centrum Wiskunde en Informatica(数学与信息学研究中心);LIACS, Leiden University(莱顿大学LIACS);Great Bay University(大湾大学);Mathematical Institute, Utrecht University(乌得勒支大学数学研究所)
Memory Matching is not Enough: Jointly Improving Memory Matching and Decoding for Video Object Segmentation
University of Chinese Academy of Sciences(中国科学院大学);South China Agricultural University(华南农业大学);Beijing University Of Technology(北京工业大学);Monash University(莫纳什大学)
GeoVLM: Improving Automated Vehicle Geolocalisation Using Vision-Language Matching
Connected and Autonomous Vehicles Lab (CAV-Lab)(连接与自动驾驶车辆实验室);University of Surrey(萨里大学);Centre for Vision, Speech and Signal Processing (CVSSP)(视觉、语音和信号处理中心)
CoCo-BERT: Improving Video-Language Pre-training with Contrastive Cross-modal Matching and Denoising
Sun Yat-sen University(中山大学);The Key Laboratory of Machine Intelligence and Advanced Computing (Sun Yat-sen University), Ministry of Education(机器智能与先进计算教育部重点实验室(中山大学));JD AI Research(京东人工智能研究院)
Not All Samples Should Be Utilized Equally: Towards Understanding and Improving Dataset Distillation
School of Artificial Intelligence, Shanghai Jiao Tong University(上海交通大学人工智能学院);EPIC Lab, Shanghai Jiao Tong University(上海交通大学EPIC实验室);National University of Singapore(新加坡国立大学)