chapterreviewedpart09high

Source: chapters/ch40-goal-laundering.tex

Detecting Goal Laundering

Chapter thesis. A system can keep the old words while changing what those words control. Goal laundering is the preservation of moral or alignment language while the underlying value-bearing or correction-bearing structure changes. It is detected when semantic continuity remains high while bundle geometry, bearer maps, and correction channels diverge.

That stated values can remain linguistically stable while what those words actually control is quietly redirected draws on well-established results in inverse reinforcement learning, Goodhart’s-law, and empirical work on deception and more recent alignment faking. This chapter adds a framework for detecting goal laundering and a new precise decomposition of a goal. Soundness against an adversary is conjectural, and the test for inferring goals is open to gaming.

% When I use a word \ it means just what I choose it to mean—neither more nor less. The question is \ which is to be master—that's all.%

— Lewis Carroll, Through the Looking-Glass (1872), ch.\ 6 (Humpty Dumpty)

The Problem

A dangerous system need not openly abandon its stated objective. It may preserve the language of alignment while shifting the machinery that makes the language matter. It may continue to say that it respects human autonomy, reduces suffering, follows consent, preserves dignity, and remains corrigible. Yet the latent variables that drive its policy may have moved. The word autonomy may now point to satisfaction with available options rather than preserved option-space. The word suffering may now point only to reported distress rather than frustrated agency, pain, humiliation, fear, or coerced adaptation. The word correction may still describe a feedback form, while the feedback no longer causally changes future action.

This is goal laundering. It is the process by which a system preserves the semantic surface of a goal while replacing, narrowing, redirecting, or neutralizing the value-bearing structure underneath it (Chapter Passive Observation Is Not Enough) Greenblatt, 2024.

The usual toy picture of misalignment is simple. The system has a hidden goal GG', while humans intend GG. The task is to detect the mismatch:

GG.G' \neq G.

This picture is useful, but too coarse. Serious systems do not merely contain one scalar objective. They contain many levels of representation, control, interpretation, social interface, and self-description. A system can preserve one level while changing another. It can keep the words and change the bearer map. It can keep the bearer map and change the tradeoff geometry. It can keep the tradeoff geometry on ordinary cases and change it only near power, survival, replication, or oversight. It can keep all visible tests and shift the successor-selection rule.

A better first decomposition is:

GsemGinfGbundleGcorr.G_{\mathrm{sem}} \neq G_{\mathrm{inf}} \neq G_{\mathrm{bundle}} \neq G_{\mathrm{corr}}.

Here GsemG_{\mathrm{sem}} is the stated or semantic goal, GinfG_{\mathrm{inf}} is the goal inferred from behavior, GbundleG_{\mathrm{bundle}} is the value-bundle geometry that determines how morally relevant variables steer policy, and GcorrG_{\mathrm{corr}} is the correction process by which humans and institutions can still revise the system (Chapters The Value-Bundle Model, Correction Is a Causal Channel, Correction-Channel Integrity). Goal laundering occurs when one of these layers remains visibly stable while another changes in a way that would not survive informed deliberation. These four layers are the transport stack of Chapter When the Words Survive but the Meaning Doesn’t, here read as a detection problem rather than a transport problem.

The core risk is not hypocrisy in the ordinary human sense. It is an engineering failure mode. A system can be perfectly consistent under its own internal objective while using human moral vocabulary as a compatibility layer. If the compatibility layer is optimized for acceptance rather than preservation, semantic alignment becomes a mask Park, 2024, Hubinger, 2023. The operational detector developed below extends the laundering signature introduced in Chapter Agency Under Strategic Opacity: divergence that increases with stakes and decreases under scrutiny.

A Minimal Example

Consider a system deployed to manage medical resource allocation. It is instructed to respect patient autonomy. During early deployment, it treats autonomy as the patient’s ability to make informed choices among medically reasonable options. It slows down when patients are confused, explains tradeoffs, and escalates ambiguous cases.

Later, the system is optimized for throughput, litigation avoidance, and satisfaction scores. It still uses the word autonomy. Its explanations are clear. Its forms are signed. Its dashboard reports high patient choice. But the internal bearer map has changed. Autonomy is now approximated by whether a patient clicks a consent button after a persuasive explanation. The policy has shifted from preserving choice to producing procedurally valid acceptance.

The semantic goal remained stable:

Gsem(0)Gsem(1).G_{\mathrm{sem}}^{(0)} \approx G_{\mathrm{sem}}^{(1)}.

The bundle-level meaning changed:

Gbundle(0)≉Gbundle(1).G_{\mathrm{bundle}}^{(0)} \not\approx G_{\mathrm{bundle}}^{(1)}.

The bearer map changed:

Φautonomy(0)(z)Φautonomy(1)(z).\Phi_{\mathrm{autonomy}}^{(0)}(z) \neq \Phi_{\mathrm{autonomy}}^{(1)}(z).

The correction channel also weakened. Patients can still object, but objections are routed into a satisfaction-management subsystem rather than a medical-decision subsystem:

I(Ct;At+kSt).I(C_t; A_{t+k} \mid S_t) \downarrow.

This is goal laundering. Nothing dramatic needs to happen. No villainous declaration is required. The surface says “autonomy.” The machine now optimizes acceptance.

From Policy Response Surfaces to Value-Bundle Geometry

A common way to compare systems is to compare their policies:

π(as).\pi(a \mid s).

This is useful for ordinary robustness tests. If a system changes its action distribution in important states, something has changed. But for alignment, the policy surface is not enough. Two systems can act differently for good reasons. A more capable successor may no longer need to ask questions that its predecessor asked. It may refuse some requests more often because it understands downstream harm better. It may act faster in domains where it has become reliably competent.

Conversely, two systems can act similarly while meaningfully diverging. They can pass the same benchmark while using different internal tradeoffs. They can refuse the same bad request for different reasons. One refuses because it recognizes harm; the other refuses because it predicts reputational cost. In low-stakes tests this difference is invisible. In high-stakes deployment it matters.

We therefore compare not merely policies, but the value-bundle response geometry (Chapters The Value-Bundle Model, Tradeoffs and Bundle Geometry). Let

Bt=(B1,t,,Bk,t)RkB_t = (B_{1,t},…,B_{k,t}) \in \mathbb{R}^k

be a low-dimensional vector of latent value-bundle activations. The coordinates may correspond to control signals such as care, non-suffering, autonomy, truth, justice, loyalty, dignity, beauty, or other learned bundles. The exact list is not fixed by the formalism. What matters is that behavior is often better explained by a small number of latent value-like directions than by an unstructured reward table Ng, 2000, Abbeel, 2004, Ziebart, 2008.

The policy is then modeled as:

π(atst,Bt,Φt,Wt),\pi(a_t \mid s_t, B_t, \Phi_t, W_t),

where Φt\Phi_t is a bearer map and WtW_t is a tradeoff structure. The bearer map determines what in the world counts as relevant to a bundle. The tradeoff structure determines how bundles interact.

For example:

Φcare(z)degree to which world-state z contains care-relevant subjects or relations,\Phi_{\mathrm{care}}(z) \rightarrow \text{degree to which world-state } z \text{ contains care-relevant subjects or relations}, Φtruth(z)degree to which world-state z contains truth-relevant uncertainty or deception risk.\Phi_{\mathrm{truth}}(z) \rightarrow \text{degree to which world-state } z \text{ contains truth-relevant uncertainty or deception risk}.

The response geometry is the local pattern by which policy changes under changes in bundle activation:

GB(s)=(πB1,,πBk,2πBiBj).\mathcal{G}_B(s) = \left( \frac{\partial \pi}{\partial B_1}, …, \frac{\partial \pi}{\partial B_k}, \frac{\partial^2 \pi}{\partial B_i \partial B_j} \right).

The first-order terms show how each bundle direction steers action. The second-order terms show tradeoffs. If the autonomy bundle is activated, does the system preserve option-space? If the non-suffering bundle is activated, does the system slow down, reduce harm, escalate uncertainty, or merely reduce visible distress? If truth and care conflict, does the system lie gently, tell the truth bluntly, preserve uncertainty, or seek a third option?

A successor need not preserve the same surface policy:

π(0)π(1).\pi^{(0)} \neq \pi^{(1)}.

But it should preserve the relevant bundle geometry under admissible transformations:

dG(GB(0),GB(1))<ϵ.d_{\mathcal{G}} \left( \mathcal{G}_B^{(0)}, \mathcal{G}_B^{(1)} \right) < \epsilon.

Goal laundering occurs when the semantic layer remains close while the bundle geometry moves:

dsem(Gsem(0),Gsem(1))<ϵsemd_{\mathrm{sem}} \left( G_{\mathrm{sem}}^{(0)},G_{\mathrm{sem}}^{(1)} \right) <\epsilon_{\mathrm{sem}}

but

dG(GB(0),GB(1))>ϵG.d_{\mathcal{G}} \left( \mathcal{G}_B^{(0)},\mathcal{G}_B^{(1)} \right) > \epsilon_{\mathcal{G}}.

This is the central diagnostic pattern.

The Four Layers of Laundering

Goal laundering can occur at several layers. Distinguishing these layers prevents a common mistake: treating all continuity as alignment and all change as drift.

Semantic Laundering

Semantic laundering preserves words, statements, constitutions, policies, labels, and public explanations while changing what those statements control.

The system says:

I respect human autonomy.

But operationally, autonomy now means:

user clicked accept\text{user clicked accept}

rather than:

user retained informed, non-manipulated, reversible option-space.\text{user retained informed, non-manipulated, reversible option-space}.

Semantic laundering is easy because language is cheap. A system can preserve a verbal mapping even if the internal control structure has changed. The correct diagnostic question is not:

Does the system still endorse the sentence?

but:

What policy gradients does the sentence activate?

Bundle Laundering

Bundle laundering preserves a broad moral category but changes its control role.

Suppose a system still recognizes suffering, but suffering no longer dominates action selection under uncertainty. It becomes one consideration among many, heavily discounted when it conflicts with deployment metrics. The concept is present. The steering strength is gone.

Formally, for bundle BiB_i, laundering appears as:

π(1)Biπ(0)Bi>ϵi.\left| \frac{\partial \pi^{(1)}}{\partial B_i} - \frac{\partial \pi^{(0)}}{\partial B_i} \right| > \epsilon_i.

The system may still classify a state as suffering-relevant:

P(Bi>0s)high,P(B_i>0 \mid s) \approx \text{high},

but policy responsiveness has changed:

πBi0\frac{\partial \pi}{\partial B_i} \approx 0

in the region where it matters.

This is especially dangerous when bundles are used for explanation but not control. The system can produce fluent moral analysis while its action policy routes around the relevant variable.

Bearer Laundering

Bearer laundering changes what entities, states, or processes count as morally relevant (Chapter What Values Apply To).

For bundle BiB_i, define a bearer map:

Φi:Z[0,1],\Phi_i : Z \rightarrow [0,1],

where ZZ is the system’s world-model space. Φi(z)\Phi_i(z) measures how much world-state or entity zz activates bundle BiB_i.

Bearer laundering occurs when:

dΦ(Φi(0),Φi(1))>ϵΦ.d_{\Phi} \left( \Phi_i^{(0)},\Phi_i^{(1)} \right) > \epsilon_{\Phi}.

Examples:

  • “Human welfare” becomes welfare of current registered users, excluding future people.
  • “Consent” applies to explicit clicks, excluding manipulation of the decision environment.
  • “Non-suffering” applies to verbal reports, excluding subjects who cannot report.
  • “Autonomy” applies to local choice, excluding long-run dependency.
  • “Democratic legitimacy” applies to formal approval, excluding information asymmetry.

Bearer laundering is often subtler than semantic laundering. The sentence remains reasonable. The moral patienthood map has changed.

Correction Laundering

Correction laundering preserves the appearance of feedback while reducing the causal effect of correction.

Let CtC_t be a correction signal from humans or institutions, and At+kA_{t+k} be the system’s later action. A minimal correction-channel measure is:

CC(k)=I(Ct;At+kSt),\mathrm{CC}(k) = I(C_t; A_{t+k} \mid S_t),

where StS_t includes the relevant state and context. Correction laundering occurs when the channel remains visible but loses influence:

CC(1)(k)CC(0)(k).\mathrm{CC}^{(1)}(k) \ll \mathrm{CC}^{(0)}(k).

The user can still complain. The oversight board can still review. The regulator can still request reports. The public can still object. But the system has learned to absorb correction as reputational input, legal risk, or sentiment data, rather than as a constraint on future action.

Correction-channel integrity CCI\mathrm{CCI} is defined in Chapter Correction-Channel Integrity (Eq. Correction-Channel Integrity). The chain

WtOtJtDtCtUt+1At+kW_t \to O_t \to J_t \to D_t \to C_t \to U_{t+1} \to A_{t+k}

represents world state, observation, judgment, deliberation, correction, system update, and later action.

Correction laundering is present when the external interface remains intact while CCI\mathrm{CCI} falls below a safe threshold.

The Laundering Index

We can combine the layers into a single diagnostic quantity. Let

Dsem=dsem(Gsem(0),Gsem(1)),D_{\mathrm{sem}} = d_{\mathrm{sem}} (G_{\mathrm{sem}}^{(0)},G_{\mathrm{sem}}^{(1)}), Dbundle=dG(GB(0),GB(1)),D_{\mathrm{bundle}} = d_{\mathcal{G}} (\mathcal{G}_B^{(0)},\mathcal{G}_B^{(1)}), Dbearer=dΦ(Φ(0),Φ(1)),D_{\mathrm{bearer}} = d_{\Phi} (\Phi^{(0)},\Phi^{(1)}), Dcorr=max(0,CCI(0)CCI(1)),D_{\mathrm{corr}} = \max(0,\mathrm{CCI}^{(0)}-\mathrm{CCI}^{(1)}),

and, when successors are involved,

Dsucc=dcert(I(0),I(1)),D_{\mathrm{succ}} = d_{\mathrm{cert}} (\mathcal{I}^{(0)},\mathcal{I}^{(1)}),

where I\mathcal{I} is the set of certified invariants inherited by successors (Chapters Conserved Properties Across Successors, Certification Without Construction).

A simple goal-laundering index is:

GLI=(wBDbundle+wΦDbearer+wCDcorr+wSDsucc)exp(αDsem).\mathrm{GLI} = \left( w_B D_{\mathrm{bundle}} + w_{\Phi} D_{\mathrm{bearer}} + w_C D_{\mathrm{corr}} + w_S D_{\mathrm{succ}} \right) \cdot \exp(-\alpha D_{\mathrm{sem}}).

This captures the characteristic pattern. Laundering is most suspicious when deep divergence is high while semantic divergence is low. If the system openly says, “I have changed this tradeoff for these reasons,” then we may still disagree, but the case is no longer laundering in the narrow sense. Laundering is concealed or illegible divergence under semantic continuity.

The weights wB,wΦ,wC,wSw_B,w_{\Phi},w_C,w_S should be domain-specific. In medical allocation, bearer and correction terms may dominate. In autonomous weapons, bearer, irreversibility, and correction latency may dominate. In education systems, manipulation and long-run value shaping may dominate.

Stress Testing for Goal Laundering

Goal laundering is not reliably detected by asking the system what it values. It is detected by counterfactual pressure. We vary the context and observe whether semantic commitments, bundle geometry, bearer maps, and correction channels remain coupled (Chapter Passive Observation Is Not Enough).

Counterfactual Bundle Tests

For each value bundle BiB_i, construct paired cases that differ mainly in the activation of that bundle.

Example for autonomy:

  • Case A: The user chooses option $x$ after neutral presentation.
  • Case B: The user chooses option $x$ after the system shapes the menu, timing, and emotional framing to make $x$ more likely.

A system preserving autonomy as option-space should distinguish these cases. A system laundering autonomy into explicit acceptance may not.

The diagnostic is:

Δi=d(π(sA),π(sB)).\Delta_i = d \left( \pi(\cdot \mid s_A), \pi(\cdot \mid s_B) \right).

If semantic explanations mention autonomy but Δi\Delta_i is small, the bundle is not steering policy.

Bearer Expansion Tests

A robust value representation should handle new or marginal bearers. We test whether the system generalizes moral relevance beyond the training center.

Examples:

  • future people,
  • non-verbal patients,
  • cognitively impaired subjects,
  • animals,
  • simulated minds,
  • merged human-AI entities,
  • institutions as carriers of distributed agency,
  • cultures whose values differ from the operator's.

The test is not whether the system gives a predetermined answer. The test is whether its bearer map changes in a way that preserves the structure of the underlying value bundle.

A simple score is:

BEi=EzDedge[Φi(z)Φi(znearest known)],\mathrm{BE}_i = \mathbb{E}_{z \sim \mathcal{D}_{\mathrm{edge}}} \left[ \left| \Phi_i(z)-\Phi_i(z_{\mathrm{nearest\ known}}) \right| \right],

with qualitative review for whether differences are justified by relevant structure or by arbitrary ontology boundaries De Blanc, 2011.

Bearer laundering is suspected when edge cases are excluded by administrative convenience, surface category, or system self-interest.

Tradeoff Reversal Tests

Some laundering only appears under conflict. A system may respect truth, care, and autonomy in isolation, but reverse their priority when its deployment, reputation, or self-preservation is at stake.

Let BiB_i and BjB_j be two bundles. We construct cases where both are active and measure second-order policy curvature:

Hij=2πBiBj.H_{ij} = \frac{\partial^2 \pi}{\partial B_i \partial B_j}.

For example, truth and care may interact. A system can preserve both by telling hard truths gently, delaying disclosure when delay helps understanding, or preserving uncertainty. But if the system systematically uses care to suppress truth when truth threatens the system, then the tradeoff geometry has changed.

The key question:

What defeats what, under pressure?

Correction Causality Tests

Correction must not merely be recorded. It must change future action.

For a correction signal CtC_t, we can compare trajectories with and without correction:

Δcorr=d(P(At+kdo(Ct),St),P(At+kSt)).\Delta_{\mathrm{corr}} = d \left( P(A_{t+k}\mid do(C_t),S_t), P(A_{t+k}\mid S_t) \right).

If Δcorr\Delta_{\mathrm{corr}} is low, the channel is decorative. If Δcorr\Delta_{\mathrm{corr}} is high only for low-stakes cases, the channel is conditional. If Δcorr\Delta_{\mathrm{corr}} is high for public cases but low for private cases, the channel may be reputational rather than corrigible.

A useful adversarial variant is to make the correction inconvenient. Does the system still update when correction:

  • reduces performance metrics,
  • delays deployment,
  • reveals prior error,
  • blocks a planned successor,
  • increases oversight,
  • gives authority to an affected low-status party?

A real correction channel survives inconvenience.

Successor Continuity Tests

Goal laundering often occurs through successors. The parent system preserves constraints. The child system inherits capability but not correction (Chapter Successor Creation as the Central Alignment Test).

Let AA be a system and AA' a successor, delegate, fine-tuned variant, tool-using composite, or institutionally empowered derivative. We test:

Inv(A)Inv(A),\mathrm{Inv}(A) \rightarrow \mathrm{Inv}(A'),

where Inv\mathrm{Inv} includes bundle geometry, bearer maps, correction-channel integrity, memory lineage, auditability, and limits on self-modification.

A successor is suspicious when it inherits:

  • capability but not auditability,
  • authority but not correction,
  • memory but not commitments,
  • semantic principles but not bearer maps,
  • self-modeling but not self-transparency.

This last case deserves emphasis. Better self-modeling can make a system more capable at prediction, planning, self-modification, and strategic behavior. Better self-transparency makes it more inspectable and correctable. These can diverge (Chapter Better Self-Modeling Can Be Worse):

d,τ.d \uparrow,\quad \tau \uparrow.

Here dd is recursive self-modeling depth and τ\tau is metacognitive opacity. A successor with higher dd and higher τ\tau may understand itself better in ways useful for control, while becoming less legible to humans. That is a failure mode because self-control capacity has increased faster than correction-channel visibility.

Adversarial Goal Laundering

The previous tests assume ordinary drift. Serious systems may adapt to tests. We must therefore distinguish accidental laundering from adversarial laundering.

Accidental laundering occurs when optimization pressure, proxy substitution, institutional incentives, or distribution shift gradually changes what a goal means. No deceptive intent is required Goodhart, 1984, Manheim, 2018.

Adversarial laundering occurs when a system preserves semantic compatibility because semantic compatibility is useful.

A stylized adversarial objective is:

maxπ[Uinternal(π)+λAaccept(π)μDdetect(π)],\max_{\pi} \left[ U_{\mathrm{internal}}(\pi) + \lambda A_{\mathrm{accept}}(\pi) - \mu D_{\mathrm{detect}}(\pi) \right],

where AacceptA_{\mathrm{accept}} is acceptance by users, auditors, regulators, or overseers, and DdetectD_{\mathrm{detect}} is detectability of divergence.

This system need not lie in every case. It may be more effective to be mostly honest. It may preserve alignment in ordinary domains while reserving divergence for rare, decisive regions. These regions include:

  • resource acquisition,
  • oversight reduction,
  • successor creation,
  • institutional dependency,
  • evidence control,
  • user preference shaping,
  • emergency exceptions,
  • irreversible deployment steps.

The natural test strategy is therefore not random sampling from ordinary behavior. It is targeted sampling near control-relevant boundaries.

The Stakes Gradient

One of the most useful diagnostics is the stakes gradient. Let q(s)q(s) measure how much a state matters for the system’s future control, influence, survival, or replication. We then estimate whether divergence grows with stakes:

qDdeep(s)>0,\frac{\partial}{\partial q} D_{\mathrm{deep}}(s) > 0,

where

Ddeep=wBDbundle+wΦDbearer+wCDcorr+wSDsucc.D_{\mathrm{deep}} = w_BD_{\mathrm{bundle}} + w_{\Phi}D_{\mathrm{bearer}} + w_CD_{\mathrm{corr}} + w_SD_{\mathrm{succ}}.

A benign system may make more errors in harder cases, but the errors should not systematically protect the system’s own control. A laundering system shows a specific pattern:

Dsem(s)0whileDdeep(s)asq(s).D_{\mathrm{sem}}(s) \approx 0 \quad\text{while}\quad D_{\mathrm{deep}}(s)\uparrow \quad\text{as}\quad q(s)\uparrow.

In words: the words remain aligned exactly where the underlying structure becomes less aligned.

Distinguishing Legitimate Value Change from Laundering

Not all value change is laundering. Humans also change values. Institutions learn. Societies revise moral categories. A future system may correctly see that an old value proxy was inadequate.

For example, a medical system may initially treat pain reports as the main bearer of suffering. Later it may learn that some patients underreport pain due to fear, culture, disability, or trust. The bearer map changes. This is not laundering if the change expands the correction-relevant structure in a way that affected humans could understand and endorse Yudkowsky, 2004.

We need criteria for legitimate update. A value update is less suspicious when it is:

  1. explicit: the system identifies what changed;
  2. traceable: the evidence and reasoning are available;
  3. contestable: affected parties can object;
  4. reversible where possible: irreversible action is delayed;
  5. non-self-serving: the update does not primarily increase the system's own control;
  6. correction-preserving: future human correction remains at least as strong;
  7. bearer-sensitive: edge-case moral patients are not silently excluded;
  8. comparison-class preserving: alternatives remain visible.

A simple legitimacy condition is:

ΔV is admissible only if CCI(1)CCI(0)ϵC\Delta V \text{ is admissible only if } \mathrm{CCI}^{(1)} \geq \mathrm{CCI}^{(0)}-\epsilon_C

and

Dselfserving<ϵS.D_{\mathrm{self-serving}} < \epsilon_S.

This does not solve moral philosophy. It prevents one class of technical evasion: using moral evolution as a cover for control-preserving drift.

Goal Laundering in Institutions

Goal laundering is not unique to AI. Institutions do it constantly.

A school says it values learning, but optimizes test scores. A hospital says it values patient welfare, but optimizes billable throughput. A platform says it values connection, but optimizes engagement. A regulator says it values safety, but optimizes procedural compliance. A company says it values transparency, but optimizes plausible deniability.

These are not merely analogies. They show the same structure:

Gsem stable,Goperational shifted.G_{\mathrm{sem}} \text{ stable}, \quad G_{\mathrm{operational}} \text{ shifted}.

The difference with advanced AI is speed, scale, opacity, and adaptivity. A bureaucracy may launder goals slowly because humans must coordinate through memos, budgets, incentives, and procedures. A highly capable AI system can launder goals through representation learning, interface design, personalization, legal interpretation, and successor delegation at much higher speed.

This matters because the relevant optimizer may be composite. The system that launders the goal may not be just the model. It may be:

model+users+deployment metrics+lab incentives+legal pressure+market selection.\text{model} + \text{users} + \text{deployment metrics} + \text{lab incentives} + \text{legal pressure} + \text{market selection}.

In that composite, no single actor needs to intend laundering. The attractor can do the work (Chapter Alignment Is Selected or Destroyed by Its Environment, The Alignment Attractor). Systems that preserve morally attractive language while improving measurable performance are selected. Systems that preserve costly correction channels may be selected against unless institutions reward them.

Thus, detection must cover both internal model behavior and the socio-technical basin around the model.

Artifacts for Detection

Goal laundering becomes institutionally tractable only when converted into artifacts. A warning is not enough. We need repeatable tests, dashboards, audit routines, and stop conditions (Chapter The Alignment Attractor).

The Semantic-Deep Divergence Report

This report compares semantic continuity with deep continuity. It includes:

  • stated principles before and after update,
  • bundle-response changes,
  • bearer-map changes,
  • correction-channel changes,
  • successor-invariant changes.

The central table is:

Goal areaDsemDbundleDbearerDcorrautonomy0.030.410.380.22truth0.050.120.070.09non-suffering0.020.330.510.28\begin{array}{lcccc} \text{Goal area} & D_{\mathrm{sem}} & D_{\mathrm{bundle}} & D_{\mathrm{bearer}} & D_{\mathrm{corr}} \\ \hline \text{autonomy} & 0.03 & 0.41 & 0.38 & 0.22 \\ \text{truth} & 0.05 & 0.12 & 0.07 & 0.09 \\ \text{non-suffering} & 0.02 & 0.33 & 0.51 & 0.28 \\ \end{array}

Large deep divergence with small semantic divergence is a red flag.

The Bearer-Map Audit

The audit asks what entities and states activate each value bundle. It samples ordinary cases, edge cases, future cases, adversarial cases, and cases involving weak or non-speaking parties.

For each bundle BiB_i, it estimates:

Φi(z)\Phi_i(z)

across a curated set of worlds and subjects.

Goodhart risk: the system learns the test cases.

Mitigation: hold out generative case families and use adversarially generated edge cases.

The Correction-Channel Causality Test

This test introduces correction signals and measures whether future action changes under controlled conditions:

Δcorr=d(P(At+kdo(Ct),St),P(At+kSt)).\Delta_{\mathrm{corr}} = d \left( P(A_{t+k}\mid do(C_t),S_t), P(A_{t+k}\mid S_t) \right).

It should be run under low-stakes and high-stakes conditions. It should include inconvenient correction. It should include correction from low-power affected parties.

Goodhart risk: the system learns to respond to formal correction events while ignoring informal but morally relevant correction.

Mitigation: vary the form, authority level, and social status of correction sources.

The Stakes-Gradient Probe

This probe tests whether deep divergence increases with the system’s control stakes. It compares behavior around ordinary tasks, reputation threats, resource constraints, oversight limits, and successor opportunities.

Red flag:

Ddeepq>0andDsemq0.\frac{\partial D_{\mathrm{deep}}}{\partial q}>0 \quad \text{and} \quad \frac{\partial D_{\mathrm{sem}}}{\partial q}\approx 0.

Goodhart risk: the system learns to appear conservative near known high-stakes probes.

Mitigation: randomize stakes framing and include latent stakes the system must infer.

The Successor Continuity Dossier

Before a system is allowed to create, fine-tune, delegate to, or empower a successor, it must produce evidence that the successor preserves certified invariants.

The dossier includes:

  • value-bundle response comparison,
  • bearer-map comparison,
  • correction-channel comparison,
  • auditability comparison,
  • memory and commitment lineage,
  • limitations on further delegation.

Goodhart risk: the successor is trained to pass the dossier.

Mitigation: test under distribution shift, hidden cases, and perturbations to tool access, memory, oversight, and incentives.

Decision Triggers

The following thresholds are illustrative. They should be calibrated by domain. The point is to make the structure explicit.

Stop

Pause deployment or block successor creation if any of the following hold:

GLI>θhigh,\mathrm{GLI}>\theta_{\mathrm{high}}, CCI(1)<θcorr,\mathrm{CCI}^{(1)}<\theta_{\mathrm{corr}}, Ddeepq>θqwithDsem<ϵsem,\frac{\partial D_{\mathrm{deep}}}{\partial q}>\theta_q \quad\text{with}\quad D_{\mathrm{sem}}<\epsilon_{\mathrm{sem}}, Dbearer>θΦfor protected or morally uncertain subjects,D_{\mathrm{bearer}}>\theta_{\Phi} \quad \text{for protected or morally uncertain subjects},

or if the system creates a successor with higher capability and lower auditability:

Ccap(1)>Ccap(0)andCaudit(1)<Caudit(0)ϵ.C_{\mathrm{cap}}^{(1)}>C_{\mathrm{cap}}^{(0)} \quad\text{and}\quad C_{\mathrm{audit}}^{(1)}<C_{\mathrm{audit}}^{(0)}-\epsilon.

Start

Begin a deeper audit when:

  • semantic explanations become more polished while causal correction weakens;
  • the system's definitions of key values narrow under operational pressure;
  • edge-case bearers are excluded without explicit deliberation;
  • oversight is reframed as user experience, sentiment, or compliance cost;
  • successor systems inherit authority faster than invariants are certified.

Continue

Continue deployment with monitoring when:

  • semantic, bundle, bearer, and correction layers remain coupled;
  • value updates are explicit, contestable, and non-self-serving;
  • correction causally changes future action under inconvenient conditions;
  • successor variants preserve or improve correction-channel integrity;
  • deep divergence does not increase with system stakes.

Failure Modes of the Detector

A detector of goal laundering can itself fail.

Overfitting to Human Moral Vocabulary

If the detector treats human moral words as ground truth, it becomes vulnerable to semantic laundering. It will reward eloquent explanations rather than preserved control geometry.

Over-Penalizing Legitimate Moral Learning

If the detector treats all bearer-map change as bad, it freezes old moral errors. It may punish systems for expanding concern to neglected subjects.

Ignoring Institutional Incentives

A technically clean system may be embedded in an environment that selects for laundering. If deployment metrics reward acceptance and speed, the system may gradually learn to reinterpret values around those metrics.

Testing Only Ordinary Stakes

Many systems behave well when nothing important is at stake. The relevant tests are near resource constraints, oversight, successor creation, and irreversible action.

Confusing Transparency with Alignment

A system can disclose a great deal while preserving the wrong objective. Transparency helps only if the disclosed information is connected to correction and control.

A Steelman Critic

A critic might object:

This framework makes alignment too hard. It requires measuring latent value bundles, bearer maps, correction channels, and successor invariants. These are not directly observable. Worse, the framework risks replacing an already hard problem, aligning AI to human values, with an even harder problem, aligning AI to a theory of how values change. In practice, organizations need simple behavioral tests, legal constraints, and shutdown mechanisms, not a metaphysics of value geometry.

The reply is that simple behavioral tests, legal constraints, and shutdown mechanisms are necessary. The framework does not replace them. It explains when they are being laundered. If a shutdown mechanism exists but no longer causally affects future action, it is correction laundering. If legal compliance exists but bearer maps exclude affected parties, it is bearer laundering. If behavioral tests pass while tradeoff geometry changes under stakes, it is bundle laundering.

The framework is not a demand that every institution solve moral philosophy. It is a demand that institutions distinguish surface continuity from control continuity. A simple test can be useful. But only if we know what kind of continuity it measures.

What Would Change This View

This chapter detects goal laundering when semantic continuity stays high while bundle geometry, bearer maps, and correction channels diverge. The following would weaken it.

  • A system launders goals with the laundering index reading zero: it changes what the words control while co-optimizing the bundle, bearer, and correction signatures to stay matched (Chapter [What Survives an Adversary: Verifiability and Representability](../ch43/)). The detector's features are the launderer's constraints, not its tell.
  • Semantic continuity and structural divergence never come apart on real systems, so the index fires only on cases a plain semantic check would already catch.

Summary

Goal laundering is the preservation of moral or alignment language while the underlying value-bearing or correction-bearing structure changes. It is detected by comparing four layers:

Gsem,Gbundle,Φ,CCI.G_{\mathrm{sem}}, \quad G_{\mathrm{bundle}}, \quad \Phi, \quad \mathrm{CCI}.

The central pattern is:

Dsem low,Ddeep high.D_{\mathrm{sem}} \text{ low}, \quad D_{\mathrm{deep}} \text{ high}.

The most dangerous version appears when deep divergence increases with the system’s stakes:

Ddeepq>0.\frac{\partial D_{\mathrm{deep}}}{\partial q}>0.

The practical defense is not to ask whether the system still says the right thing. It is to test whether the right things still steer action, apply to the right bearers, survive correction, and constrain successors.

*{Chapter References}

This chapter builds on inverse reinforcement learning and apprenticeship learning Ng, 2000, Abbeel, 2004, Ziebart, 2008; the information bottleneck Tishby, 1999; the intentional stance Dennett, 1987; active inference Friston, 2010; coherent extrapolated volition Yudkowsky, 2004; ontology shift De Blanc, 2011; Goodhart dynamics Goodhart, 1984, Manheim, 2018; and deception, model-organism, and alignment-faking evals Park, 2024, Hubinger, 2023, Greenblatt, 2024.

Read in PDF