Paper summary: FlowRL: Matching Reward Distributions for LLM Reasoning
FlowRL replaces reward maximisation with matching the whole reward distribution (via a learnable partition function and reverse KL), to keep diverse reasoning paths alive; it reports +10.0% over GRPO on maths.
Problem
PPO and GRPO maximise reward. According to the abstract, this tends to over-optimise dominant reward signals and neglect less frequent but valid reasoning paths, which reduces diversity.
Method
FlowRL matches the full reward distribution instead:
- turn scalar rewards into a normalised target distribution using a learnable partition function
- minimise the reverse KL divergence between the policy and that target
Implemented as flow-balanced optimisation, this encourages diverse exploration.
Key results
From the abstract: on maths benchmarks, an average improvement of 10.0% over GRPO and 5.1% over PPO, and consistently better results on code reasoning.
Limitations
There’s no dedicated limitations section in the extracted text. Results cover maths and code, where rewards are verifiable.
Sources
- FlowRL: Matching Reward Distributions for LLM Reasoning (arXiv:2509.15207) — arXiv
- Hugging Face Daily Papers, 2025-09-19 — Hugging Face
- FlowRL: Matching Reward Distributions for LLM Reasoning (arXiv HTML full text) — arXiv
- Code repository (linked in the paper) — GitHub
This is a summary written from the linked public sources. Figures and numbers are as reported there.