- Rating
- 2
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 3
- Soundness
- 1
Read review
Paper summary
This paper decomposes the transition log-likelihood in Flow-GRPO into token-level terms and uses a reward-gradient-based rule to weight the token-level advantages. On SD3.5-Medium and GenEval, the method reports faster RL training convergence than Flow-GRPO.
Critical strengths
- The reported experiments on SD3.5-Medium and GenEval show faster convergence than Flow-GRPO in terms of training steps.
Critical weaknesses
- I am skeptical of the paper's theoretical starting point, namely decomposing the transition likelihood of a generated sample at the token level. The image distribution is a joint distribution with dependencies across patches, and I do not think it can simply be decomposed without further justification. Eqs. (5) and (6) are confusing to me. The network takes the whole noisy image as input and predicts a velocity field for the whole image. The output of any patch therefore depends on the full input. I do not see how the decomposition in Eqs. (5) and (6) reflects the model used in practice or the underlying image-generation problem.
- The reward-gradient-based spatial weight is a manually designed heuristic rather than something derived from a stated loss or policy-gradient objective. This weakens the theoretical motivation for the weighting rule.
Questions for authors
- Can the authors provide a mathematical derivation of the token-level likelihood and importance ratio in Eqs. (5) and (6), making clear whether each patch is conditioned on the full ?
- In Eqs. (5) and (6), does refer to a single denoising timestep ? Elsewhere in the paper, denotes the total number of denoising steps. Please clarify the notation.