← Back to article

Equation 23 · The Main Technical Approaches to AI Alignment, Compared

What does this equation mean?

A^i,t  =  r~i  =  ri−mean({r1,…,rG})std({r1,…,rG}),\hat A_{i,t} \;=\; \tilde r_i \;=\; \frac{r_i - \mathrm{mean}(\{r_1,\ldots,r_G\})}{\mathrm{std}(\{r_1,\ldots,r_G\})},

Read the formula alongside the article passage below. Each part has a deeper page with its role in the equation, the supporting passage and nearby citations.

Start withr_i - mean(r_1,ldots,r_G)
Divide bystd(r_1,ldots,r_G)
This relates tohat A_i,t
How to read the two sides of this formula. Follow the article passage for the meaning of each quantity.

This equation states an equality: the expressions on both sides have the same value under the article’s assumptions. Read the equation part by part below; each part has a contextual explanation and a link to its mathematical background.

Read it piece by piece

A^i,t\hat A_{i,t}

Symbol hat A_i,t

hat AiA_i,t is part of the quantity the equation computes from the expression on the right.

Understand this part →

r~i\tilde r_i

Symbol tilde r_i

tilde rir_i is one of the signed contributions combined to compute the quantity on the left.

Understand this part →

rir_i

Symbol r_i

rir_i occurs above the fraction bar. The numerator is divided by the entire denominator below it.

Understand this part →

r1r_1

Symbol r_1

r1r_1 is one of the signed contributions combined to compute the quantity on the left.

Understand this part →

rGr_G

Symbol r_G

rGr_G is one of the signed contributions combined to compute the quantity on the left.

Understand this part →

=

=

The expressions on both sides represent the same quantity under the stated assumptions.

Understand this part →

See an illustrated explanation →
fraction

fraction

Divide the expression above the line by the one below it.

Understand this part →

See an illustrated explanation →
subtraction

subtraction

Subtract the following term or group from the preceding one. A leading minus marks a negative quantity.

Understand this part →

subscript

subscript

The lower label selects a particular version, component, or indexed member of the quantity. For example, x₀ and xₜ can be values at different positions.

Understand this part →

ri−mean({r1,…,rG})r_i - \mathrm{mean}(\{r_1,\ldots,r_G\})

Numerator: r_i - mean(r_1,ldots,r_G)

The complete quantity above the fraction bar.

Understand this part →

std({r1,…,rG})\mathrm{std}(\{r_1,\ldots,r_G\})

Denominator: std(r_1,ldots,r_G)

The complete quantity below the fraction bar; it must be nonzero for this division.

Understand this part →

How to interpret it

With a fixed numerator, increasing a nonzero denominator reduces the fraction. Read it with the definitions, units, and assumptions supplied by the article.

What the article says around this equation

RLVR is the newest of the six and the only one that does not fit a learned model of anyone’s judgment at all. Where every technique above trains a proxy — a reward model, an AI judge, a decomposition scheme, a weak label — RLVR restricts itself to tasks where the reward can be computed directly and automatically: a unit test passes, a final numeric answer matches, a proof checker accepts. Shao and colleagues’ DeepSeekMath paper introduced Group Relative Policy Optimization, the reinforcement learning algorithm used throughout most subsequent RLVR work, replacing the learned value function used in standard policy-gradient methods with a group-relative advantage estimated directly from a batch…
Read the full surrounding passage
RLVR is the newest of the six and the only one that does not fit a learned model of anyone’s judgment at all. Where every technique above trains a proxy — a reward model, an AI judge, a decomposition scheme, a weak label — RLVR restricts itself to tasks where the reward can be computed directly and automatically: a unit test passes, a final numeric answer matches, a proof checker accepts. Shao and colleagues’ DeepSeekMath paper introduced Group Relative Policy Optimization, the reinforcement learning algorithm used throughout most subsequent RLVR work, replacing the learned value function used in standard policy-gradient methods with a group-relative advantage estimated directly from a batch of sampled outputs and their rule-based rewards, A^i,t  =  r~i  =  ri−mean({r1,…,rG})std({r1,…,rG})\hat A_{i,t} \;=\; \tilde r_i \;=\; \frac{r_i - \mathrm{mean}(\{r_1,\ldots,r_G\})}{\mathrm{std}(\{r_1,\ldots,r_G\})}. normalizing each sampled response’s reward against the mean and standard deviation of a group of G responses to the same prompt rather than against a separately trained critic network [ 13 ] . Lambert and colleagues, building the fully open Tulu 3 post-training recipe, named the general approach explicitly, describing it as “a novel method we call Reinforcement Learning with Verifiable Rewards,” and used it alongside supervised fine-tuning and preference optimization rather than as a wholesale replacement for either [ 15 ] . The clearest large-scale demonstration is DeepSeek-R1: Guo and colleagues report training a model with reinforcement learning alone against a purely rule-based reward — combining an answer-correctness check with a format check, and deliberately avoiding a learned reward model because, in their account, a neural reward model “may suffer from reward hacking in large-scale reinforcement learning” — and observed pass@1 accuracy on the AIME 2024 competition-mathematics benchmark rise from 15.6 percent to 71.0 percent over training, reaching 86.7 percent with majority voting across 64 samples [ 14 ] . Formally, the reward itself is as simple as the reward model above was elaborate:

Read the equation in its article →

Sources cited in the surrounding passage

These citations give research context. Read each source to check which claims it supports.

Return to The Main Technical Approaches to AI Alignment, Compared

See this formula across 1 published context →

Browse the mathematical compendium →