Geo-FSRL examines a training choice that becomes important when a flow model generates an image or video in only a few large transitions. The paper asks how to introduce the stochastic policy needed for reinforcement learning while preserving the target flow coefficients.
Choosing the training transition
Several stochastic policies can satisfy that coefficient constraint. Geo-FSRL selects one by minimizing the conditional change in the policy, measured through KL divergence, for a nonzero update to the model's velocity output.
Within the paper's family of isotropic Gaussian transitions, the objective reduces to a scalar geometry factor. The authors derive a closed-form optimizer for that family. They then add gradient-scale matching and derive weights intended to normalize explicit score scales and reference-KL curvature across timesteps.
This is a claim about an optimization construction under specified assumptions. A closed-form solution within the chosen family does not establish optimality over every possible stochastic policy or training setup.
What changes at inference
Geo-FSRL trains on the original few-step schedule and retains the deterministic solver at inference. The training method therefore changes how reward-driven updates are made, rather than requiring the deployed generator to adopt a new stochastic sampling procedure.
The authors report higher final reward scores than Flow-GRPO and Flow-CPS on image and video generation models in the four-step setting. Those rewards are the study's evaluation measures; they do not establish universal preference, factual accuracy or a speed advantage for an unrelated application.
What a reproduction should check
Keep the backbone, reward function, sample budget and inference schedule fixed when testing the policy construction. Examine optimization stability and final outputs alongside the reward curves. A useful follow-up would test whether the advantage survives alternative rewards and workloads. The paper offers a precise training mechanism to investigate, with a clearly bounded claim about the family in which its optimizer is derived.
Comments