In this paper, I begin by defending permissivism: the claim that, sometimes, there is more than one way to rationally respond to a given body of evidence. Then I argue that, if we accept permissivism, certain worries that arise as a result of learning that our beliefs were caused by the communities we grew up in, the schools we went to, or other irrelevant influences dissipate. The basic strategy is as follows: First, I try to pinpoint what makes irrelevant influences (...) worrying and I come up with two candidate principles. I then argue that one principle should be rejected because it is inconsistent with permissivism. The principle we should accept implies that it is sometimes rational to maintain our beliefs, even upon learning that they were caused by irrelevant influences. (shrink)

Epistemology should take seriously the possibility of rationally evaluable changes in conceptual resources. Epistemic decision theory compares belief states in terms of epistemic value. But it's standardly restricted to belief states that don't differ in their conceptual resources. I argue that epistemic decision theory should be generalized to make belief states with differing concepts comparable. I characterize some possible constraints on epistemic utility functions. Traditionally, the epistemic utility of a total belief state has been understood as a function of the (...) epistemic utility of individual (partial) beliefs. The most natural ways of generalizing this account generate a kind of repugnant conclusion. I characterize some possible alternatives, reflecting different epistemic norms. (shrink)

Conditionalization is a widely endorsed rule for updating one’s beliefs. But a sea of complaints have been raised about it, including worries regarding how the rule handles error correction, changing desiderata of theory choice, evidence loss, self-locating beliefs, learning about new theories, and confirmation. In light of such worries, a number of authors have suggested replacing Conditionalization with a different rule — one that appeals to what I’ll call “ur-priors”. But different authors have understood the rule in different ways, and (...) these different understandings solve different problems. In this paper, I aim to map out the terrain regarding these issues. I survey the different problems that might motivate the adoption of such a rule, flesh out the different understandings of the rule that have been proposed, and assess their pros and cons. I conclude by suggesting that one particular batch of proposals, proposals that appeal to what I’ll call “loaded evidential standards”, are especially promising. (shrink)

Scoring rules measure the accuracy or epistemic utility of a credence assignment. A significant literature uses plausible conditions on scoring rules on finite sample spaces to argue for both probabilism—the doctrine that credences ought to satisfy the axioms of probabilism—and for the optimality of Bayesian update as a response to evidence. I prove a number of formal results regarding scoring rules on infinite sample spaces that impact the extension of these arguments to infinite sample spaces. A common condition in the (...) arguments for probabilism and Bayesian update is strict propriety: that according to each probabilistic credence, the expected accuracy of any other credence is worse. Much of the discussion needs to divide depending on whether we require finite or countable additivity of our probabilities. I show that in a number of natural infinite finitely additive cases, there simply do not exist strictly proper scoring rules, and the prospects for arguments for probabilism and Bayesian update are limited. In many natural infinite countably additive cases, on the other hand, there do exist strictly proper scoring rules that are continuous on the probabilities, and which support arguments for Bayesian update, but which do not support arguments for probabilism. There may be more hope for accuracy-based arguments if we drop the assumption that scores are extended-real-valued. I sketch a framework for scoring rules whose values are nets of extended reals, and show the existence of a strictly proper net-valued scoring rules in all infinite cases, both for f.a. and c.a. probabilities. These can be used in an argument for Bayesian update, but it is not at present known what is to be said about probabilism in this case. (shrink)

In Bayesian epistemology, the problem of the priors is this: How should we set our credences (or degrees of belief) in the absence of evidence? That is, how should we set our prior or initial credences, the credences with which we begin our credal life? David Lewis liked to call an agent at the beginning of her credal journey a superbaby. The problem of the priors asks for the norms that govern these superbabies. -/- The Principle of Indifference gives a (...) very restrictive answer. It demands that such an agent divide her credences equally over all possibilities. That is, according to the Principle of Indifference, only one initial credence function is permissible, namely, the uniform distribution. In this paper, we offer a novel argument for the Principle of Indifference. I call it the Argument from Accuracy. (shrink)

'Fundamentals of Bayesian Epistemology' provides an accessible introduction to the key concepts and principles of the Bayesian formalism. This volume introduces degrees of belief as a concept in epistemology and the rules for updating degrees of belief derived from Bayesian principles.--.

Accuracy‐first epistemology is an approach to formal epistemology which takes accuracy to be a measure of epistemic utility and attempts to vindicate norms of epistemic rationality by showing how conformity with them is beneficial. If accuracy‐first epistemology can actually vindicate any epistemic norms, it must adopt a plausible account of epistemic value. Any such account must avoid the epistemic version of Derek Parfit's “repugnant conclusion.” I argue that the only plausible way of doing so is to say that accurate credences (...) in certain propositions have no, or almost no, epistemic value. I prove that this is incompatible with standard accuracy‐first arguments for probabilism, and argue that there is no way for accuracy‐first epistemology to show that all credences of all agents should be coherent. (shrink)

I show that de Finetti’s coherence theorem is equivalent to the Hahn-Banach theorem and discuss some consequences of this result. First, the result unites two aspects of de Finetti’s thought in a nice way: a corollary of the result is that the coherence theorem implies the existence of a fair countable lottery, which de Finetti appealed to in his arguments against countable additivity. Another corollary of the result is the existence of sets that are not Lebesgue measurable. I offer a (...) subjectivist interpretation of this corollary that is concordant with de Finetti’s views. I conclude by pointing out that my result shows that there is a sense in which de Finetti’s theory of subjective probability is necessarily nonconstructive. This raises questions about whether the coherence theorem can underwrite a legitimate theory of rational belief. (shrink)

In a recent paper, Pettigrew reports a generalization of the celebrated accuracy-dominance theorem due to Predd et al., but Pettigrew’s proof is incorrect. I will explain the mistakes and provide a correct proof.

The best accuracy arguments for probabilism apply only to credence functions with finite domains, that is, credence functions that assign credence to at most finitely many propositions. This is a significant limitation. It reveals that the support for the accuracy-first program in epistemology is a lot weaker than it seems at first glance, and it means that accuracy arguments cannot yet accomplish everything that their competitors, the pragmatic (Dutch book) arguments, can. In this paper, I investigate the extent to which (...) this limitation can be overcome. Building on the best arguments in finite domains, I present two accuracy arguments for probabilism that are perfectly general—they apply to credence functions with arbitrary domains. I then discuss how the arguments’ premises can be challenged. We will see that it is particularly difficult to characterize admissible accuracy measures in infinite domains. (shrink)

Shuford, Albert and Massengill proved, a half century ago, that the logarithmic scoring rule is the only proper measure of inaccuracy determined by a differentiable function of probability assigned the actual cell of a scored partition. In spite of this, the log rule has gained less traction in applied disciplines and among formal epistemologists that one might expect. In this paper we show that the differentiability criterion in the Shuford et. al. result is unnecessary and use the resulting simplified characterization (...) of the logarithmic rule to give novel arguments in favor of it. (shrink)

James Joyce's 'Nonpragmatic Vindication of Probabilism' gives a new argument for the conclusion that a person's credences ought to satisfy the laws of probability. The premises of Joyce's argument include six axioms about what counts as an adequate measure of the distance of a credence function from the truth. This paper shows that (a) Joyce's argument for one of these axioms is invalid, (b) his argument for another axiom has a false premise, (c) neither axiom is plausible, and (d) without (...) these implausible axioms Joyce's vindication of probabilism fails. (shrink)

This paper addresses the issue of finite versus countable additivity in Bayesian probability and decision theory -- in particular, Savage's theory of subjective expected utility and personal probability. I show that Savage's reason for not requiring countable additivity in his theory is inconclusive. The assessment leads to an analysis of various highly idealised assumptions commonly adopted in Bayesian theory, where I argue that a healthy dose of, what I call, conceptual realism is often helpful in understanding the interpretational value of (...) sophisticated mathematical structures employed in applied sciences like decision theory. In the last part, I introduce countable additivity into Savage's theory and explore some technical properties in relation to other axioms of the system. (shrink)

One of the fundamental problems of epistemology is to say when the evidence in an agent’s possession justifies the beliefs she holds. In this paper and its sequel, we defend the Bayesian solution to this problem by appealing to the following fundamental norm: Accuracy An epistemic agent ought to minimize the inaccuracy of her partial beliefs. In this paper, we make this norm mathematically precise in various ways. We describe three epistemic dilemmas that an agent might face if she attempts (...) to follow Accuracy, and we show that the only inaccuracy measures that do not give rise to such dilemmas are the quadratic inaccuracy measures. In the sequel, we derive the main tenets of Bayesianism from the relevant mathematical versions of Accuracy to which this characterization of the legitimate inaccuracy measures gives rise, but we also show that Jeffrey conditionalization has to be replaced by a different method of update in order for Accuracy to be satisfied. (shrink)

There is a well-known equivalence between avoiding accuracy dominance and having probabilistically coherent credences (see, e.g., de Finetti 1974, Joyce 2009, Predd et al. 2009, Pettigrew 2016). However, this equivalence has been established only when the set of propositions on which credence functions are defined is finite. In this paper, I establish connections between accuracy dominance and coherence when credence functions are defined on an infinite set of propositions. In particular, I establish the necessary results to extend the classic accuracy (...) argument for probabilism to certain classes of infinite sets of propositions including countably infinite partitions. (shrink)

The pragmatic character of the Dutch book argument makes it unsuitable as an "epistemic" justification for the fundamental probabilist dogma that rational partial beliefs must conform to the axioms of probability. To secure an appropriately epistemic justification for this conclusion, one must explain what it means for a system of partial beliefs to accurately represent the state of the world, and then show that partial beliefs that violate the laws of probability are invariably less accurate than they could be otherwise. (...) The first task can be accomplished once we realize that the accuracy of systems of partial beliefs can be measured on a gradational scale that satisfies a small set of formal constraints, each of which has a sound epistemic motivation. When accuracy is measured in this way it can be shown that any system of degrees of belief that violates the axioms of probability can be replaced by an alternative system that obeys the axioms and yet is more accurate in every possible world. Since epistemically rational agents must strive to hold accurate beliefs, this establishes conformity with the axioms of probability as a norm of epistemic rationality whatever its prudential merits or defects might be. (shrink)

This paper argues that the agent concerned to have accurate (outright) beliefs will have a consistent and multi-premise closed belief set, and not a (merely) single-premise closed and (merely) pairwise consistent belief set, as has often been thought. This argument rests on the fact that we need a notion of accuracy coherence for belief that is belief-sensitive; sensitive to one's perspective, in a way that the standard belief-insensitive notion of accuracy coherence is not. The choice of the belief-sensitive over belief-insensitive (...) notion is defended, as is the choice of this particular belief-sensitive kind of accuracy coherence over other belief-sensitive rivals. Our conclusion is that accurate believers are deductively cogent. (shrink)

We provide self-contained proof of a theorem relating probabilistic coherence of forecasts to their non-domination by rival forecasts with respect to any proper scoring rule. The theorem recapitulates insights achieved by other investigators, and clarifi es the connection of coherence and proper scoring rules to Bregman divergence.