Point-Biserial Correlation Coefficient (PBC)

• PBC is a statistical measure that quantifies the linear relationship between a binary outcome and a continuous variable, aiding in uncertainty evaluation.
• It computes Pearson correlation by comparing means and variances of uncertainty measures for dichotomous rewards, ensuring precise alignment metrics.
• PBC guides active learning in reinforcement learning by identifying instances where high uncertainty aligns with incorrect responses, optimizing sample selection.

The point-biserial correlation coefficient (PBC) is a statistical measure evaluating the association between a dichotomous (binary) variable and a continuous variable. In the context of reinforcement learning with verifiable reward (RLVR), PBC quantifies the alignment between the model's subjective uncertainty and objective correctness signals, providing a principled way to guide active learning and query selection. Strong negative point-biserial correlation indicates effective uncertainty consistency, where high model uncertainty tends to coincide with incorrect responses, and low uncertainty with correct responses, thereby informing the selection of informative samples for RL updates (Yi et al., 30 Jan 2026).

1. Formal Definition and Statistical Properties

Suppose $R\in\{0,1\}$ is a binary random variable (e.g., "response is correct" vs. "incorrect") and $U$ is a continuous variable representing model subjective uncertainty (such as entropy, margin, or perplexity). The point-biserial correlation coefficient $r_{pb}$ is defined as the Pearson correlation between $R$ and $U$. Let:

• $K_1$ = number of samples with $R=1$
• $K_0$ = number of samples with $R=0$
• $K = K_0 + K_1$
• $U$0 = mean of $U$1 for samples with $U$2
• $U$3 = mean of $U$4 for samples with $U$5
• $U$6 = standard deviation of $U$7 over all $U$8 samples
• $U$9 = overall mean of $r_{pb}$0

The coefficient is given by:

$r_{pb}$1

Interpretation:

• $r_{pb}$2: Higher uncertainty aligns with correct responses.
• $r_{pb}$3: Higher uncertainty aligns with incorrect responses.

In RLVR for mathematical reasoning, a strong negative $r_{pb}$4 is preferred, reflecting that the model expresses greater uncertainty for wrong answers, while being certain when correct (Yi et al., 30 Jan 2026).

2. Calculation in Offline RLVR Settings

For each training query $r_{pb}$5, generate $r_{pb}$6 candidate responses $r_{pb}$7. For each response $r_{pb}$8:

• $r_{pb}$9 is the Bernoulli reward (correctness).
• $R$0 is the subjective uncertainty, computed under a fixed reference policy.

Mathematically, define:

• $R$1, $R$2
• $R$3
• $R$4
• $R$5, where $R$6

Hence,

$R$7

A worked example (for $R$8, $R$9, $U$0) yields $U$1, indicating the model is less confident about wrong answers (Yi et al., 30 Jan 2026).

3. Interpretation as an Uncertainty Consistency Metric

The PBC directly operationalizes the notion of uncertainty consistency:

• A negative $U$2 demonstrates that the model's uncertainty estimates are high precisely when its outputs are incorrect, and low when correct.
• Selecting queries with strongly negative $U$3 identifies instances where subjective and objective uncertainties are well-aligned, maximizing informativeness for RL-driven policy updates.

This methodology supports identifying queries that are likely to yield the greatest benefit during RLVR, especially when annotation budgets are constrained (Yi et al., 30 Jan 2026).

4. Online Analogue and Theoretical Relationship

In on-policy RL, it is often infeasible to compute offline PBC with large $U$4 at each step due to cost and non-stationarity. An online variant is introduced:

$U$5

where:

• $U$6 is the normalized (group-standardized) advantage of the $U$7th response ($U$8 for above-mean reward, $U$9 otherwise).
• $K_1$0 is the subjective uncertainty for the current policy parameters $K_1$1.
• $K_1$2 is a balancing hyperparameter.

This measure acts as a weighted difference of (advantage)/(uncertainty) segregated by response quality. Key theoretical results:

• $K_1$3, so large positive $K_1$4 correlates with low (good) offline PBC.
• Under assumptions including gradient orthogonality and bounded magnitude, maximizing $K_1$5 at each step simultaneously minimizes total subjective uncertainty $K_1$6, optimizing sample informativeness for RL learning.

5. Practical Considerations and Limitations

Several constraints govern the application of PBC and its variants:

• Sample size ($K_1$7): Offline PBC estimation requires a substantial number of candidate responses (e.g., $K_1$8), which is compute-intensive.
• Model non-stationarity: Since the policy evolves during RL, offline PBC values computed on initial reference policies become biased as training progresses.
• Online efficiency: The online version incurs lower cost (few samples per minibatch) but introduces a hyperparameter ($K_1$9) and relies on unverified assumptions about gradient structure.
• Reward type: Metrics require binary (dichotomous) rewards. Extension to graded/continuous rewards necessitates alternative measures (biserial, polyserial, or full Pearson/Spearman correlations).
• Uncertainty characteristics: For heavy-tailed or non-Gaussian uncertainty distributions, rank correlations (e.g., Kendall’s $R=1$0, Spearman’s $R=1$1) may be more robust.

6. Generalizations, Extensions, and Applications

PBC facilitates informed active learning, query screening, and policy improvement:

• Multiclass or continuous rewards: For $R=1$2, deploy point-polyserial or correlation measures suitable for continuous data.
• Alternative uncertainty measures: In the presence of outliers or heavy tails in $R=1$3, use rank-based metrics.
• Active learning in broader settings: Offline PBC can guide selection among unlabeled instances in other contexts by estimating $R=1$4 via techniques like MC-dropout and calculating surrogate PBC.
• Promoting sample diversity: To avoid redundancy, combine PBC selection with diversity penalties (e.g., core-set or clustering-based approaches).

In the RLVR domain, using PBC and its online analogue to maximize the alignment between model-reported and verifiable uncertainties supports effective sample selection. This enables preservation or improvement in model performance while substantially reducing annotation and compute costs (Yi et al., 30 Jan 2026).