Ockham Efficiency Theorem for Stochastic Empirical Methods
| Abstract | Ockham’s razor is the principle that, all other things being equal, scientists ought to prefer simpler theories. In recent years, philosophers have argued that simpler theories make better predictions, possess theoretical virtues like explanatory power, and have other pragmatic virtues like computational tractability. However, such arguments fail to explain how and why a preference for simplicity can help one find true theories in scientific inquiry, unless one already assumes that the truth is simple. One new solution to that problem is the Ockham efficiency theorem (Kelly 2002, 2004, 2007a-d, Kelly and Glymour 2004), which states that scientists who heed Ockham’s razor retract their opinions less often and sooner than do their non-Ockham competitors. The theorem neglects, however, to consider competitors following random (“mixed”) strategies and in many applications random strategies are known to achieve better worst-case loss than deterministic strategies. In this paper, we describe two ways to extend the result to a very general class of random, empirical strategies. The first extension concerns expected retractions, retraction times, and errors and the second extension concerns retractions in chance, times of retractions in chance, and chances of errors. | |||||||||
| Keywords | No keywords specified (fix it) | |||||||||
| Categories | ||||||||||
| Options |
|
|||||||||
Download options| PhilPapers Archive |
Upload a copy of this paper Check publisher's policy on self-archival Papers currently archived: 5,679 |
| External links |
  Try with proxy. Try with proxy. |
| Through your library | Only published papers are available at libraries |
Similar books and articlesSimon Fitzpatrick (forthcoming). Kelly on Ockham's Razor and Truth-Finding Efficiency. Philosophy of Science.
Kevin T. Kelly (2004). Justification as Truth-Finding Efficiency: How Ockham's Razor Works. Minds and Machines 14 (4):485-505.
Kevin Kelly (2004). Justification as Truth-Finding Efficiency: How Ockham's Razor Works. Minds and Machines 14 (4):485-505.
Wen-Fang Wang (2008). Ockham's New Razor. Proceedings of the Xxii World Congress of Philosophy 17:149-161.
P. Garcia & F. Esteva (1995). On Ockham Algebras: Congruence Lattices and Subdirectly Irreducible Algebras. Studia Logica 55 (2):319 - 346.
Marcus Hutter (2010). A Complete Theory of Everything (Will Be Subjective). Algorithms 3 (4):329-350.
Arnold Zellner, Hugo A. Keuzenkamp & Michael McAleer (eds.) (2001). Simplicity, Inference and Modeling: Keeping It Sophisticatedly Simple. Cambridge University Press.
Analytics
Monthly downloads |
Added to index2010-09-14Total downloads7 ( #133,479 of 549,078 )Recent downloads (6 months)2 ( #37,333 of 549,078 )How can I increase my downloads? |
My notes
Discussion
