Why Prefer Any Decision Theory?

tl;dr Functional Decision Theory does actually give the right answers. People who construct scenarios where it doesn’t, or take umbrage at the idea of “fair problems” are falling foul of symmetry arguments, and would never apply this level of scrutiny to any other system of making decisions.

Intro

Bentham’s Bulldog recently posted an attempted takedown of Functional Decision Theory on LessWrong. This is probably the second bravest post I’ve seen someone in the EA/​Rat sphere post on LessWrong.

His first argument was that FDT is not mathematically well-defined, because logical counterfactuals are not well-understood and, as he argues, can never be well-defined. I don’t know enough about the state of the logical counterfactual research, so I’ll leave that to a pro decision theorist to explain.

His second argument was that FDT gives the wrong answer sometimes. I think that he skips up and down different levels of demand for rigor, when talking about different decision theories. I think FDT beats CDT, or at least ties, at basically every point on the spectrum between totally abstract and totally practical.

Decision Problems as a Tower of Assumptions

The standard jumping off point for decision theories is the set of fair problems with perfect information about the overall scenario:

  1. You get to make decisions

  2. Various decision theorist trickster gods such as Omega get to perfectly simulate you

  3. You know, ahead of time, everything about the situation including what kinds of simulations you might be put in

    1. This doesn’t mean you have perfect information about which of two identical situations you’re in, once the situation starts, but it does mean you can have a well-calibrated Bayesian prior over it.

  4. The agent can only simulate your actions, and doesn’t have access to information about your decision theory

This includes the famous Newcomb’s Problem[1]. It’s worth working through Newcomb’s problem in an FDT language, since that will be instructive for cases in the future. FDT reasons through problems as follows:

  • In this world, there are two instances of FDT, which are both given the same input (a decision theorist trickster saying “I am Omega, this is Newcomb’s problem) so they both have to give the same output as well

    • If they both choose two-box, then the reward is $1,000.

    • If they both choose one-box, then the reward is $1,000,000.

  • Therefore, the optimal output for FDT, is to one-box

  • Therefore [outputs one-box]

Newcomb’s Revenge

Bentham’s Bulldog has brought up Newcomb’s Revenge[2], which does not fall into this class. Why not?

Let’s try to set Newcomb’s Revenge up using the previous ruleset.

  • In the world of Newcomb’s Revenge, there are two instances of FDT which affect the world, one outside of Omicron, and one inside of Omicron.

  • Both of them can decide independently, because the simulated one inside Omicron sees a decision theorist trickster God saying “I am Omega, this is Newcomb’s problem” the one outside Omicron sees a decision theorist trickster God saying “I am Omicron, this is Newcomb’s Revenge”.

    • If both instances output one-box, total reward is $0

    • If Omicron instance outputs one-box and Omega instance outputs two-box, total reward is $1,000,000

    • If Omicron instance outputs two-box and Omega instance outputs one-box, total reward is $1,000

    • If both instances output two-box, total reward is $1,001,000

  • The optimal choice is for both instances to two-box, since this gets a reward of $1,001,000

  • Therefore [outputs two-box for Omicron, outputs two-box for Omega]

But wait? I thought FDT chose one-box in Newcomb’s Problem? Well, in this case we’ve given it perfect information! It knows it’s in Newcomb’s Revenge world, so it’s changed its answer!

In order to get FDT to fail in Newcomb’s Revenge, we need the simulated FDT agent to believe that it’s in the original Newcomb’s problem. This drops rule 3.

Why Not Allow Deception?

The problem with allowing deception is that the class of problems with deception does not have any winners in terms of decision theory! Roughly, if Omicron can trick you, then for any problem where a decision theory believe’s it’s in situation , there exists a symmetric problem , which is identical but with the payoff matrix reversed.

We can a problem we might call “Newcomb’s Apology” where Omelette simulates your decision in Newcomb’s problem, then puts the $1,000,000 dollars in the box iff you one-box. In this case, CDT gets $1,000 and FDT gets $1,001,000, exactly parallel to Newcomb’s revenge where CDT gets $1,001,000 and FDT gets $1,000.

“Unfair Problems”

There’s an equivalent issue where, if you drop rule 4 and let the decision theory trickster gods make decisions directly based on your decision theory algorithm, then no decision theory can possibly win either. These are typically called “unfair” problems, which sounds like a cop-out, but I don’t think it is. As with the total-lying problems, there’s an exact symmetry where if, in one problem, Omnomnom shows up and puts $1,000,000 in the box iff you use CDT, then there exists a corresponding problem where Ompalompa shows up and puts $1,000,000 in the box iff you use FDT. In this case we don’t even need a first box.

The reason for rules 3 and 4 is that they provide too large of a space. Dropping rules 3 and 4 runs us into the territory of no-free-lunch theorems. The problem with no-free-lunch theorems is that if you buy into them, you’ll quite often give up on lunch forever, and go hungry. As one example, there’s the theorem that appears to prove that no brain can ever exist and intelligence is fake, which rules out [gestures vaguely at everything]. A good rule of thumb is that when you run into a no-free-lunch theorem, you need a prior.

Priors and Weightings

If you don’t want to think in terms of Bayesian Priors, how about we think about getting an overall “score” for each decision theory by giving a weight to each possible problem, and then adding up the scores, multiplied by the weight. Let’s say that our weights have to add to 1, without loss of generality. For the problems we’ve looked at, we’ll get the following scores:

Problem

Weight

FDT Score

CDT Score

Newcomb

$1,000,000

$1,000

Revenge (simulated agent deceived)

$1,000

$1,001,000

Apology (simulated agent deceived)

$1,001,000

$1,000

CDT <3 (unfair)

$0

$1,000,000

FDT <3 (unfair)

$1,000,000

$0

Now we might say that revenge and apology are in some sense symmetrical, and that CDT <3 and FDT <3 are in some sense symmetrical. If we do that, we ought to enforce and . So then the only difference beteween the two comes from . FDT still wins so long as we respect the symmetry of the system!

Isolated Demands for Rigor

Now I’ve gone through a huge amount of stuff here, because it’s worth going through the maths to justify an intuition that everyone already has: mostly focus on scenarios where you have a decent model of the world.

As an example: I don’t torture people, because I think it’s wrong, because of evidence. Now it is possible to construct a world in which this ethical rule is false: suppose that actually, every person except me has a four-dimensional wire in place of their brain, which goes to a five-dimensional daemon consciousness which actually loves being tortured and just role-plays as someone who dislikes it. Obviously this is stupid and we don’t take this into account in the real world. Obviously we mostly evaluate theories in the worlds where people are basically correct about the world.

(And of course, the possibility of that is immediately cancelled out by the possibility of 5-d daemons who hate torture and are role-playing).

Now you might say, OK, but Newcomb’s problem is pretty contrived. You might bucket the scenarios like this:

  • Realistic: {torture is bad for normal reasons}

  • Unrealistic: {Newcomb’s problem, Newcomb’s revenge, Newcomb’s Apology, …, torture is good because of 5-d daemons, torture is bad because of 5-daemons}

In which case ooh boy do I have some examples for you.

Parfit’s Hitchhiker

Suppose you’re dying of thirst in the desert. Someone comes along and offers to drive you to the nearest town, but only if you give them money to cover their detour. You don’t have money on you, but can take some out when you get there. They will only take you if they think you’ll pay. Do you pay?

FDT says yes, CDT says no. EDT (Oh you thought you were getting off scot-free, EDT?) also says no. If the driver is a good predictor then FDT lives, CDT and EDT die in the heat of the sands.

Now, you may say, the driver is probably not a great predictor of me. FDT was originally invented to reason about AIs, who could inspect each other’s source code, and probably can tell what decision theory each other are following. The random driver cannot do that, but they can get some information about you! People are constantly leaking information about what rules they follow, in some cases by posting long blogposts which tell anyone reading them “I DO NOT PAY IN PARFIT’S HITCHHIKER AND I GIVE IN TO BLACKMAIL”.

(To be clear, I think that Bentham’s Bulldog probably would pay in Parfit’s Hitchhiker, even if there were no consequences to not paying, but for reasons not well captured by utilitarian CDT)

CDT does not, in general, have a good way to pre-commit to actions. Nor does EDT. Since pre-commiting to actions is extremely common in real life (“I will hire you if and only if I think you won’t slack off and cause trouble for me”) this is a huge deal which favours FDT over EDT and CDT.

Updateless decision theory does, and indeed Bentham’s Bulldog mentions it as an alternative to CDT. Updateless decision theory has a bunch of its own problems, which I won’t go into here, since this post isn’t supposed to litigate between UDT and FDT, but rather to show the non-validity of a very particular argument.

(I think there’s also a weird set of self-modifications that a CDT agent might perform, which switches it into a thing called son-of-CDT, which is a bit more like FDT but not quite the same, but I have honestly only seen this come up once and I think it’s deep MIRI lore)

Summary

  • If we limit ourselves to fair problems without deception as to which problem you’re in then it makes sense to say that one decision theory is better than another

    • And FDT wins in lots of these problems

  • If you expand your universe to unfair problems, or allow a more general notion of deception, then you can construct arbitrary problems where any decision theory wins

  • If you then apply a metric to these problems, by symmetry, only the component of fair problems with limited deception matters

    • So we’re back to FDT winning

  • If you actually care about non-contrived real problems, then the most common issue which comes up which is decision-theoretically relevant is pre-commitment

    • But FDT and UDT (and a few weird others) are the only systems which can pre-commit to things

  1. ^

    Well-known. Omega offers you the choice to take or leave $1,000, and, if it predicts you will leave the $1,000 on the table, gives you $1,000,000.

  2. ^

    Omicron offers you the same choice as Omega, but gives you $1,000,000 if you take the $1,000 in Newcomb’s problem. You can still take or leave the $1,000 but this doesn’t really matter at all, you might as well take it.