Jürgen Landes

The application of the maximum entropy principle to determine probabilities on finite domains is well-understood. Its application to infinite domains still lacks a well-studied comprehensive approach. There are two different strategies for applying the maximum entropy principle on first-order predicate languages: applying it to finite sublanguages and taking a limit; comparing finite entropies of probability functions defined on the language as a whole. The entropy-limit conjecture roughly says that these two strategies result in the same probabilities. While the conjecture is known to hold for monadic languages as well as for premiss sentences containing only existential or only universal quantifiers, its status for premiss sentences of greater quantifier complexity is, in general, unknown. I here show that the first approach fails to provide a sensible answer for some \-premiss sentences. I discuss implications of this failure for the first strategy and consequences for the entropy-limit conjecture.

Objective Bayesian epistemology invokes three norms: the strengths of our beliefs should be probabilities, they should be calibrated to our evidence of physical probabilities, and they should otherwise equivocate sufficiently between the basic propositions that we can express. The three norms are sometimes explicated by appealing to the maximum entropy principle, which says that a belief function should be a probability function, from all those that are calibrated to evidence, that has maximum entropy. However, the three norms of objective Bayesianism are usually justified in different ways. In this paper we show that the three norms can all be subsumed under a single justification in terms of minimising worst-case expected loss. This, in turn, is equivalent to maximising a generalised notion of entropy. We suggest that requiring language invariance, in addition to minimising worst-case expected loss, motivates maximisation of standard entropy as opposed to maximisation of other instances of generalised entropy. Our argument also provides a qualified justification for updating degrees of belief by Bayesian conditionalisation. However, conditional probabilities play a less central part in the objective Bayesian account than they do under the subjective view of Bayesianism, leading to a reduced role for Bayes’ Theorem.

This monograph is a collection of conference contributions chosen by the editors who led a three-year project on evolution, cooperation, and rationality. The collected works are held together by a six-page introduction identifying common strands and differences of positions in the different chapters. Since no two chapters have a common author, the chapters do not build on each other. Rather, they offer a variety of perspectives on a number of different aspects of rationality and evolution. The monograph thus does not offer a unified account of evolution and rationality despite the possibly somewhat misleading title, nor is there a clearly identifiable overarching theme that runs through the entire book

We introduce two novel frameworks for choice under complete uncertainty. These frameworks employ intervals to represent uncertain utility attaching to outcomes. In the first framework, utility intervals arising from one act with multiple possible outcomes are aggregated via a set-based approach. In the second framework the aggregation of utility intervals employs multi-sets. On the aggregated utility intervals, we then introduce min–max decision rules and lexicographic refinements thereof. The main technical results are axiomatic characterizations of these min–max decision rules and these refinements. We also briefly touch on the independence of introduced axioms. Furthermore, we show that such characterizations give rise to novel axiomatic characterizations of the well-known min–max decision rule?mnx?mnx in the classical framework of choice under complete uncertainty.

This paper addresses a data integration problem: given several mutually consistent datasets each of which measures a subset of the variables of interest, how can one construct a probabilistic model that fits the data and gives reasonable answers to questions which are under-determined by the data? Here we show how to obtain a Bayesian network model which represents the unique probability function that agrees with the probability distributions measured by the datasets and otherwise has maximum entropy. We provide a general algorithm, OBN-cDS, which offers substantial efficiency savings over the standard brute-force approach to determining the maximum entropy probability function. Furthermore, we develop modifications to the general algorithm which enable further efficiency savings but which are only applicable in particular situations. We show that there are circumstances in which one can obtain the model directly from the data; by solving algebraic problems; and by solving relatively simple independent optimisation problems.

Besides the usual business of solving paradoxes, there has been recent philosophical work on their essential nature. Lycan characterises a paradox as “an inconsistent set of propositions, each of which is very plausible.” Building on this definition, Paseau offers a numerical measure of paradoxicality of a set of principles: a function of the degrees to which a subject believes the principles considered individually (all typically high) and of the degree to which the subject believes the principles considered together (typically low). We argue (a) that Paseau's measure fails to score certain paradoxes properly and (b) that this failure is not due to the particular measure but rather that any such function just of credences fails to adequately capture paradoxicality. Our analysis leads us to conclude that Lycan's definition also fails to capture the notion of paradox

Some authors claim that minimal models have limited epistemic value (Fumagalli, 2016; Grüne-Yanoff, 2009a). Others defend the epistemic benefits of modelling by invoking the role of robustness analysis for hypothesis confirmation (see, e.g., Levins, 1966; Kuorikoski et al., 2010) but such arguments find much resistance (see, e.g., Odenbaugh & Alexandrova, 2011). In this paper, we offer a Bayesian rationalization and defence of the view that robustness analysis can play a confirmatory role, and thereby shed light on the potential of minimal models for hypothesis confirmation. We illustrate our argument by reference to a case study from macroeconomics. At the same time, we also show that there are cases in which robustness analysis is detrimental to confirmation. We characterize these cases and link them to recent investigations on evidential variety (Landes, 2020b, 2021; Osimani and Landes, forthcoming). We conclude that robustness analysis over minimal models can confirm, but its confirmatory value depends on concrete circumstances.

According to the objective Bayesian approach to inductive logic, premisses inductively entail a conclusion just when every probability function with maximal entropy, from all those that satisfy the premisses, satisfies the conclusion. When premisses and conclusion are constraints on probabilities of sentences of a first-order predicate language, however, it is by no means obvious how to determine these maximal entropy functions. This paper makes progress on the problem in the following ways. Firstly, we introduce the concept of a limit in entropy and show that, if the set of probability functions satisfying the premisses contains a limit in entropy, then this limit point is unique and is the maximal entropy probability function. Next, we turn to the special case in which the premisses are categorical sentences of the logical language. We show that if the uniform probability function gives the premisses positive probability, then the maximal entropy function can be found by simply conditionalising this uniform prior on the premisses. We generalise our results to demonstrate agreement between the maximal entropy approach and Jeffrey conditionalisation in the case in which there is a single premiss that specifies the probability of a sentence of the language. We show that, after learning such a premiss, certain inferences are preserved, namely inferences to inductive tautologies. Finally, we consider potential pathologies of the approach: we explore the extent to which the maximal entropy approach is invariant under permutations of the constants of the language, and we discuss some cases in which there is no maximal entropy probability function.