Hostname: page-component-7b7567c8c-7pwfn Total loading time: 0 Render date: 2026-11-17T04:08:13.536Z Has data issue: false hasContentIssue false

PAC Learning and Occam’s Razor: Probably Approximately Incorrect

Published online by Cambridge University Press:  01 January 2022

Rights & Permissions [Opens in a new window]

Abstract

Computer scientists have provided a distinct justification of Occam’s Razor. Using the probably approximately correct framework, they provide a theorem that they claim demonstrates that we should favor simpler hypotheses. The argument relies on a philosophical interpretation of the theorem. I argue that the standard interpretation of the result in the literature is misguided and that a better reading does not, in fact, support Occam’s Razor at all. To this end, I state and prove a very similar theorem that, if interpreted the same way, would justify the contradictory Anti-Occam’s Razor—the principle that we should favor more complex hypotheses.

Information

Type
Research Article
Copyright
Copyright © The Philosophy of Science Association