Overview
- Field: Computer Vision (CV)
- Authors: Haoyuan Sun, Jing Wang, Yuxin Song
- Published: 2025-05-09
- arXiv: 2505.07245
- Extensive evaluations show SLAS consistently surpasses the DanceGRPO baseline across multiple backbones and benchmarks.
- It produces faster training dynamics and improved out-of-domain performance on GenEval and UniGenBench++.
- SLAS offers enhanced robustness to model scaling while mitigating reward hacking and preserving semantic and compositional fidelity in generation.
Abstract (translated)
Recently, post-training methods based on reinforcement learning, with a particular focus on Group Relative Policy Optimization (GRPO), have emerged as the robust paradigm for further advancement of text-to-image (T2I) models. However, these methods are often prone to reward hacking, wherein models exploit biases in imperfect reward functions rather than yielding genuine performance gains. In this work, the authors identify that normalization could lead to miscalibration, and that directly removing the prompt-level standard deviation term yields an optimal policy ascent direction that is linear in the advantage but still limits the separation of genuine signals from noise.
To address these issues, they propose Super-Linear Advantage Shaping (SLAS) by revisiting the functional update from an information-geometric perspective. By extending the Fisher-Rao information metric with advantage-dependent weighting, SLAS introduces a nonlinear geometric structure that reshapes the local policy space. The design relaxes constraints along high-advantage directions to amplify informative updates, while tightening constraints in low-advantage regions to suppress spurious gradients. In addition, batch-level normalization is applied to stabilize training across different reward scales.