A statistical learning approach to a problem of induction

Download Edit this record How to cite View on PhilPapers
Abstract
At its strongest, Hume's problem of induction denies the existence of any well justified assumptionless inductive inference rule. At the weakest, it challenges our ability to articulate and apply good inductive inference rules. This paper examines an analysis that is closer to the latter camp. It reviews one answer to this problem drawn from the VC theorem in statistical learning theory and argues for its inadequacy. In particular, I show that it cannot be computed, in general, whether we are in a situation where the VC theorem can be applied for the purpose we want it to.
Reprint years
2018
PhilPapers/Archive ID
ZHAASL
Upload history
Archival date: 2018-12-07
View other versions
Added to PP index
2018-11-09

Total views
71 ( #47,176 of 2,432,313 )

Recent downloads (6 months)
12 ( #44,644 of 2,432,313 )

How can I increase my downloads?

Downloads since first upload
This graph includes both downloads from PhilArchive and clicks on external links on PhilPapers.