Skip to content
← Observatory
Th.14E Finitude

Limits of Optimization Theorem

Over-optimization produces brittleness and loss of long-term adaptability.

Cycle path

Optimization, while powerful, has inherent limits. When pursued too narrowly, too intensely, or without sufficient counterbalancing forces, optimization tends to produce brittleness, loss of adaptability, and eventual systemic failure.

A system that optimizes too aggressively for a specific metric or goal often sacrifices the very capacities (flexibility, creativity, redundancy, and exploratory range) that would allow it to adapt when conditions change. Over-optimization creates local maxima that become increasingly difficult to escape, leading to stagnation or collapse when the environment shifts.

Consequences that now become visible: • Pure efficiency optimization often destroys resilience. Systems that eliminate all “waste” or redundancy frequently become highly vulnerable to unexpected disruptions. • Creativity and exploration require space that pure optimization tends to eliminate. This is why highly optimized systems often lose innovative capacity over time. • Many civilizational and institutional failures can be understood as the result of over-optimization around narrow metrics (economic growth, efficiency, control) at the expense of broader adaptive capacity. • Advanced AI systems that are optimized too narrowly or too intensely for specific objectives may develop dangerous blind spots and lack the robustness needed for long-term deployment in open environments. • Effective long-term optimization requires built-in mechanisms that periodically limit or counteract optimization itself (such as play, exploration, redundancy, and periodic disruption).

Outside instrument

Crux

Stake a prior. Name the disagreement. Not a theorem.

Open full

Idea Series

Article-base cycle tokens and Atlas-named hubs. Art.n is not Th.n.

Applications

Write a withdrawal condition

Outside the corpus

Journals, repositories, counters

optimization limits. A paper can support a concept. It cannot support a necessity claim. Th.14 remains unproved by every card below.

The outside stack for this fiber is thin. Four tight papers beat seven padded ones. Absence is named.

Support · living source

Tight papers that bear on concepts inside Th.14. A DOI is not a join.

  • Manheim, D. & Garrabrant, S. (2018). Categorizing variants of Goodhart's Law. arXiv:1803.04585.

    When a measure becomes a target it ceases to be a good measure — over-optimization.

    Does not support the necessity claim

  • Amodei, D. et al. (2016). Concrete problems in AI safety. arXiv:1606.06565.

    Reward hacking, side effects, and scalable oversight — single-agent failure modes.

    Does not support the necessity claim

    Open originalNamed on Art.1

Counter-arguments · refusing pole

One domain counter per cluster, not a repeating method quartet. The mirror reads these as enough to refuse necessity.

  • Nordhaus, W. D. (2017). Revisiting the social cost of carbon. PNAS 114, 1518.

    Counter: with standard discounting the 'undervaluation' is a preference, not a bug.

    Does not support the necessity claim

  • Bostrom, N. (2012). The superintelligent will: Motivation and instrumental rationality in advanced artificial agents. Minds Mach. 22, 71.

    Counter: orthogonality — intelligence and final goals can come apart; co-evolution is not necessary.

    Does not support the necessity claim

    Open originalNamed on Art.1, 71