Sign inGet started
Paper · arXiv

Backpropagating Verifier Rewards Through Continuous Flow Language Models

Reinforcement learning (RL) has substantially improved the reasoning of autoregressive and discrete-diffusion language models. Language models that generate continuous token embeddings are emerging as a strong alternative, but RL post-training for them remains understudied. We propose \method{}, a post-training framework for continuous flow language models. Such a model denoises token embeddings over multiple steps and decodes them into discrete tokens only at the last step. To obtain pathwise gradients, which backpropagate through continuous actions and have much lower variance than REINFORCE, we introduce a critic that estimates the value of intermediate token embeddings, bypassing the ...

AuthorsXu Han, Jiajing Hu, Li-Ping Liu
Primary categorycs.LG
Published13 October 2026
Last updated at source13 October 2026
cs.LG
Embed this entry
<iframe src="https://silytics.si/embed/item/f7f4e575-cf4c-43d1-bcca-dd1cdcd98dae" width="420" height="190" style="border:0" loading="lazy" title="Silytics entry"></iframe>

Free, no tracking. More about feeds and embeds.

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