This question is in the spirit of “I think I’m doing something dumb / obviously wrong—help me see why” but it’s maybe too niche for this thread. (Answers that redirect me to a better place to ask are welcome.)
I recently read Paul Christiano, Eric Neyman and Mark Xu’s “Formalizing the presumption of independence” (https://arxiv.org/pdf/2211.06738.pdf). My understanding is that they aim to formalise some types of reasonable (but defeasible) “hand-waving” in otherwise formal proofs, in a way that maintains the underlying deductive structure of a formal proof and responds appropriately to new information / arguments. They’re particularly interested in heuristic estimators that presume the independence of random variables so long as we have no reason to think the variables aren’t independent and so long as we can adjust the estimate appropriately if we learn about their dependencies.
To that end, suppose we want to estimate f(X1,…,Xn), where {Xi}1≤n is a set of real-valued random variables, f:Rn→R, and we have a collection of deductively proved (in)equalities π=π(X1,…,Xn) about {Xi}1≤n. Then a natural heuristic estimator could be:
~E(f(X1,…,Xn)|π)=E(f(X′1,…,X′n)|π′)
where each X′i has the same marginal distributions as Xi, π′=π(X′1,…,X′n) (i.e.π′ is equal to π but with each instance of Xi replaced by X′i), and where the X′i are conditionally independent given π′. This formalises the idea that we assume we’ve thought of all the dependencies between the variables of interest and that they’re independent, conditional on everything we’ve thought of so far—but we can revise this estimate by conditioning on new information and dependencies later.
Before considering any information relating the Xi to each other, ~E assumes that they are unconditionally independent. As we condition on information about them, we update the estimate to account for this and maintain that the variables are conditionally independent, given the information considered so far. E.g. in the twin primes example, we can initially assume that {x is prime} and {x+2 is prime} are independent, and then condition on the fact that if x is prime, then x+2 is odd (this can be operationalised by considering the appropriate indicator function and conditioning on it taking value 1) to adjust the estimate and assume (for now) that there are no further dependencies.
We always have ~E(XY)=E(X′Y′)=E(X′)E(Y′). In fact, we always have ~E(XY|π)=E(X′|π′)E(Y′|π′). If we further have that π doesn’t relate X and Y (i.e. doesn’t include a formula containing both X and Y), then I think we have E(X′|π′)=E(X|π) and E(Y′|π′)=E(Y|π), giving ~E(XY|π)=E(X|π)E(Y|π) (i.e. without the primes).
My suggested heuristic estimator apparently has lots of nice properties thanks to being an expectation, including some of the informal properties listed in the paper, which can be stated formally (e.g. if πj doesn’t have an instance of any of the Xi, then conditioning on it won’t change the heuristic estimate).
My suggested estimator jumped out to me pretty quickly as capturing (to my understanding) what the authors want, but I’d expect myself to be much worse at this than the authors, who will have spent a while longer thinking about it. So my estimator seems “too good to be true” and I think it’s likely I’m pretty confused or missing something obvious and/or important. Please help me see what I’m missing! A couple of hypotheses:
There’s something wrong / incoherent about my suggested heuristic estimator
My suggested heuristic estimator is too general to be useful
The paper mainly considers very specific special cases with specific algorithms for heuristic estimators rather than something as general as this, which might be difficult to implement in practice
I thought it dealt with these ok—could you be more specific?
It’s linear because it’s an expectation. It is under-specified in that it needs us to assume or prove the marginal distributions for the Xi and I guess that’s problematic if an algorithm for doing that is a big part of what the authors are looking for. But if we do have marginal distributions for each Xi, then E(X2i),E(X′2i),E(X′2i|π′) are well-defined and ~E(∑ni=1X2i|π)=∑ni=1E(X′2i|π′).
This question is in the spirit of “I think I’m doing something dumb / obviously wrong—help me see why” but it’s maybe too niche for this thread. (Answers that redirect me to a better place to ask are welcome.)
I recently read Paul Christiano, Eric Neyman and Mark Xu’s “Formalizing the presumption of independence” (https://arxiv.org/pdf/2211.06738.pdf). My understanding is that they aim to formalise some types of reasonable (but defeasible) “hand-waving” in otherwise formal proofs, in a way that maintains the underlying deductive structure of a formal proof and responds appropriately to new information / arguments. They’re particularly interested in heuristic estimators that presume the independence of random variables so long as we have no reason to think the variables aren’t independent and so long as we can adjust the estimate appropriately if we learn about their dependencies.
To that end, suppose we want to estimate f(X1,…,Xn), where {Xi}1≤n is a set of real-valued random variables, f:Rn→R, and we have a collection of deductively proved (in)equalities π=π(X1,…,Xn) about {Xi}1≤n. Then a natural heuristic estimator could be:
~E(f(X1,…,Xn)|π)=E(f(X′1,…,X′n)|π′)
where each X′i has the same marginal distributions as Xi, π′=π(X′1,…,X′n) (i.e.π′ is equal to π but with each instance of Xi replaced by X′i), and where the X′i are conditionally independent given π′. This formalises the idea that we assume we’ve thought of all the dependencies between the variables of interest and that they’re independent, conditional on everything we’ve thought of so far—but we can revise this estimate by conditioning on new information and dependencies later.
Before considering any information relating the Xi to each other, ~E assumes that they are unconditionally independent. As we condition on information about them, we update the estimate to account for this and maintain that the variables are conditionally independent, given the information considered so far. E.g. in the twin primes example, we can initially assume that {x is prime} and {x+2 is prime} are independent, and then condition on the fact that if x is prime, then x+2 is odd (this can be operationalised by considering the appropriate indicator function and conditioning on it taking value 1) to adjust the estimate and assume (for now) that there are no further dependencies.
We always have ~E(XY)=E(X′Y′)=E(X′)E(Y′). In fact, we always have ~E(XY|π)=E(X′|π′)E(Y′|π′). If we further have that π doesn’t relate X and Y (i.e. doesn’t include a formula containing both X and Y), then I think we have E(X′|π′)=E(X|π) and E(Y′|π′)=E(Y|π), giving ~E(XY|π)=E(X|π)E(Y|π) (i.e. without the primes).
My suggested heuristic estimator apparently has lots of nice properties thanks to being an expectation, including some of the informal properties listed in the paper, which can be stated formally (e.g. if πj doesn’t have an instance of any of the Xi, then conditioning on it won’t change the heuristic estimate).
My suggested estimator jumped out to me pretty quickly as capturing (to my understanding) what the authors want, but I’d expect myself to be much worse at this than the authors, who will have spent a while longer thinking about it. So my estimator seems “too good to be true” and I think it’s likely I’m pretty confused or missing something obvious and/or important. Please help me see what I’m missing! A couple of hypotheses:
There’s something wrong / incoherent about my suggested heuristic estimator
My suggested heuristic estimator is too general to be useful
The paper mainly considers very specific special cases with specific algorithms for heuristic estimators rather than something as general as this, which might be difficult to implement in practice
How does your hereustic estimator deal with sums of squares? Is it linear?
I thought it dealt with these ok—could you be more specific?
It’s linear because it’s an expectation. It is under-specified in that it needs us to assume or prove the marginal distributions for the Xi and I guess that’s problematic if an algorithm for doing that is a big part of what the authors are looking for. But if we do have marginal distributions for each Xi, then E(X2i),E(X′2i),E(X′2i|π′) are well-defined and ~E(∑ni=1X2i|π)=∑ni=1E(X′2i|π′).