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. (shrink)

In the first section, five major attempts to solve the problem of induction and their failures are discussed. In the second section, an account of meta-induction is introduced. It offers a novel solution to the problem of induction, based on mathematical theorems about the predictive optimality of attractivity-weighted meta-induction. In the third section, how the a priori justification of meta-induction provides a non-circular a posteriori justification of object-induction, based on its superior track record, is explained. In the fourth section, four (...) important extensions and refinements of the method of meta-induction are presented. The final section, summarizes the major impacts of the program of meta-induction for epistemology, the philosophy of science and cognitive science. (shrink)

In this paper Reichenbach's best alternative account to induction is examined. In the first section, three versions of the BAA are distinguished that have been discussed in the literature. The major objections against all three versions are presented. In the second section it is shown by a text analysis that Reichenbach argues for all three versions of the BAA and does not sufficiently distinguish between them. In the third section it is explained how Reichenbach's third version of the BAA can (...) be transformed into a provable optimality theorem within the account of meta-induction. (shrink)

The background of this paper (section 1) consists in a new account to foundation‐theoretic epistemology characterized by two features: (i) All beliefs are to be justified by deductive, inductive or abductive inferences from a minimalistic class of unproblematic (introspective or analytic) basic beliefs. (ii) Higher‐order justifications for these inferences are given by means of the novel method of optimality justifications. Optimality justifications are a new tool for epistemology (section 2). An optimality justification does not attempt todemonstratethat a cognitive method is (...) reliable (which is impossible), but pursues the more modest goal of demonstrating that the method isoptimalamong all accessible alternative methods for the given epistemic goal. The reasoning from the established optimality of a method to the acceptability of a particular belief generated by the method is accomplished by so‐called optimality principles. In sections 3–5, the method of optimality justifications is carried out in detail for three fundamental problems: justifying induction, logic, and theory‐generating abduction. (shrink)

In order to prove the validity of logical rules, one has to assume these rules in the metalogic. However, rule-circular ‘justifications’ are demonstrably without epistemic value. Is a non-circular justification of a logical system possible? This question attains particular importance in view of lasting controversies about classical versus non-classical logics. In this paper the question is answered positively, based on meaning-preserving translations between logical systems. It is demonstrated that major systems of non-classical logic, including multi-valued, paraconsistent, intuitionistic and quantum logics, (...) can be translated into classical logic by introducing additional intensional operators into the language. Based on this result it is argued that classical logic is representationally optimal. In sec. 6 it is investigated whether non-classical logics can be likewise representationally optimal. The answer is predominantly negative but partially positive. Nevertheless the situation is not symmetric, because classical logic has important ceteris paribus advantages as a unifying metalogic. (shrink)

The universal optimality theorem for metainduction works for epistemic agents faced with a choice among finitely many prediction methods. Eckhart Arnold and Tom Sterkenburg objected that it breaks...

Work in online learning traditionally considered induction-friendly (e.g. stochastic with a fixed distribution) and induction-hostile (adversarial) settings separately. While algorithms like Exp3 that have been developed for the adversarial setting are applicable to the stochastic setting as well, the guarantees that can be obtained are usually worse than those that are available for algorithms that are specifically designed for stochastic settings. Only recently, there is an increasing interest in algorithms that give (near-)optimal guarantees with respect to the underlying setting, even (...) in case its nature is unknown to the learner. In this paper, we review various online learning algorithms that are able to adapt to the hardness of the underlying problem setting. While our focus lies on the application of adaptive algorithms as meta-inductive methods that combine given base methods, concerning theoretical properties we are also interested in guarantees that go beyond a comparison to the best fixed base learner. (shrink)

We often need to have beliefs about things on which we are not experts. Luckily, we often have access to expert judgements on such topics. But how should we form our beliefs on the basis of expert opinion when experts conflict in their judgments? This is the core of the novice/2-expert problem in social epistemology. A closely related question is important in the context of policy making: how should a policy maker use expert judgments when making policy in domains in (...) which she is not herself an expert? This question is more complex, given the messy and strategic nature of politics. In this paper we argue that the prediction with expert advice framework from machine learning provides helpful tools for addressing these problems. We outline conditions under which we should expert PWEA to be helpful and those under which we should not expect these methods to perform well. (shrink)

It is undeniable that inductive reasoning has brought us much good. At least since Hume, however, philosophers have wondered how to justify our reliance on induction. In important recent work, Schurz points out that philosophers have been wrongly assuming that justifying induction is tantamount to showing induction to be reliable. According to him, to justify our reliance on induction, it is enough to show that induction is optimal. His optimality approach consists of two steps: an analytic argument for meta-induction (that (...) is, induction over inductive methods) and an application of meta-induction to empirical findings concerning the predictive accuracy of our actual inductive practices as compared to various non-inductive methods. The present article agrees with Schurz’s general conclusion but also argues that it leaves an important aspect of our inductive practices unaccounted for, to wit, that these practices have so far been highly successful; to satisfy the optimality requirement, induction only needs to be as successful as random guessing. To explain the success of induction, I turn to insights from social epistemology, also highlighted in Schurz’s work, and make these formally explicit in a framework that combines the Hegselmann–Krause model for opinion dynamics and Carnap’s system of λ rules. Within this framework, I use a standard evolutionary algorithm to show how communities of interacting agents may, through variation and selection, come to consist of highly successful inductive reasoners. (shrink)