David Hume’s skeptical solution to the problem of induction was grounded in his belief that we learn by means of custom. We consider here how a form of reinforcement learning like custom may allow an agent to learn how to learn in other ways as well. Specifically, an agent may learn by simple reinforcement to adopt new forms of learning that work better than simple reinforcement in the context of specific tasks. We will consider how such a bootstrapping process may (...) lead to a system that includes trial-and-error forms of learning like win-stay/lose-shift, probe and adjust, and simple reinforcement itself together with higher-rationality inferential tools. (shrink)

Procedural justifications of democracy emphasize inclusiveness and respect and by doing so come into conflict with instrumental justifications that depend on voters’ competence. This conflict raises questions about jury theorems and makes their standing in democratic theory contested. We show that a type of no-regret learning called meta-induction can help to satisfy the competence assumption without excluding voters or diverse opinion leaders on an a priori basis. Meta-induction assigns weights to opinion leaders based on their past predictive performance to determine (...) the level of their inclusion in recommendations for voters. The weighting minimizes the difference between the performance of meta-induction and the best opinion leader in hindsight. The difference represents the regret of meta-induction whose minimization ensures that the recommendations are optimal in supporting voters’ competence. Meta-induction has optimal truth-tracking properties that support voters’ competence even if it is targeted by mis/disinformation and should be considered a tool for supporting democracy in hyper-plurality. (shrink)

Confronted with the problem of induction, Hans Reichenbach accepts that we cannot justify that induction is reliable. He tries to solve the problem by proving a weaker proposition: that induction is an optimal method of prediction, because it is guaranteed not to be worse and may be better than any alternative. Regarding the most serious objection to his approach, Reichenbach himself hints at an answer without spelling it out. In this paper, I will argue that there are two workable strategies (...) to rehabilitate Reichenbach’s account. The first leads to the widely discussed method of meta-induction, as proposed by Gerhard Schurz. The second strategy has not been suggested thus far. I will develop the second strategy and argue for it being, in some respects, superior to the first and closer to Reichenbach’s own position. (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.

In a recent Philosophy of Science article Gerhard Schurz proposes meta-inductivistic prediction strategies as a new approach to Hume's. This comment examines the limitations of Schurz's approach. It can be proven that the meta-inductivist approach does not work any more if the meta-inductivists have to face an infinite number of alternative predictors. With his limitation it remains doubtful whether the meta-inductivist can provide a full solution to the problem of induction.

Algorithmic information theory gives an idealized notion of compressibility that is often presented as an objective measure of simplicity. It is suggested at times that Solomonoff prediction, or algorithmic information theory in a predictive setting, can deliver an argument to justify Occam’s razor. This article explicates the relevant argument and, by converting it into a Bayesian framework, reveals why it has no such justificatory force. The supposed simplicity concept is better perceived as a specific inductive assumption, the assumption of effectiveness. (...) It is this assumption that is the characterizing element of Solomonoff prediction and wherein its philosophical interest lies. (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 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.

Normative theories can be useful in developing descriptive theories, as when normative subjective expected utility theory is used to develop descriptive rational choice theory and behavioral game theory. “Ought” questions are also the essence of theories of moral reasoning, a domain of higher mental processing that could not survive without normative considerations.

This is the introduction to the special issue “The Meta-Inductive Approach to Hume’s Problem”. The introduction includes introductory remarks and brief comments on each of the papers appearing in the special issue.

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)

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)

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)

This is a response to the papers in the special issue Logical Perspectives on Science and Cognition—The Philosophy of Gerhard Schurz.

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)

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)

A number of philosophers of science and statisticians have attempted to justify conclusions drawn from a finite sequence of evidence by appealing to results about what happens if the length of that sequence tends to infinity. If their justifications are to be successful, they need to rely on the finite sequence being either indefinitely increasing or of a large size. These assumptions are often not met in practice. This paper analyzes a simple model of collecting evidence and finds that the (...) practice of collecting only very small sets of evidence before taking a question to be settled is rationally justified. This shows that the appeal to long run results can be used neither to explain the success of actual scientific practice nor to give a rational reconstruction of that practice. (shrink)

Meta-induction, in its various forms, is an imitative prediction method, where the prediction methods and the predictions of other agents are imitated to the extent that those methods or agents have proven successful in the past. In past work, Schurz demonstrated the optimality of meta-induction as a method for predicting unknown events and quantities. However, much recent discussion, along with formal and empirical work, on the Wisdom of Crowds has extolled the virtue of diverse and independent judgment as essential to (...) maintenance of 'wise crowds'. This suggests that meta-inductive prediction methods could undermine the wisdom of the crowd inasmuch these methods recommend that agents imitate the predictions of other agents. In this article, we evaluate meta-inductive methods with a focus on the impact on a group's performance that may result from including meta-inductivists among its members. In addition to considering cases of global accessibility (i.e., cases where the judgments of all members of the group are available to all of the group's members), we consider cases where agents only have access to the judgments of other agents within their own local neighborhoods. (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)

We describe a prediction method called "Attractivity Weighting" (AW). In the case of cue-based paired comparison tasks, AW's prediction is based on a weighted average of the cue values of the most successful cues. In many situations, AW's prediction is based on the cue value of the most successful cue, resulting in behavior similar to Take-the-Best (TTB). Unlike TTB, AW has a desirable characteristic called "access optimality": Its long-run success is guaranteed to be at least as great as the most (...) successful cue. While access optimality is a desirable characteristic, concerns may be raised about the short-term performance of AW. To evaluate such concerns, we here present a study of AW's short-term performance. The results suggest that there is little reason to worry about the short-run performance of AW. Our study also shows that, in random sequences of paired comparison tasks, the behavior of AW and TTB is nearly indiscernible. (shrink)

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)

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...

Although I agree with Elqayam & Evans' (E&E's) criticisms of is-ought and ought-is fallacies, I criticize their rejection of normativism on two grounds: (1) Contrary to E&E's assumption, not every normative system of reasoning consists of formal rules. (2) E&E assume that norms of reasoning are grounded on intuition or authority, whereas in contemporary epistemology they have to be justified, primarily by their truth-conduciveness.

The justification of induction is of central significance for cross-cultural social epistemology. Different ‘epistemological cultures’ do not only differ in their beliefs, but also in their belief-forming methods and evaluation standards. For an objective comparison of different methods and standards, one needs (meta-)induction over past successes. A notorious obstacle to the problem of justifying induction lies in the fact that the success of object-inductive prediction methods (i.e., methods applied at the level of events) can neither be shown to be universally (...) reliable (Hume's insight) nor to be universally optimal. My proposal towards a solution of the problem of induction is meta-induction. The meta-inductivist applies the principle of induction to all competing prediction methods that are accessible to her. By means of mathematical analysis and computer simulations of prediction games I show that there exist meta-inductive prediction strategies whose success is universally optimal among all accessible prediction strategies, modulo a small short-run loss. The proposed justification of meta-induction is mathematically analytical. It implies, however, an a posteriori justification of object-induction based on the experiences in our world. In the final section I draw conclusions about the significance of meta-induction for the social spread of knowledge and the cultural evolution of cognition, and I relate my results to other simulation results which utilize meta-inductive learning mechanisms. (shrink)

This article argues that a successful answer to Hume's problem of induction can be developed from a sub-genre of philosophy of science known as formal learning theory. One of the central concepts of formal learning theory is logical reliability: roughly, a method is logically reliable when it is assured of eventually settling on the truth for every sequence of data that is possible given what we know. I show that the principle of induction (PI) is necessary and sufficient for logical (...) reliability in what I call simple enumerative induction. This answer to Hume's problem rests on interpreting PI as a normative claim justified by a non-empirical epistemic means-ends argument. In such an argument, a rule of inference is shown by mathematical or logical proof to promote a specified epistemic end. Since the proof concerning PI and logical reliability is not based on inductive reasoning, this argument avoids the circularity that Hume argued was inherent in any attempt to justify PI. (shrink)

In this paper, the contributions to the account of meta-induction (Schurz 2019) collected in this volume are critically discussed and thereby, new insights are developed. How broad and expandable the program of meta-induction is can be learned from Ortner’s contribution. New insights about the transition from the a priori justification of meta-induction to the a posteriori justification of object-induction emerge from the reflection of Shogenji’s paper. How meta-induction may be applied also to religious prophecies and that their meta-inductive justification does (...) not fail for a priori reasons but because of missing evidence for predictive success is learned from the discussion of Pitts’ contribution. That meta-induction does not rely on a particular prior distribution, while the no free lunch theorem depends implicitly on a uniform prior, is the major conclusion drawn from the discussion of Wolpert’s article. How the problem of induction is treated in different versions of the Bayesian account is learned from the discussion of Willliamson’s paper. That meta-induction can also be employed for abduction, and that abductive theory-revision can offer meta-inductive aggregation methods is a new insight emerging from the reflection of Aliseda’s contribution. (shrink)

The no free lunch theorem is a radicalized version of Hume’s induction skepticism. It asserts that relative to a uniform probability distribution over all possible worlds, all computable prediction algorithms—whether ‘clever’ inductive or ‘stupid’ guessing methods —have the same expected predictive success. This theorem seems to be in conflict with results about meta-induction. According to these results, certain meta-inductive prediction strategies may dominate other methods in their predictive success. In this article this conflict is analyzed and dissolved, by means of (...) probabilistic analysis and computer simulation. (shrink)

This introduction provides a detailed summary of all papers of the special issue on the second conference of the German Society for Philosophy of Science: GWP.2016.

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)

Laurence BonJour a proposé une façon novatrice de défendre son principe inductif en réponse à une proposition posée par Hume et pouvant être remise en question. Dans cet article, j’élabore et fais la critique de la stratégie de BonJour. Au cours de mon développement, j’attire l’attention sur les critiques formulées par Anthony Brueckner à l’égard de l’approche de BonJour, détaillant les raisons pour lesquelles elles ne parviennent pas à réfuter de manière cohérente l’argument de BonJour. En distinguant et en appliquant (...) deux types distincts d’évaluation des probabilités aux hypothèses de BonJour, j’avance l’argument selon lequel la stratégie déductive de BonJour échoue à fournir une argumentation convaincante en faveur du PI. Je conclus en exposant les implications des tentatives visant à défendre le principe à partir d’arguments a priori. (shrink)

This paper discusses recent attempts to solve the problem of induction. Two broad strategies to escape Hume's fork can be distinguished. The first tries to localize the justification of specific inductions in uncontroversial empirical knowledge, e.g.mundane scientific knowledge (J. D. Norton) or perception (M. Lange). I argue that related attempts to (dis)solve the problem fail. The second strategy tries to put forward an argument in favor of induction. As a discussion of work by R. White shows, this argument can barely (...) prove that induction is reliable or at least not unreliable. But D. Steel, F. Huber and G. Schurz could show that enumerative induction is necessary and sufficient for a certain epistemic goal or optimal in a certain sense. These proofs, however, only solve the problem of induction if the goal or a certain standard has priority over the avoidance of error. This suggests that the difficulties to justify induction do not so much derive from Hume's fork, but rather from a plurality of sensible epistemic goals that can conflict with each other. (shrink)

Generalized Darwinism models cultural development as an evolutionary process, where traits evolve through variation, selection, and inheritance. Inheritance describes either a discrete unit’s transmission or a mixing of traits. In this article, we compare classical models of cultural evolution and generalized population dynamics with respect to blending inheritance. We identify problems of these models and introduce our model, which combines relevant features of both. Blending is implemented as success-based social learning, which can be shown to be an optimal strategy.

It is widely believed that one should not become more confident that all swans are white and all lions are brave simply by observing white swans. Irrelevant conjunction or “tacking” of a theory onto another is often thought problematic for Bayesianism, especially given the ratio measure of confirmation considered here. It is recalled that the irrelevant conjunct is not confirmed at all. Using the ratio measure, the irrelevant conjunction is confirmed to the same degree as the relevant conjunct, which, it (...) is argued, is ideal: the irrelevant conjunct is irrelevant. Because the past’s really having been as it now appears to have been is an irrelevant conjunct, present evidence confirms theories about past events only insofar as irrelevant conjunctions are confirmed. Hence the ideal of not confirming irrelevant conjunctions would imply that historical claims are not confirmed. Confirmation measures partially realizing that ideal make the confirmation of historical claims by present evidence depend strongly on the (presumably subjective) degree of belief in the irrelevant conjunct. The unusually good behavior of the ratio measure has a bearing on the problem of measure sensitivity. For non-statistical hypotheses, Bayes’ theorem yields a fractional linear transformation in the prior probability, not a linear rescaling, so even the ratio measure arguably does not aptly measure confirmation in such cases. (shrink)

An overview of the German philosophy of science community is given for the years 1992–2012, based on a survey in which 159 philosophers of science in Germany participated. To this end, the institutional background of the German philosophy of science community is examined in terms of journals, centers, and associations. Furthermore, a qualitative description and a quantitative analysis of our survey results are presented. Quantitative estimates are given for: (a) academic positions, (b) research foci, (c) philosophers’ of science most important (...) publications, and (d) externally funded projects, where for (c) all survey participants had indicated their five most important publications in philosophy of science. In addition, the survey results for (a)–(c) are also qualitatively described, as they are interesting in their own right. With respect to (a), we estimated the gender distribution among academic positions. Concerning (c), we quantified philosophers’ of science preference for (i) journals and publishers, (ii) publication format, (iii) language, and (iv) coauthorship for their most important publications. With regard to research projects, we determined their (i) prevalence, (ii) length, and (iii) trend (an increase in number?) as well as their most frequent (iv) research foci and (v) funding organizations. We also distinguished between German-based and non-German-based journals, publishers, and funding institutions, making it thereby possible to evaluate the involvement of the German philosophy of science community in the international research landscape. Finally, we discuss some implications of our findings. (shrink)

There is a plurality of formal constraints for aggregating probabilities of a group of individuals. Different constraints characterise different families of aggregation rules. In this paper, we focus on the families of linear and geometric opinion pooling rules which consist in linear, respectively, geometric weighted averaging of the individuals’ probabilities. For these families, it is debated which weights exactly are to be chosen. By applying the results of the theory of meta-induction, we want to provide a general rationale, namely, optimality, (...) for choosing the weights in a success-based way by scoring rules. A major argument put forward against weighting by scoring is that these weights heavily depend on the chosen scoring rule. However, as we will show, the main condition for the optimality of meta-inductive weights is so general that it holds under most standard scoring rules, more precisely under all scoring rules that are based on a convex loss function. Therefore, whereas the exact choice of a scoring rule for weighted probability aggregation might depend on the respective purpose of such an aggregation, the epistemic rationale behind such a choice is generally valid. (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)

This article comments on the article of Thorn and Schurz in this volume and focuses on, what we call, the problem of parasitic experts. We discuss that both meta- induction and crowd wisdom can be understood as pertaining to absolute reliability rather than comparative optimality, and we suggest that the involvement of reliability will provide a handle on this problem.

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)

The standard approach to solve prediction tasks is to apply inductive methods such as, e.g., the straight rule. Such methods are proven to be access-optimal in specific prediction settings, but not in all. Within the optimality-approach of meta-induction, success-based weighted prediction methods are proven to be access-optimal in all possible continuous prediction settings. However, meta-induction fails to be access-optimal in so-called demonic discrete prediction environments where the predicted value is inversely correlated with the true outcome. In this paper the problem (...) of discrete prediction environments is addressed by embedding them into a synchronised prediction setting. In such a setting the task consists in providing a discrete and a continuous prediction. It is shown that synchronisation constraints exclude the possibility of demonic environments. (shrink)