GRPO Fine-Tuning in VAR Models

• The paper introduces a critic-free GRPO approach that employs group-wise reward normalization to fine-tune VAR models efficiently.
• It constructs composite reward signals using AES and CLIP scores to guide prompt-aligned, aesthetically refined image generation.
• GRPO’s trust-region policy optimization with group normalization accelerates convergence and improves stability, offering faster inference than diffusion methods.

Group Relative Policy Optimization (GRPO)-Based Reinforcement Fine-Tuning refers to a family of reinforcement learning algorithms that utilize group-wise normalization of scalar rewards to fine-tune large-scale autoregressive models—particularly visual autoregressive (VAR) architectures—without requiring explicit value networks. This critic-free approach, rooted in robust policy gradient methods, is designed to efficiently align generative outputs with nuanced human-centric reward signals and to maintain high computational throughput, an especially salient property for visual sequence modeling (Gallici et al., 29 May 2025).

1. Next-Scale Visual Autoregressive Model Architecture and Pre-Training

GRPO-based fine-tuning is most impactful when applied to next-scale VAR models, which structurally decompose an input image $x$ into $K$ discrete “scales” $r_1, r_2, \dots, r_K$. Each scale $r_k$ is a matrix of $h_k \times w_k$ discrete tokens produced by a Vector-Quantized VAE. The generative distribution factorizes coarse-to-fine:

$$p_\theta(x) = p_\theta([r_1,…,r_K]) = \prod_{k=1}^K p_\theta(r_k | r_{<k})$$

Pre-training proceeds via cross-entropy minimization over $N$ training images:

$$\mathcal{L}(\theta) = -\frac{1}{N} \sum_{i=1}^N \log p_\theta([r_1^{(i)},…,r_K^{(i)}])$$

This “next-scale prediction” task preserves spatial locality by predicting entire downsampled feature maps in autoregressive order, instead of token-by-token next-pixel prediction.

2. Construction of Reward Signals for RL Fine-Tuning

GRPO-based fine-tuning relies on verifiable reward functions reflecting task-specific or perceptual criteria. Two principal reward types are used:

• Aesthetic Predictor (AES): Returns a scalar in $[1,10]$ by processing the CLIP embedding of the generated image $x$ through an MLP trained on human-provided aesthetics ratings.
• CLIP Score: For prompt $K$0, the reward evaluates $K$1 in CLIP space, measuring semantic alignment.
• Combined Reward: Generalized as $K$2. For constrained tasks (such as brightness), simpler reward models (thresholded mean RGB) are employed.

3. Formalization of GRPO Workflow

GRPO modifies standard PPO by introducing group-wise advantage normalization and token-level importance weights:

• Grouping: $K$3 outputs are sampled per condition (e.g., per class label), yielding mini-batches of candidate generations.
• Group-Relative Advantage: For group $K$4, with rewards $K$5,

$K$6

where $K$7 and $K$8 are the group mean and standard deviation.

• Importance Weights: For each token $K$9 in group $r_1, r_2, \dots, r_K$0:

$r_1, r_2, \dots, r_K$1

• GRPO Objective: The trust-region PPO-style surrogate,

$r_1, r_2, \dots, r_K$2

subject to average KL constraint,

$r_1, r_2, \dots, r_K$3

In practice, clipped surrogate loss with fixed $r_1, r_2, \dots, r_K$4 and KL regularization ($r_1, r_2, \dots, r_K$5) is used:

$r_1, r_2, \dots, r_K$6

4. Algorithmic Structure and Implementation

The fine-tuning process follows a clear, staged workflow:

1. Initialization: Set $r_1, r_2, \dots, r_K$7 (VAR trained on ImageNet).
2. Iterative RL-Driven Training:
   • Randomly select $r_1, r_2, \dots, r_K$8 class-labels from the ImageNet class pool.
   • For each label, sample $r_1, r_2, \dots, r_K$9 images from $r_k$0 using multicategorical sampling at temperature $r_k$1.
   • Compute group rewards using AES/CLIP.
   • Calculate intra-group mean and standard deviation to derive normalized advantages for all samples.
   • Compute per-token gradients, accumulate surrogate (clipped) loss plus KL penalty, and update weights via Adam ($r_k$2, $r_k$3, $r_k$4).
   • Sync $r_k$5 at intervals. No separate value network is used; GRPO’s group normalization fulfills its purpose.

5. Experimental Paradigm and Evaluation Metrics

Experiments utilize both mid-scale ($r_k$6M, VAR-d16) and large-scale ($r_k$7B, VAR-d30) pretrained models. Fine-tuning samples ImageNet labels or fixed text prompts (for CLIP reward). Primary metrics include:

• Aesthetic Score (AES): As output by the MLP/CLIP scheme, measured over $r_k$8K images.
• CLIP Score: Alignment with semantic prompts.
• ResNet50 Top-5 Accuracy: Detects distributional drift from the ImageNet training regime.
• FID: Optionally used to benchmark against diffusion models.

Ablations vary the KL penalty $r_k$9, the group size $h_k \times w_k$0, and train on partial label splits to measure generalization.

6. Empirical Results and Analyses

Key empirical outcomes:

• Toy Reward (Brightness): Rapid convergence ($h_k \times w_k$1 min on H100) to exclusive bright/dark image generation; reward stabilizes at $h_k \times w_k$2.
• Aesthetic (AES/CLIP) Fine-Tuning: $h_k \times w_k$3K gradient steps ($h_k \times w_k$4 hr for d16, $h_k \times w_k$5 hr for d30) imply:
  • VAR-d30 AES increase from $h_k \times w_k$6, ResNet accuracy $h_k \times w_k$7\%.
  • VAR-d16 gains $h_k \times w_k$8 AES even on withheld label classes.
• CLIP Alignment (Style Transfer): In $h_k \times w_k$9 hr, CLIP alignment doubles; model synthesizes unseen prompts and non-ImageNet styles.
• Ablation: Excessively low $$p_\theta(x) = p_\theta([r_1,…,r_K]) = \prod_{k=1}^K p_\theta(r_k | r_{<k})$$0 causes reward hacking/label collapse, high $$p_\theta(x) = p_\theta([r_1,…,r_K]) = \prod_{k=1}^K p_\theta(r_k | r_{<k})$$1 blocks improvement. Larger $$p_\theta(x) = p_\theta([r_1,…,r_K]) = \prod_{k=1}^K p_\theta(r_k | r_{<k})$$2 increases stability and metric gains.
• Inference Speed: VAR models offer $$p_\theta(x) = p_\theta([r_1,…,r_K]) = \prod_{k=1}^K p_\theta(r_k | r_{<k})$$3 faster sampling than diffusion approaches, making online RL practical.

7. Broader Implications and Recommendations

GRPO-based fine-tuning provides a robust, value-free approach for aligning high-throughput VAR models with human-centric objectives (Gallici et al., 29 May 2025). Its group-based normalization reduces gradient variance and removes the need for explicit value functions, supporting:

• Efficient Online RL: Fast autoregressive models accommodate large-sample RL loops without the prohibitive slowdowns typical of diffusion-based alternatives.
• Precise Alignment: The joint use of AES and CLIP rewards enables fine-grained control over both aesthetic quality and prompt-driven style, maintaining classification integrity relative to the base model.
• Generalization Beyond Pretraining: RL-driven exploration allows VAR models to synthesize prompt-aligned outputs not represented in the original training data.
• Methodological Stability: GRPO’s normalization and trust-region constraints enable large-scale fine-tuning with rapid convergence and robust safety against reward exploitation.

In conclusion, GRPO-based reinforcement fine-tuning for visual autoregressive models represents an efficient paradigm for scaling RL alignment protocols to highly performant, generative architectures while retaining computational and modeling tractability (Gallici et al., 29 May 2025).