If you could follow the last post then you have all the pieces you need to understand the basic theory. Let’s go back and actually work this out in the abstract now that we have an example for our template. If you only care about seeing some examples in action, then you should feel free to skip this post which will be almost entirely defining the pieces of the last post more rigorously. We will need to revise some things from the first post, because we were able to state things in a simpler form without Bayesian updating or continuous distributions happening.
Last time we introduced a one-parameter family of unknowns, the true bias of the coin. We denoted this . For now we’ll keep this to just be some continuous real-valued parameter and it will represent an unknown quantity in our model. If you haven’t thought about this before, then I recommend continuing in the way we did last post. You pretend like is some fixed known quantity and run classical decision theory. From there you extrapolate. The value of this parameter could be this, or this, or this, and my decision has to be the best no matter what it really is.
In the future, there could be a whole bunch of unknowns and will turn into a vector or matrix, but for now we’ll stick to just a single variable. To pin down terminology, we will call the parameter and the parameter space (all the possible values of ). So in our coin example .
We also have a collection of actions: . An individual action will be denoted by . For the coin example, an action would be betting on heads or tails. We will never be able to know … because it is an unknown, but we will want to make observations/gather data which will be denoted . In the coin example, this would be our observed sequence of flips (so it is probably best represented as a vector). We will denote the collection of all possible observations and this is called the sample space. In the coin example, we flipped the coin times, so this consists of vectors. In general, we will want to allow to be continuous random variables and hence could be subsets of .
Let (suggestively we will often want to consider an “interval” if we just have one continuous random variable). As I already pointed out earlier, we will often want to take the view of a given fixed . In this situation we will assume for the purposes of being able to analyze things that we always have an integrable probability distribution which is “the probability of observing x given “. Thus, by definition, the probability of observing given is just the integral:
I won’t adopt the cumbersome notation that some texts use to indicate that this could be an integral or a finite sum. I will just use the integral, and assume the reader can translate to the appropriate sum if is discrete. If we have some function , then we define the expected value of over to be
Now that that is settled, let’s formalize the decision function, loss, and risk. Suppose that we have some prior probability describing the possibilities for . We denote this . The choice of such a thing in the absence of any actual prior knowledge is one of the main (only?) arguments against Bayesian statistics. This shouldn’t be distressing, because any reasonable experiment will have a large enough sample size that picking an uninformed uniform prior will easily be overcome.
In the first decision theory post, we made a decision rule without basing it on any data. This is why we need to change our definition a little. In that situation a decision rule is equivalent to picking an action. If observing some data is involved, then our decision rule is a function . This should just be read, “If I observe this type of data, then I will act in this way.” You let the data inform your decision. Our decision rule in the coin example was to look at the ratio of heads to tails. If there were more heads we pick heads. If there were more tails, we pick tails.
The loss function is a function . This is the choice that people should feel a little uncomfortable with, because there is a definite choice that may or may not be reasonable affecting everything. The value should measure the loss that will be incurred if you do action and is the true value of the unknown.
We won’t worry so much about this right now. The more important one for us is the decision loss function . This is just plugging in to the other one: . Sometimes we just start with this one though. This was a no-brainer for our coin example, because I purposely set up the question to have a natural loss function. This was due to the fact that a well-defined “bet” was being made. In more general situations, the choice of a loss function could be seen as essentially equivalent to picking a betting scheme for your choices. You could easily come up with some wacky ones to see that it might not reflect reality if you aren’t careful.
To me the more “intuitive” notion is that of the risk function. This is the expected value of the loss:
Note we integrate out the random variables , but we are left over with a function of . We saw this in our coin example last time. We get a similar thing for the Bayesian risk, but we incorporate the prior probability of . Lots of times it is actually somewhat easier to just jump right to the risk, because in the case of squared-error loss (see we just get that the risk is the variance of the posterior distribution. No extra intermediary calculations are needed.
In general, most loss functions will be a variant on one of two types. The first is called the squared-error loss function. It is given by . You can think of this as “least-squares” fitting your decision or minimizing risk in the -norm. The other is called the loss function. This one arises quite naturally when you just have to pick between two choices like the coin flip. Ours was a variant on this. It penalizes you by unit if your “decision is incorrect” and doesn’t penalize you at all if your “decision is correct.” It is given by
The beautiful thing about this one is that the risk is just minus the posterior distribution. Thus, it is minimized at the max of the posterior which is often really easy to calculate. In the coin example, we got the beta distribution and hence the max was just the mean. Of course, we have to be careful that we are measuring the right thing, because we aren’t trying to predict the true bias. We were merely trying to predict heads or tails so that situation was an even easier discrete version.
Lastly, there is a partial ordering on decision functions given by if and only if for all . A minimum in this ordering is called admissible and corresponds to a rational decision. If you make some other decision you are just asking to lose more.
Well, I think this post has gone on long enough (I’ve basically been trapped at the airport for the past 8 hours, so …). We’ll get back to some examples of all this next time. I just needed to finally formalize what we were doing before going any further.