Local Flow Matching Generative Models
<|reference_start|>Local Flow Matching Generative Models: Flow Matching (FM) is a simulation-free method for learning a continuous and invertible flow to interpolate between two distributions, and in particular to generate data from noise in generative modeling. In this paper, we introduce Local Flow Matching (LFM), which learns a sequence of FM sub-models and each matches a diffusion process up to the time of the step size in the data-to-noise direction. In each step, the two distributions to be interpolated by the sub-model are closer to each other than data vs. noise, and this enables the use of smaller models with faster training. The stepwise structure of LFM is natural to be distilled and different distillation techniques can be adopted to speed up generation. Theoretically, we prove a generation guarantee of the proposed flow model in terms of the $\chi^2$-divergence between the generated and true data distributions. In experiments, we demonstrate the improved training efficiency and competitive generative performance of LFM compared to FM on the unconditional generation of tabular data and image datasets, and also on the conditional generation of robotic manipulation policies.<|reference_end|>
@article{xu2024local,
    title={Local Flow Matching Generative Models},
    author={Chen Xu, Xiuyuan Cheng, Yao Xie},
    journal={arXiv preprint arXiv:2410.02548},
    year={2024},
    archivePrefix={arXiv},
    eprint={2410.02548},
    primaryClass={stat.ML cs.LG}
}