- Rating
- 2
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 3
- Soundness
- 2
Read review
Paper summary
GS-ES branches from intermediate denoising states, evaluates candidate ODE continuations with a reward model, and selects states for later exploration. Candidate rewards also weight a local Gaussian score update. The paper uses a timestep-dependent candidate budget and structured perturbations to organize this search. It evaluates the method on FLUX.1-dev and Wan2.1-T2V-1.3B.
Critical strengths
- The method shares one transition-mean evaluation across candidates from the same parent, then aggregates their weighted residuals before backpropagation. This is a concrete computational design.
- The paper distinguishes its exact pointwise Gaussian-score identity from claims about the expected update under structured sampling.
- The ablations test whether later-step budget allocation, selection, and orthogonal probes each contribute to reward gains.
Critical weaknesses
- The identity in Proposition 1 is a standard Gaussian score derivative. It does not explain why the full combination of selection, normalized group rewards, and ODE evaluation should optimize the stated trajectory objective.
- The main table reports point estimates only. There is no run-to-run variation for the gains over BranchGRPO and DiffusionNFT.
- GS-ES replaces gradient-enabled work with many gradient-free continuations. Measured step time is nearly unchanged on images and higher on video, so its efficiency claim is narrower than the forward-count reduction suggests.
- The faster PickScore convergence is measured in training steps. A comparison at equal wall-clock cost is needed because the methods perform different amounts of work per step.
Questions for authors
Please refer to weakness.