Paper Detail
Zhanhao Liang, Tao Yang, Jie Wu, Chengjian Feng, Liang Zheng
This paper focuses on the alignment of flow matching models with human preferences. A promising way is fine-tuning by directly backpropagating reward gradients through the differentiable generation process of flow matching. However, backpropagating through long trajectories results in prohibitive memory costs and gradient explosion. Therefore, direct-gradient methods struggle to update early generation steps, which are crucial for determining the global structure of the final image. To address this issue, we introduce LeapAlign, a fine-tuning method that reduces computational cost and enables direct gradient propagation from reward to early generation steps. Specifically, we shorten the long trajectory into only two steps by designing two consecutive leaps, each skipping multiple ODE sampling steps and predicting future latents in a single step. By randomizing the start and end timesteps of the leaps, LeapAlign leads to efficient and stable model updates at any generation step. To better use such shortened trajectories, we assign higher training weights to those that are more consistent with the long generation path. To further enhance gradient stability, we reduce the weights of gradient terms with large magnitude, instead of completely removing them as done in previous works. When fine-tuning the Flux model, LeapAlign consistently outperforms state-of-the-art GRPO-based and direct-gradient methods across various metrics, achieving superior image quality and image-text alignment.
No structured notes yet. Add `summary_sections`, `why_relevant`, `claim_impact`, or `next_action` in `papers.jsonl` to enrich this view.
No ranking explanation is available yet.
No tags.
@article{liang2026leapalign,
title = {LeapAlign: Post-Training Flow Matching Models at Any Generation Step by Building Two-Step Trajectories},
author = {Zhanhao Liang and Tao Yang and Jie Wu and Chengjian Feng and Liang Zheng},
year = {2026},
abstract = {This paper focuses on the alignment of flow matching models with human preferences. A promising way is fine-tuning by directly backpropagating reward gradients through the differentiable generation process of flow matching. However, backpropagating through long trajectories results in prohibitive memory costs and gradient explosion. Therefore, direct-gradient methods struggle to update early generation steps, which are crucial for determining the global structure of the final image. To address t},
url = {https://arxiv.org/abs/2604.15311},
keywords = {cs.CV, flow matching models, reward gradients, backpropagation, ODE sampling steps, latent space, gradient explosion, direct-gradient methods, generation process, Flux model, GRPO-based methods, image-text alignment, huggingface daily},
eprint = {2604.15311},
archiveprefix = {arXiv},
}
{}