Sign inGet started
Paper · arXiv

MEND: RL For Flow Models via Proximal Velocity Matching

Reward post-training of flow models either reweights the model's own samples under a KL penalty or a frozen reference, often for thousands of updates, or backpropagates the reward and moves every sample without checking that the move is worth its size. We introduce MEND, a reinforcement learning method built on proximal velocity matching. MEND caps rewards within each prompt group, so samples that already score well receive no move. Below the cap, it proposes moves along the reward gradient and accepts one only when its capped reward gain exceeds a quadratic displacement price. The model then regresses onto the resulting velocity targets, with no KL term, frozen reference model, or advant...

AuthorsShreshth Saini, Neil Birkbeck, Yilin Wang et al.
Primary categorycs.LG
Published5 October 2026
Last updated at source5 October 2026
cs.LGcs.CV
Embed this entry
<iframe src="https://silytics.si/embed/item/960fbe73-ce30-4997-8491-63cef76bbea8" width="420" height="190" style="border:0" loading="lazy" title="Silytics entry"></iframe>

Free, no tracking. More about feeds and embeds.

Popularity, last 2 days

0 now. Counts as reported by the source, snapshotted daily by Silytics.

Connected in the knowledge graph

Explore this entry in the graph

Models and datasets referencing this paper

Silytics shows public metadata from arXiv and links to the original. Information may be incomplete or out of date. Last refreshed 17 October 2026. Licenses and terms of the original apply to the work itself. Not financial, legal or professional advice.