Low-Rank Prior-Induced Consistency Flow Matching for Efficient Traffic Imputation
Generative models like diffusion and flow matching excel in traffic imputation but suffer from high inference latency, as the learned vector fields typically induce curved generative trajectories requiring multi-step numerical integration. Furthermore, learning the transformation from non-informative priors introduces redundant computational overhead. To address these issues, we propose Low-Rank Prior-Induced Consistency Flow Matching (LOFT) for efficient and effective distribution modeling under highly sparse data. First, we construct a low-rank prior from sparse observations to recover inherent spatiotemporal correlations. Initializing the flow with this informative prior reduces the mapping complexity, allowing the model to focus on fine-grained variations. Second, to enable efficient inference by linearizing generative trajectories, we introduce an uncertainty-aware rectification mechanism. This mechanism resolves the gradient conflict between improving accuracy and trajectory linearization by dynamically arbitrating the optimization trade-off based on the training progress and data uncertainty. Experimental results demonstrate that LOFT surpasses state-of-the-art baselines using an NFE (Number of Function Evaluations) of 2, whereas competing methods typically require 20 to 50 NFE, achieving over a 10× improvement in inference efficiency. The code is available at https://github.com/maoxiaowei97/LOFT.