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)

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 this paper a new conception of foundation-oriented epistemology is developed. The major challenge for foundation-oriented justifications consists in the problem of stopping the justificational regress without taking recourse to dogmatic assumptions or circular reasoning. Two alternative accounts that attempt to circumvent this problem, coherentism and externalism, are critically discussed and rejected as unsatisfactory. It is argued that optimality arguments are a new type of foundation-oriented justification that can stop the justificational regress. This is demonstrated on the basis of a (...) novel result in the area of induction: the optimality of meta-induction. In the final section the method of optimality justification is generalized to deductive and abductive inferences. (shrink)

In robustness analysis, hypotheses are supported to the extent that a result proves robust, and a result is robust to the extent that we detect it in diverse ways. But what precise sense of diversity is at work here? In this paper, I show that the formal explications of evidential diversity most often appealed to in work on robustness – which all draw in one way or another on probabilistic independence – fail to shed light on the notion of diversity (...) relevant to robustness analysis. I close by briefly outlining a promising alternative approach inspired by Horwich’s (1982) eliminative account of evidential diversity. (shrink)

Formal and empirical work on the Wisdom of Crowds has extolled the virtue of diverse and independent judgment as essential to the maintenance of ‘wise crowds’. In other words, com-munication and imitation among members of a group may have the negative effect of decreasing the aggregate wisdom of the group. In contrast, it is demonstrable that certain meta-inductive methods provide optimal means for predicting unknown events. Such meta-inductive methods are essentially imitative, where the predictions of other agents are imitated to (...) the extent that those agents have proven successful in the past. Despite the (self-serving) optimality of meta-inductive methods, their imitative nature may undermine the ‘wisdom of the crowd’, since these methods recommend that agents imitate the predictions of other agents. In this paper, I present a replication of selected results of Thorn and Schurz, illustrating the effect on a group’s performance that may result from having members of a group adopt meta-inductive methods. I then expand on the work of Thorn and Schurz by considering three simple measures by which meta-inductive prediction methods may improve their own performance, while simultaneously mitigating their negative impact on group performance. The effects of adopting these maneuvers are investigated using computer simulations. (shrink)

This article poses a challenge to Schurz’s proposed metainductive justification of induction. It is argued that Schurz’s argument requires a notion of optimality that can deal with an expanding pool of prediction strategies.

This addendum presents results that confound some commonly made claims about the sorts of environments in which the performance of TTB exceeds that of Franklin's rule, and vice versa.

Indicators of the reliability of informants are essential for social learning in a society that is initially dominated by ignorance or superstition. Such reliability indicators should be based on meta-induction over records of truth-success. This is the major claim of this paper, and it is supported in two steps. One needs a non-circular justification of the method of meta-induction, as compared to other learning methods. An approach to this problem has been developed in earlier papers and is reported in section (...) 2. It is based on the predictive optimality of meta-inductive learning, under the assumption that objective success records are globally available. The rest of the paper develops an extension of this approach, so-called local meta-induction. Here individuals can access only success records of individuals in their immediate epistemic neighborhood. It is shown that local meta-inductive learning can spread reliable information over the entire population, and has clear advantages compared to success-independent social learning methods such as peer-imitation and authority-imitation.Send article to KindleTo send this article to your Kindle, first ensure [email protected] is added to your Approved Personal Document E-mail List under your Personal Document Settings on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part of your Kindle email address below. Find out more about sending to your Kindle. Find out more about sending to your Kindle. Note you can select to send to either the @free.kindle.com or @kindle.com variations. ‘@free.kindle.com’ emails are free but can only be sent to your device when it is connected to wi-fi. ‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply. Find out more about the Kindle Personal Document Service.META-INDUCTION IN EPISTEMIC NETWORKS AND THE SOCIAL SPREAD OF KNOWLEDGEVolume 9, Issue 2Gerhard SchurzDOI: https://doi.org/10.1017/epi.2012.6Your Kindle email address Please provide your Kindle [email protected]@kindle.com Available formats PDF Please select a format to send. By using this service, you agree that you will only keep articles for personal use, and will not openly distribute them via Dropbox, Google Drive or other file sharing services. Please confirm that you accept the terms of use. Cancel Send ×Send article to Dropbox To send this article to your Dropbox account, please select one or more formats and confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account. Find out more about sending content to Dropbox. META-INDUCTION IN EPISTEMIC NETWORKS AND THE SOCIAL SPREAD OF KNOWLEDGEVolume 9, Issue 2Gerhard SchurzDOI: https://doi.org/10.1017/epi.2012.6Available formats PDF Please select a format to send. By using this service, you agree that you will only keep articles for personal use, and will not openly distribute them via Dropbox, Google Drive or other file sharing services. Please confirm that you accept the terms of use. Cancel Send ×Send article to Google Drive To send this article to your Google Drive account, please select one or more formats and confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account. Find out more about sending content to Google Drive. META-INDUCTION IN EPISTEMIC NETWORKS AND THE SOCIAL SPREAD OF KNOWLEDGEVolume 9, Issue 2Gerhard SchurzDOI: https://doi.org/10.1017/epi.2012.6Available formats PDF Please select a format to send. By using this service, you agree that you will only keep articles for personal use, and will not openly distribute them via Dropbox, Google Drive or other file sharing services. Please confirm that you accept the terms of use. Cancel Send ×Export citation Request permission. (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)

According to the paradigm of adaptive rationality, successful inference and prediction methods tend to be local and frugal. As a complement to work within this paradigm, we investigate the problem of selecting an optimal combination of prediction methods from a given toolbox of such local methods, in the context of changing environments. These selection methods are called meta-inductive strategies, if they are based on the success-records of the toolbox-methods. No absolutely optimal MI strategy exists—a fact that we call the “revenge (...) of ecological rationality”. Nevertheless one can show that a certain MI strategy exists, called “AW”, which is universally long-run optimal, with provably small short-run losses, in comparison to any set of prediction methods that it can use as input. We call this property universal access-optimality. Local and short-run improvements over AW are possible, but only at the cost of forfeiting universal access-optimality. The last part of the paper includes an empirical study of MI strategies in application to an 8-year-long data set from the Monash University Footy Tipping Competition. (shrink)

According to the Feigl–Reichenbach–Salmon–Schurz pragmatic justification of induction, no predictive method is guaranteed or even likely to work for predicting the future; but if anything will work, induction will work—at least when induction is employed at the meta-level of predictive methods in light of their track records. One entertains a priori all manner of esoteric prediction methods, and is said to arrive a posteriori at the conclusion, based on the actual past, that object-level induction is optimal. Schurz’s refinements largely solve (...) the notorious short-run problem. A difficulty is noted, however, related to short-run worries but based on localized disagreement about the past, a feature characteristic of real debates (especially early modern) involving induction in intellectual history. Given the evidence about past events, _unfiltered by induction_, meta-induction might support a partly non-inductive method—especially as judged by proponents of esoteric prediction methods, who presumably believe that their methods have worked. Thus induction is justified meta-inductively in contexts where it was uncontroversial, while not obviously justified in key contexts where it has been disputed. This objection, momentarily sensed by Reichenbach regarding clairvoyance, is borne out by the Stoics’ use of meta-induction to justify both science and divination and by ancient Hebrew examples of meta-induction. Schurz’s recently introduced criteria for acceptance of testimony play a crucial role in arriving at object-level induction using meta-induction, but one might question them. Given the need for judgment in accepting testimony, it is unclear that the subjectivity of Howson’s Bayesian answer to Hume’s problem is overcome. (shrink)

White (2015) proposes an a priori justification of the reliability of inductive prediction methods based on his thesis of induction-friendliness. It asserts that there are by far more induction-friendly event sequences than induction-unfriendly event sequences. In this paper I contrast White's thesis with the famous no free lunch (NFL) theorem. I explain two versions of this theorem, the strong NFL theorem applying to binary and the weak NFL theorem applying to real-valued predictions. I show that both versions refute the thesis (...) of induction-friendliness. In the conclusion I argue that an a priori justification of the reliability of induction based on a uniform probability distribution over possible event sequences is impossible. In the outlook I consider two alternative approaches: (i) justification externalism and (ii) optimality justifications. (shrink)

Our beliefs and opinions are shaped by others, making our social networks crucial in determining what we believe to be true. Sometimes this is for the good because our peers help us form a more accurate opinion. Sometimes it is for the worse because we are led astray. In this context, we address via agent-based computer simulations the extent to which patterns of connectivity within our social networks affect the likelihood that initially undecided agents in a network converge on a (...) true opinion following group deliberation. The model incorporates a fine-grained and realistic representation of belief and trust, and it allows agents to consult outside information sources. We study a wide range of network structures and provide a detailed statistical analysis concerning the exact contribution of various network metrics to collective competence. Our results highlight and explain the collective risks involved in an overly networked or partitioned society. Specifically, we find that 96% of the variation in collective competence across networks can be attributed to differences in amount of connectivity and clustering, which are negatively correlated with collective competence. A study of bandwagon or “group think” effects indicates that both connectivity and clustering increase the probability that the network, wholly or partly, locks into a false opinion. Our work is interestingly related to Gerhard Schurz’s work on meta-induction and can be seen as broadly addressing a practical limitation of his approach. (shrink)