Simulates a search-time instance of Goodhart's Law: the verifier/proxy score always rises with more search, but true accuracy rises then declines past a critical width for most methods. 180 configs, 6 methods. Ten sources (2021-2026) in test_time_compute_theory.py, including Gao et al.'s reward-overoptimization scaling laws, a formal best-of-N analysis, an ICML 2025 spotlight paper, and a 2026 paper extending the finding to beam search via extreme value theory.
© 2026 - Copyright AIKosh. All rights reserved.