Episteme · 2019 · 31 citations · 26 references
ComputingComputer ScienceMachine LearningPhilosophy Of SciencePredictive AnalyticsArgumentationDeductive ReasoningInductive ReasoningMeta-learningInductive ArgumentationInductive InferenceScientific Prediction
ABSTRACT I evaluate Schurz's proposed meta-inductive justification of induction, a refinement of Reichenbach's pragmatic justification that rests on results from the machine learning branch of prediction with expert advice. My conclusion is that the argument, suitably explicated, comes remarkably close to its grand aim: an actual justification of induction. This finding, however, is subject to two main qualifications, and still disregards one important challenge. The first qualification concerns the empirical success of induction. Even though, I argue, Schurz's argument does not need to spell out what inductive method actually consists in, it does need to postulate that there is something like the inductive or scientific prediction strategy that has so far been significantly more successful than alternative approaches. The second qualification concerns the difference between having a justification for inductive method and for sticking with induction for now . Schurz's argument can only provide the latter. Finally, the remaining challenge concerns the pool of alternative strategies, and the relevant notion of a meta-inductivist's optimality that features in the analytic step of Schurz's argument. Building on the work done here, I will argue in a follow-up paper that the argument needs a stronger dynamic notion of a meta-inductivist's optimality.
26
Edward H. Madden, Nelson Goodman, Andrew G. van Melsen · Philosophy and Phenomenological Research · 1955 · 4.4K citations
The Weighted Majority Algorithm
N. Littlestone, Manfred K. Warmuth · Information and Computation · 1994 · 2K citations
William R. Dennes, Hans Reichenbach · The Philosophical Review · 1939 · 878 citations