Belot, Gordon (2018) An Automatic Ockham's Razor for Bayesians? [Preprint]
|
Text
AutoRazor.pdf Download (202kB) | Preview |
Abstract
It is sometimes claimed that the Bayesian framework automatically implements Ockham's razor---that conditionalizing on data consistent with both a simple theory and a complex theory more or less inevitably favours the simpler theory. It is shown here that the automatic razor doesn't in fact cut it for certain mundane curve-fitting problems.
Export/Citation: | EndNote | BibTeX | Dublin Core | ASCII/Text Citation (Chicago) | HTML Citation | OpenURL |
Social Networking: |
Item Type: | Preprint | ||||||
---|---|---|---|---|---|---|---|
Creators: |
|
||||||
Additional Information: | Forthcoming in Erkenntnis | ||||||
Keywords: | Bayesianism Ockham's Razor Simplicity | ||||||
Subjects: | General Issues > Confirmation/Induction | ||||||
Depositing User: | Gordon Belot | ||||||
Date Deposited: | 30 Apr 2018 01:11 | ||||||
Last Modified: | 30 Apr 2018 01:11 | ||||||
Item ID: | 14629 | ||||||
Subjects: | General Issues > Confirmation/Induction | ||||||
Date: | 29 April 2018 | ||||||
URI: | https://philsci-archive.pitt.edu/id/eprint/14629 |
Monthly Views for the past 3 years
Monthly Downloads for the past 3 years
Plum Analytics
Actions (login required)
View Item |