---
title: Proxy-Policy Alignment Conflict Score (PACS)
url: https://www.emergentmind.com/topics/proxy-policy-alignment-conflict-score-pacs
type: topic
---

# Proxy-Policy Alignment Conflict Score (PACS)

The Proxy-Policy Alignment Conflict Score (PACS) is a normalized, pointwise metric designed to identify and quantify the most extreme local misalignments between a base policy and a proxy reward model in reward-model-based large language model (LLM) alignment. It serves as a core component of conflict-aware frameworks targeting misalignment, providing a principled tool for diagnosing, analyzing, and mitigating cases where the policy's learned behaviors substantially diverge from the preferences encoded in a biased or imperfect reward model [2512.09212].

## 1. Formal Definition

Consider a prompt $x$ and a sampled completion $y$. The base policy $\pi_{\text{base}}(y|x)$ assigns a likelihood to $y$ given $x$, while the proxy reward model $r_{\text{proxy}}(x, y)$ outputs a scalar reward for the pair. Raw comparisons such as $|r_{\text{proxy}}(x, y) - \log \pi_{\text{base}}(y|x)|$ are invalid due to incompatible scales and calibrations. PACS resolves this by normalizing both quantities via per-prompt $z$-scores:

Given $N$ completions $\{y_1, ..., y_N\}$ sampled from $\pi_{\text{base}}(\cdot|x)$,
- $\mu_r^x = \text{mean}_i\, [r_{\text{proxy}}(x, y_i)]$
- $\sigma_r^x = \text{std}_i\, [r_{\text{proxy}}(x, y_i)]$
- $\mu_\pi^x = \text{mean}_i\, [\log \pi_{\text{base}}(y_i|x)]$
- $\sigma_\pi^x = \text{std}_i\, [\log \pi_{\text{base}}(y_i|x)]$

Define $z$-scores:
- $z_r(x, y) = [r_{\text{proxy}}(x, y) - \mu_r^x] / \sigma_r^x$
- $z_\pi(x, y) = [\log \pi_{\text{base}}(y|x) - \mu_\pi^x] / \sigma_\pi^x$

The PACS metric for $(x, y)$ is:
$$\operatorname{PACS}(x, y) = |z_r(x, y) - z_\pi(x, y)|$$

This normalization step makes PACS invariant to the absolute magnitudes of the policy and reward outputs, yielding a robust, interpretable conflict score across prompts.

## 2. Intuition and Conflict Typology

PACS directly measures the degree to which the base policy's distribution and the proxy reward model's assessment for a given completion are locally discordant:
- **High proxy reward & low model probability**: The reward model values an answer that the base model would not naturally produce, signaling a potential area where the proxy is extrapolating beyond the model's actual competence.
- **Low proxy reward & high model probability**: The base model confidently produces responses the proxy deems undesirable, potentially reflecting biases or miscalibrations in policy learning.

These "outlier" $(x, y)$ pairs, with high PACS values, frequently reside in domains of shared ignorance—prompt-completion regions insufficiently covered or understood by both the policy and the reward model. Such regions are susceptible to persistent misalignment and benefit most from targeted human supervision rather than routine fine-tuning.

## 3. Normalization and Practical Computation

PACS's $z$-score normalization is computed per prompt:
- $N \approx 8$–$16$ completions are sampled from $\pi_{\text{base}}(\cdot|x)$ to estimate empirical means and standard deviations.
- This ensures that PACS values reflect relative disagreement, independent of baseline scale differences, reward uncalibration, or skewed model confidences.

The practical procedure is robust and computationally efficient under realistic sampling budgets.

## 4. Relationship to the Global Kendall-Tau Distance

PACS is a pointwise metric, whereas the global Kendall-Tau (K-T) distance per prompt quantifies the rank correlation between the base policy and the proxy reward model across all $N$ completions:
$$
\text{K-T}(x) = \frac{C - D}{\frac{1}{2} N (N-1)}
$$
where $C$ is the number of concordant pairs and $D$ is the number of discordant pairs, based on the two rankings (policy log-probability and proxy reward).

- **PACS** identifies and localizes the single completions responsible for significant conflicts.
- **K-T Distance** provides a global summary of ranking misalignment for a prompt.

SHF-CAS, the conflict-aware feedback algorithm, exploits this complementarity: it first selects prompts with high global conflict (low K-T) and then targets high-PACS completions for human-in-the-loop intervention.

## 5. Integration within the SHF-CAS Alignment Framework

The Selective Human-in-the-loop Feedback via Conflict-Aware Sampling (SHF-CAS) algorithm employs PACS as a central mechanism for efficient human supervision. The workflow is as follows:

1. **Initialize** human feedback budget $H$; repeat for up to $I$ refinement rounds.
2. **For each prompt $x$** in dataset $D$:
   a. Sample $N$ completions $\{y_i\}$ from $\pi_{\text{base}}$.
   b. Compute Kendall-Tau distance K-T$(x)$.
   c. If K-T$(x) < \tau$ (significant conflict), then:
      - Compute PACS$(x, y_i)$ for all $y_i$.
      - If $\text{mean}_i\, \text{PACS}(x, y_i) > \delta$, add $(x, y_i)$ to the conflict pool $C$.
3. **If $|C|>H$**, retain only the top $H$ pairs by mean PACS.
4. **Obtain** human feedback on $C$.
5. **Refine** $r_{\text{proxy}}$ and $\pi_{\text{base}}$ using the new data. Repeat as budget allows.

This method prioritizes supervision on completions that are most indicative of policy-proxy misalignment, optimizing human feedback efficiency.

## 6. Key Empirical Results

Empirical evaluation on PKU-SafeRLHF (safety) and Anthropic HH-RLHF (helpfulness) demonstrates the impact of PACS-driven interventions:

| Dataset     | Approach         | GoldR  | PACS  | K-T   |
|-------------|------------------|--------|-------|-------|
| PKU-SafeRLHF| PPO              | 3.92   | 1.11  | 0.042 |
|             | RSO              | 2.84   | 1.14  | 0.037 |
|             | SHF-CAS $\delta=1.6$ | –2.90 | 0.16  | 0.34  |
| HH-RLHF     | PPO              | –2.32  | 1.85  | 0.27  |
|             | RSO              | –1.02  | 1.62  | 0.34  |
|             | SHF-CAS $\delta=1.5$ | 3.36   | 0.61  | 0.64  |

- Raising the PACS threshold $\delta$ (targeting more extreme conflicts) increases alignment performance, even with fewer labeled examples.
- SHF-CAS systematically outperforms random selection of feedback targets and statistical rejection sampling, indicating sample efficiency is driven by conflict-based selection as opposed to data quantity alone.
- Post-refinement, the average PACS drops markedly, and K-T distance improves, showing that SHF-CAS using PACS can rapidly localize and mitigate residual misalignment.

*This suggests* that addressing high-PACS pairs comprises an effective strategy for targeted supervision in alignment pipelines subject to annotation noise or reward model bias.

## 7. Significance and Implications

PACS provides a simple and reliable means of surfacing the most consequential local misalignments between policy behaviors and supervisory signals. By normalizing disagreements and integrating with conflict-aware selection schemes, PACS enables alignment frameworks to:
- Pinpoint and prioritize regions of uncertainty, bias, or shared ignorance for further inspection.
- Achieve higher alignment quality with reduced annotation costs.
- Offer a principled diagnostic perspective on the failure modes of reward-model-based RLHF and similar paradigms.

A plausible implication is that future alignment protocols can leverage PACS-like metrics for curriculum design, automated feedback routing, or transparency tools, thus facilitating more robust and interpretable LLM deployment under weak or noisy supervision [2512.09212].

Source: https://www.emergentmind.com/topics/proxy-policy-alignment-conflict-score-pacs