The reviewed record of science sign in
Pith

arxiv: 2410.09638 · v1 · pith:TMOI5QCM · submitted 2024-10-12 · stat.ML · cs.AI· cs.LG· math.ST· stat.TH

On Goodhart's law, with an application to value alignment

Reviewed by Pithpith:TMOI5QCMopen to challenge →

classification stat.ML cs.AIcs.LGmath.STstat.TH
keywords goodhartmeasuregoalpoliciestruewhenassessdistinction
0
0 comments X
read the original abstract

``When a measure becomes a target, it ceases to be a good measure'', this adage is known as {\it Goodhart's law}. In this paper, we investigate formally this law and prove that it critically depends on the tail distribution of the discrepancy between the true goal and the measure that is optimized. Discrepancies with long-tail distributions favor a Goodhart's law, that is, the optimization of the measure can have a counter-productive effect on the goal. We provide a formal setting to assess Goodhart's law by studying the asymptotic behavior of the correlation between the goal and the measure, as the measure is optimized. Moreover, we introduce a distinction between a {\it weak} Goodhart's law, when over-optimizing the metric is useless for the true goal, and a {\it strong} Goodhart's law, when over-optimizing the metric is harmful for the true goal. A distinction which we prove to depend on the tail distribution. We stress the implications of this result to large-scale decision making and policies that are (and have to be) based on metrics, and propose numerous research directions to better assess the safety of such policies in general, and to the particularly concerning case where these policies are automated with algorithms.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Why Code, Why Now: An Information-Theoretic Perspective on the Limits of Machine Learning

    cs.LG 2026-02 unverdicted novelty 6.0

    Task information structure determines ML scaling success, with code's dense verifiable signals enabling predictable progress while sparse-feedback tasks like typical RL do not.