Skip to content

FlowCPO: A Unified Divergence View of Preference Alignment for Flow Models

Sep 2026 · 1 citation · 55 references
Mathematics Computer Science

TL;DR

This work introduces FlowCPO, an offline forward-KL objective that uses both preferred and dispreferred samples without online rollouts and shows under explicit regularity conditions that the forward-KL objective is bounded by a contrastive flow matching loss, yielding a tractable surrogate on fixed data.

Abstract

Preference alignment for flow and diffusion models now spans online reinforcement learning and offline preference optimization, but the relation between these methods remains unclear. In particular, existing forward-process alignment methods require fresh samples from the current model, while offline methods based on fixed preference pairs rely primarily on positive-only fine-tuning or DPO-style likelihood-ratio surrogates. We organize these approaches through a divergence-based framework and introduce FlowCPO, an offline forward-KL objective that uses both preferred and dispreferred samples without online rollouts. For linear interpolation, we show under explicit regularity conditions that the forward-KL objective is bounded by a contrastive flow matching loss, yielding a tractable surrogate on fixed data. We further show that this loss is nonnegative, whereas the signed regression loss of simplified FlowDPO can be unbounded below. In the in-domain setting, FlowCPO achieves higher mean GenEval and OCR scores than the evaluated baselines, reaching 0.84 and 0.87 versus 0.81 and 0.74 for FlowDPO at CFG 3.0. In the out-of-domain setting, the results are mixed, with the best GenEval result but lower reward scores than RFT on several metrics.

View source

Similar papers

#machine learning Preprint Sep 2026

Towards Bridging the Gap Between Offline and Iterative Alignment via Preference Distillation

This work proposes Distilled Preference Probability Policy Optimization (DP3O), an effective and efficient offline alignment algorithm that outperforms state-of-the-art offline methods, achieves performance comparable to iterative DPO, and reduces training time, demonstrating both its effectiveness and efficiency.

Wen-Bo Zhang, Wen-Zhuo Zhou, Heng-Rui Cai et al. · 0 citations
#artificial intelligence Preprint Sep 2026

A Zeroth-Order Paradigm for LLM Preference Alignment

This paper proposes and analyzes Comparison-based Preference Optimization (ComPO), a zeroth-order alignment method based on comparison oracles, and establishes a convergence guarantee for its basic offline scheme under smoothness, gradient sparsity, and compatibility between the oracle and a latent objective.

Peter Chen, Xi Chen, Wo-Tao Yin et al. · 0 citations
Preprint Aug 2026

Manifold Drift in Flow Preference Optimization: A Root Cause of Reward Hacking

Preference optimization is a standard alignment method for generative models, yet extending it to continuous-time dynamics remains non-trivial. In flow matching, reward-driven updates modify transport trajectories without an inherent constraint to the pretrained data manifold and can move terminal samples off the pretr...

Yan-Sen Han, Shengyi Liao, Yuan-Xing Zhang et al. · 0 citations
#artificial intelligence Preprint Oct 2026

LSC-DPO: Learning-Signal-Controlled Direct Preference Optimization

Direct Preference Optimization (DPO) has become a standard reward-model-free approach for aligning language models with preference data. However, as the scaled preference margin grows during training, the logistic DPO loss becomes progressively less sensitive to further changes. We study DPO from a loss-level geometric...

Ya-Di Qu, Yu-Sheng Han, Cheng-Jia Feng et al. · 0 citations
#machine learning Preprint Oct 2026

Scaling Online Optimal Transport Minibatches for Flow Matching

This work develops a scalable online entropic OT approximation that enables substantially larger source-target couplings while preserving the benefits of OT, and proves strict reductions in full stochastic-gradient variance and integration error relative to independent pairing.

P. Chen, Sergey Levine · 0 citations
#small language model Preprint Aug 2026

Disentangling Optimization Scale from Preference Scale in DPO

This work shows that $\beta$ entangles two distinct roles: it governs the effective inverse preference-noise scale and simultaneously rescales the optimization dynamics, coupling this scale with the effective step size, and proposes a centered-softplus reformulation that is argmin-equivalent to DPO for $\beta>0$, while...

Ivan Kruzhilov · 0 citations

Related blog posts

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.