Calendar

A subjective probability function is broadminded to the extent that it assigns positive probabilities to conjectures that can be possibly true. Assigning to such a conjecture the value 0 amounts to a priori ruling out the possibility of confirming the conjecture to any extent by the growing evidence. A positive value leaves, in principle, the possibility of learning from the evidence. In general, broadmindedness is not an absolute notion, but a graded one, and there is a price for it: the more broadminded the probability, the more complicated it is, because it has to assign non-zero values to more complicated conjectures. The framework which is suggested in the old Gaifman-Snir paper is suitable for phrasing this claim in a precise way and proving it. The technique by which this claim is established is to assume a definable probability function, and to state within the same language a conjecture that can be possibly true, whose probability is 0.

The complexity of the conjecture depends on the complexity of the probability, i.e., the complexity of the formulas that are used in defining it. In the Gaifman-Snir paper we used the arithmetical hierarchy as a measure of complexity. It is possible however to establish similar results with respect to a more “down to earth” measures, defined in terms of the time that it takes to calculate the probabilities, with given precisions.

A claim of this form, for a rather simple setup, was first proven by Hilary Putnam in his paper ““Degree of Confirmation” and inductive logic”, which was published in the 1963 Schilpp volume dedicated to Carnap. The proof uses in a probabilistic context, a diagonalization technique, of the kind used in set theory and in computer science. In the talk I shall present Putnam’s argument and show how diagonalization can be applied in considerably richer setups.

The second part of the talk is rather speculative. I shall point out the possibility that there might be epistemic limitations to what human science can achieve, which are imposed by certain pragmatic factors ‒ such as the criterion of repeatable experiments. All of which would recommend a skeptic attitude.

We examine general decision problems with loss functions that are bounded below. We allow the loss function to assume the value ∞. No other assumptions are made about the action space, the types of data available, the types of non-randomized decision rules allowed, or the parameter space. By allowing prior distributions and the randomizations in randomized rules to be finitely-additive, we find very general complete class and minimax theorems. Specifically, under the sole assumption that the loss function is bounded below, every decision problem has a minimal complete class and all admissible rules are Bayes rules. Also, every decision problem has a minimax rule and a least-favorable distribution and every minimax rule is Bayes with respect to the least-favorable distribution. Some special care is required to deal properly with infinite-valued risk functions and integrals taking infinite values. This talk will focus on some examples and the major differences between finitely-additive and countably-additive decision theory. This is joint work with Teddy Seidenfeld, Jay Kadane, and Rafael Stern.

UNIVERSITY SEMINAR ON LOGIC, PROBABILITY, AND GAMES
Finitely-Additive Decision Theory
Mark Schervish (Carnegie Mellon)
4:10 pm, Friday, February 16th, 2018
Faculty House, Columbia University

Randomized acts play a marginal role in traditional Bayesian decision theory, essentially only one of tie-breaking. Meanwhile, rationales for randomized decisions have been offered in a number of areas, including game theory, experimental design, and machine learning. A common and plausible way of accommodating some (but not all) of these ideas from a Bayesian perspective is by appeal to a decision maker’s bounded computational resources. Making this suggestion both precise and compelling is surprisingly difficult. We propose a distinction between interesting and uninteresting cases where randomization can help a decision maker, with the eventual aim of achieving a unified story about the rational role of randomization. The interesting cases, we claim, all arise from constraints on memory.

UNIVERSITY SEMINAR ON LOGIC, PROBABILITY, AND GAMES
On the Rational Role of Randomization
Thomas Icard (Stanford)

A standard way to challenge convergence-based accounts of inductive success is to claim that they are too weak to constrain inductive inferences in the short run. We respond to such a challenge by answering some questions raised by Juhl (1994). When it comes to predicting limiting relative frequencies in the framework of Reichenbach, we show that speed-optimal convergence—a long-run success condition—induces dynamic coherence in the short run. This is joint work with Eric Wofsey.

Michael Nielsen (Columbia University).
4:10 pm, Friday, November 16th, 2018
Faculty House, Columbia University

What does it mean that an event C “actually caused” event E? The problem of defining actual causation goes beyond mere philosophical speculation.  For example, in many legal arguments, it is precisely what needs to be established in order to determine responsibility.   (What exactly was the actual cause of the car accident or the medical problem?) The philosophy literature has been struggling with the problem of defining causality since the days of Hume, in the 1700s. Many of the definitions have been couched in terms of counterfactuals. (C is a cause of E if, had C not happened, then E would not have happened.) In 2001, Judea Pearl and I introduced a new definition of actual cause, using Pearl’s notion of structural equations to model counterfactuals.  The definition has been revised twice since then, extended to deal with notions like “responsibility” and “blame”, and applied in databases and program verification.  I survey the last 15 years of work here, including joint work with Judea Pearl, Hana Chockler, and Chris Hitchcock. The talk will be completely self-contained.

The seminar is concerned with applying formal methods to fundamental issues, with an emphasis on probabilistic reasoning, decision theory and games. In this context “logic” is broadly interpreted as covering applications that involve formal representations. The topics of interest have been researched within a very broad spectrum of different disciplines, including philosophy (logic and epistemology), statistics, economics, and computer science. The seminar is intended to bring together scholars from different fields of research so as to illuminate problems of common interest from different perspectives. Throughout each academic year, meetings are regularly presented by the members of the seminar and distinguished guest speakers.

details tba

02/08/2019 Faculty House, Columbia University
4:00 PM

03/22/2019 Faculty House, Columbia University
4:00 PM

04/19/2018 Faculty House, Columbia University
4:00 PM

There are two approaches to life. The first one, which we are identifying with Sir Karl Popper, is to think before we act and to let our hypotheses die in our stead when the overall outcome is likely to be negative. We act now for a better future, and we think now which action will bring the best future. Both decision theory and backward induction are technical versions of this train of thought.  The second approach, which we will identify with the Buddha, is to live in the present and not allow the future to pull us away from living in the ever present  Now. The Buddha’s approach is echoed in many others who came after him, Jelaluddin Rumi, Kahlil Gibran, and even perhaps Jesus.  It occurs in many contemporary teachers like Eckhart Tolle and Thich Nhat Hanh.  We may call Popper’s approach “futurism” and the Buddha’s approach “presentism.”

In this talk, we will discuss various aspects of the discourse on presentism and futurism. The purpose is to contrast one with the other. We will not attempt to side with one against the other, and instead leave it as a future project to find a prescriptive action-guiding choice between the two. We merely conjecture that a better optimal choice between these two positions may be somewhere in between. (This is joint work with Jongjin Kim.)

Propositional dynamic logic (PDL) is a framework for reasoning about nondeterministic program executions (or, more generally, nondeterministic actions). In this setting, nondeterminism is taken as a primitive: a program is nondeterministic iff it has multiple possible outcomes. But what is the sense of “possibility” at play here? This talk explores an epistemic interpretation: working in an enriched logical setting, we represent nondeterminism as a relationship between a program and an agent deriving from the agent’s (in)ability to adequately measure the dynamics of the program execution. More precisely, using topology to capture the observational powers of an agent, we define the nondeterministic outcomes of a given program execution to be those outcomes that the agent is unable to rule out in advance. In this framework, determinism coincides exactly with continuity: that is, determinism is continuity in the observation topology. This allows us to embed PDL into (dynamic) topological (subset space) logic, laying the groundwork for a deeper investigation into the epistemology (and topology) of nondeterminism.

The seminar is concerned with applying formal methods to fundamental issues, with an emphasis on probabilistic reasoning, decision theory and games. In this context “logic” is broadly interpreted as covering applications that involve formal representations. The topics of interest have been researched within a very broad spectrum of different disciplines, including philosophy (logic and epistemology), statistics, economics, and computer science. The seminar is intended to bring together scholars from different fields of research so as to illuminate problems of common interest from different perspectives. Throughout each academic year, meetings are regularly presented by the members of the seminar and distinguished guest speakers.

details tba

02/08/2019 Faculty House, Columbia University
4:00 PM

03/29/2019 Faculty House, Columbia University
4:00 PM

04/19/2018 Faculty House, Columbia University
4:00 PM

Convergence to the truth is viewed with some ambivalence in philosophy of science. On the one hand, methods of inquiry that lead to the truth in the limit are prized as marks of scientific rationality. But an agent who, by using some method, expects to always converge to the truth seems to fail a minimum standard of epistemic modesty. This point was recently brought home by Gordon Belot in his critique of Bayesian epistemology. In this paper I will study convergence to the truth theorems within the framework of Edward Nelson’s radically elementary probability theory. This theory provides an enriched conceptual framework for investigating convergence and gives rise to an appropriately modest from of Bayesianism.

The seminar is concerned with applying formal methods to fundamental issues, with an emphasis on probabilistic reasoning, decision theory and games. In this context “logic” is broadly interpreted as covering applications that involve formal representations. The topics of interest have been researched within a very broad spectrum of different disciplines, including philosophy (logic and epistemology), statistics, economics, and computer science. The seminar is intended to bring together scholars from different fields of research so as to illuminate problems of common interest from different perspectives. Throughout each academic year, meetings are regularly presented by the members of the seminar and distinguished guest speakers.

details tba

02/08/2019 Faculty House, Columbia University
4:00 PM

03/22/2019 Faculty House, Columbia University
4:00 PM

04/19/2018 Faculty House, Columbia University
4:00 PM