DeepAI AI Chat
Log In Sign Up

Formalizing the presumption of independence

11/12/2022
by   Paul Christiano, et al.
0

Mathematical proof aims to deliver confident conclusions, but a very similar process of deduction can be used to make uncertain estimates that are open to revision. A key ingredient in such reasoning is the use of a "default" estimate of 𝔼[XY] = 𝔼[X] 𝔼[Y] in the absence of any specific information about the correlation between X and Y, which we call *the presumption of independence*. Reasoning based on this heuristic is commonplace, intuitively compelling, and often quite successful – but completely informal. In this paper we introduce the concept of a heuristic estimator as a potential formalization of this type of defeasible reasoning. We introduce a set of intuitively desirable coherence properties for heuristic estimators that are not satisfied by any existing candidates. Then we present our main open problem: is there a heuristic estimator that formalizes intuitively valid applications of the presumption of independence without also accepting spurious arguments?

READ FULL TEXT

page 1

page 2

page 3

page 4

09/22/2020

On the number of contingency tables and the independence heuristic

We obtain sharp asymptotic estimates on the number of n × n contingency ...
06/14/2019

Matroidal Approximations of Independence Systems

Milgrom (2017) has proposed a heuristic for determining a maximum weight...
03/08/2000

Declarative Representation of Revision Strategies

In this paper we introduce a nonmonotonic framework for belief revision ...
01/22/2022

Physical Reasoning in an Open World

Most work on physical reasoning, both in artificial intelligence and in ...
06/22/2023

Inferring the finest pattern of mutual independence from data

For a random variable X, we are interested in the blind extraction of it...
07/01/2021

A conditional independence test for causality in econometrics

The Y-test is a useful tool for detecting missing confounders in the con...
02/04/2014

Irrelevant and independent natural extension for sets of desirable gambles

The results in this paper add useful tools to the theory of sets of desi...