AMIR-GRPO: Advanced RL Alignment Algorithm

• AMIR-GRPO is a reinforcement learning alignment algorithm for LLMs that leverages implicit pairwise preferences to optimize group-level rollouts.
• It employs a DPO-style contrastive regularizer to densify supervision, reduce gradient variance, and enforce clear decision boundaries.
• Empirical results demonstrate notable improvements in Pass@1 scores and sample efficiency across diverse mathematical reasoning benchmarks.

AMIR-GRPO (Augmented Merit-guided Implicit-preference Regularization for Group Relative Policy Optimization) is an advanced reinforcement learning alignment algorithm for LLMs focused on complex reasoning tasks. It extends standard GRPO by leveraging implicit pairwise preference signals latent in group-level rollout rewards to construct a contrastive regularizer, thereby amplifying policy supervision and mitigating structural biases.

1. Foundations and Motivation

Group Relative Policy Optimization (GRPO) aligns LLM policies through reinforcement learning using group-based evaluation. For each prompt $q$, GRPO samples a group of $G$ completions $\{o_i\}_{i=1}^G$ from the current policy $\pi_{\theta_{\rm old}}$, independently assigns scalar rewards $r_i$, and computes a group-normalized sequence-level advantage for each completion:

$$A_i = \frac{r_i - \mu_r}{\sigma_r} \quad \text{where} \quad \mu_r = \frac{1}{G} \sum_{j=1}^G r_j, \; \sigma_r = \sqrt{\frac{1}{G} \sum_j (r_j-\mu_r)^2}$$

These advantages modulate PPO-style surrogate rewards in policy optimization.

GRPO's scalar rewards and normalization induce critical limitations:

• Sequence-length bias: Positive advantages disproportionately encourage shorter completions; penalties on long low-reward trajectories are diluted.
• Sparse-reward inefficacy: Negative advantages assigned to many incorrect rollouts become numerically weak after normalization, limiting effective suppression.
• Preference information compression: Each group potentially contains $O(G^2)$ pairwise ordering constraints between completions, yet only $O(G)$ scalar signals are utilized.

AMIR-GRPO exploits these implicit intra-group preferences to densify the supervision signal and improve policy discrimination without requiring added human labeling (Yari et al., 7 Jan 2026).

2. Objective Formulation and Implicit-Preference Construction

2.1 GRPO Surrogate Objective

Let $\pi_\theta$ denote the current model, $\pi_{\rm ref}$ a reference policy, and $G$0 the PPO clipping threshold. The GRPO objective maximizes:

$G$1

with

$G$2

and reference KL penalty.

2.2 Implicit Preference Set

From the reward group $G$3, AMIR-GRPO infers the set of robust pairwise preferences: $G$4 where $G$5 is a reward margin threshold excluding near-ties. Each pair encodes a supervision that $G$6 is strictly preferable to $G$7.

2.3 DPO-Style Contrastive Regularizer

For every pair $G$8, a DPO-style contrastive logit is computed: $G$9 with temperature $\{o_i\}_{i=1}^G$0. The regularization loss is: $\{o_i\}_{i=1}^G$1 where $\{o_i\}_{i=1}^G$2 denotes the sigmoid function.

2.4 Combined AMIR-GRPO Objective

The final learning objective is: $\{o_i\}_{i=1}^G$3 where $\{o_i\}_{i=1}^G$4 adaptively balances the regularizer according to the batchwise ratio $\{o_i\}_{i=1}^G$5.

3. Algorithmic Procedure

AMIR-GRPO is implemented iteratively with the following steps:

• Sample minibatches of prompts and generate $\{o_i\}_{i=1}^G$6 completions per prompt under $\{o_i\}_{i=1}^G$7.
• Compute normalized advantages $\{o_i\}_{i=1}^G$8 and construct the implicit preference set $\{o_i\}_{i=1}^G$9 for each prompt.
• Calculate the clipped GRPO surrogate objective.
• Compute the contrastive regularizer across all pairwise preferences using DPO-style logits.
• Dynamically adjust $\pi_{\theta_{\rm old}}$0 to maintain a target ratio between preference regularizer and surrogate objective.
• Combine all terms and backpropagate gradients to update $\pi_{\theta_{\rm old}}$1; periodically sync $\pi_{\theta_{\rm old}}$2.

Stabilization measures include margin filtering ($\pi_{\theta_{\rm old}}$3), length normalization in log-probabilities, PPO-style trust-region clipping ($\pi_{\theta_{\rm old}}$4), and online adaptation of regularization strength.

4. Theoretical Properties

AMIR-GRPO leverages implicit preference relations, yielding increased supervision density compared to vanilla GRPO:

• Supervision richness: Each group instantiates up to $\pi_{\theta_{\rm old}}$5 preference constraints (vs. $\pi_{\theta_{\rm old}}$6 scalar advantages).
• Gradient variance reduction: Amplified penalties on low-reward completions via multiple contrastive judgments sharpen learning and suppress poor trajectories.
• Margin enforcement: Contrastive DPO-style updates enforce separation in log-probability space, tightening boundaries between high-reward and low-reward completions.
• The core GRPO component, with PPO-style clipping and KL, inherits trust-region convergence properties.

AMIR-GRPO’s alignment mechanism fundamentally diverges from exponential/logarithmic pooling approaches (see classical RLHF):

• Standard RLHF uses an objective of the form $\pi_{\theta_{\rm old}}$7, with stationary solution

$\pi_{\theta_{\rm old}}$8

(i.e., geometric pooling).

• By contrast, GRPO and AMIR-GRPO yield a rational multiplicative update, not exponential, resulting in non-logarithmic aggregation of reference policy and group-based preference signals (Vojnovic et al., 25 Feb 2025).

5. Empirical Evaluation

5.1 Datasets and Metrics

Benchmarking spans in-distribution and out-of-distribution mathematical reasoning task suites:

• Training on GSM8K (grade-school math), evaluation on GSM8K test, AIME 2025, OlympiadBench, AMC23, MinervaMath, AQUA-RAT, and LiveMathBench.
• Main metric is Pass@k, estimated by unbiased combinatorial sampling ($\pi_{\theta_{\rm old}}$9 rollouts/question, $r_i$0 correct ones).

5.2 Main Results

AMIR-GRPO achieves consistent improvements over GRPO across multiple architectures (Qwen2.5-3B, Qwen2.5-7B, Gemma-4B). Representative gains:

Dataset/Model	GRPO Pass@1	AMIR-GRPO Pass@1	Δ Pass@1
AMC23/7B	40.5%	43.2%	+2.7
LiveMath/4B	19.0%	23.1%	+4.1

Pass@2 and Pass@4 improvements are proportionally larger, indicating enhanced sample efficiency and expanded coverage: AMIR-GRPO solves 8.8% more problems exclusively than GRPO on AMC23 (Yari et al., 7 Jan 2026).

5.3 Ablation and Trajectory Analysis

• Temperature ($r_i$1) effects: Lower $r_i$2 stabilizes smaller models; intermediate $r_i$3 is optimal on 7B-class; higher $r_i$4 further benefits larger scale.
• **Adaptive contrastive weight ($r_i$5) robustly outperforms static values.
• Group size ($r_i$6): Gains saturate beyond $r_i$7.
• Preference margin ($r_i$8): Excluding too many near-ties depletes supervision; optimal $r_i$9 reward standard deviation.

Analysis shows sharper log-probability margin between correct and incorrect rollouts (2.7×) and greater diversity (tail spread) under AMIR-GRPO, indicative of reduced collapse and stronger decision boundaries.

6. Qualitative Examples, Limitations, and Future Work

Qualitative inspection reveals AMIR-GRPO suppresses short, incomplete reasoning chains favored by GRPO’s normalization, instead promoting longer, coherent solutions. Contrasts between high-reward and near-miss completions correct errors (e.g., sign or case misclassifications) that scalar advantage signals fail to rectify.

Limitations include:

• Current scope is restricted to text-based mathematical reasoning; generalization to code or vision-language modalities may require reward redesign.
• Policy learning occurs only at trajectory-level granularity; finer credit assignment (e.g., stepwise, tree-structured rollout analysis) remains an open direction.
• Hyperparameter tuning (particularly $$A_i = \frac{r_i - \mu_r}{\sigma_r} \quad \text{where} \quad \mu_r = \frac{1}{G} \sum_{j=1}^G r_j, \; \sigma_r = \sqrt{\frac{1}{G} \sum_j (r_j-\mu_r)^2}$$0, $$A_i = \frac{r_i - \mu_r}{\sigma_r} \quad \text{where} \quad \mu_r = \frac{1}{G} \sum_{j=1}^G r_j, \; \sigma_r = \sqrt{\frac{1}{G} \sum_j (r_j-\mu_r)^2}$$1, $$A_i = \frac{r_i - \mu_r}{\sigma_r} \quad \text{where} \quad \mu_r = \frac{1}{G} \sum_{j=1}^G r_j, \; \sigma_r = \sqrt{\frac{1}{G} \sum_j (r_j-\mu_r)^2}$$2, $$A_i = \frac{r_i - \mu_r}{\sigma_r} \quad \text{where} \quad \mu_r = \frac{1}{G} \sum_{j=1}^G r_j, \; \sigma_r = \sqrt{\frac{1}{G} \sum_j (r_j-\mu_r)^2}$$3) requires per-domain adjustment; automated adaptation is a potential area for improvement.

A plausible implication is that AMIR-GRPO’s contrastive augmentation could benefit other reinforcement learning decoders relying on groupwise batch supervision, especially where dense preference signals are available with no annotation cost.

7. Summary and Significance

AMIR-GRPO augments GRPO by explicitly extracting and enforcing $$A_i = \frac{r_i - \mu_r}{\sigma_r} \quad \text{where} \quad \mu_r = \frac{1}{G} \sum_{j=1}^G r_j, \; \sigma_r = \sqrt{\frac{1}{G} \sum_j (r_j-\mu_r)^2}$$4 intra-group preference signals via DPO-inspired contrastive regularization. This yields amplified suppression of low-reward completions, abated response-length bias, sharper separation between solution- and error-trajectories, and consistent coverage improvements across reasoning-intensive mathematical task distributions (Yari et al., 7 Jan 2026, Vojnovic et al., 25 Feb 2025). The methodology highlights the critical role of implicit rank-supervision in scalable LLM alignment, rendering AMIR-GRPO an influential variant for robust reasoning alignment.