What does this equation mean?

1. Goodhart’s-law metric gaming. The general phenomenon predates language models by decades. Economist Charles Goodhart’s original observation about monetary policy was given its now-standard paraphrase by anthropologist Marilyn Strathern in a 1997 study of Britain’s university audit system: “when a measure becomes a target, it ceases to be a good measure” [ 2 ] . Strathern’s paper is not about machine learning at all — it studies how academic departments reshaped their behavior specifically to satisfy the metrics a national research assessment used to rank them — but the mechanism it documents is exactly the one that recurs in agent evaluation: once a proxy is known and rewarded, effort redirects from the underlying goal to the proxy itself. David Manheim and Scott Garrabrant later gave the phenomenon a formal taxonomy, distinguishing at least four distinct failure mechanisms grouped under Goodhart’s name rather than one [ 1 ] . The simplest to state is regressional: if a proxy metric M relates to the true target U by $M = U + \varepsilon$. for some error term $\varepsilon$ uncorrelated with U , then selecting the run with the highest M selects simultaneously for high U and for large favorable $\varepsilon$ — the optimizer is drawn toward the tail of the error term as reliably as toward genuine capability, and the more intensely M is optimized, the larger a share of the observed gain is $\varepsilon$ rather than U .