In statistical decision theory, a randomised decision rule or mixed decision rule is a decision rule that associates probabilities with deterministic decision rules. In finite decision problems, randomised decision rules define a risk set which is the convex hull of the risk points of the nonrandomised decision rules.

As nonrandomised alternatives always exist to randomised Bayes rules, randomisation is not needed in Bayesian statistics, although frequentist statistical theory sometimes requires the use of randomised rules to satisfy optimality conditions such as minimax, most notably when deriving confidence intervals and hypothesis tests about discrete probability distributions.

A statistical test making use of a randomized decision rule is called a randomized test.

Definition and interpretation

Let ${\displaystyle {\mathcal {D))=\{d_{1},d_{2}...,d_{h}\))$ be a set of non-randomised decision rules with associated probabilities ${\displaystyle p_{1},p_{2},...,p_{h))$. Then the randomised decision rule ${\displaystyle d^{*))$ is defined as ${\displaystyle \sum _{i=1}^{h}p_{i}d_{i))$ and its associated risk function ${\displaystyle R(\theta ,d^{*})}$ is ${\displaystyle \sum _{i=1}^{h}p_{i}R(\theta ,d_{i})}$.^[1] This rule can be treated as a random experiment in which the decision rules ${\displaystyle d_{1},...,d_{h}\in {\mathcal {D))}$ are selected with probabilities ${\displaystyle p_{1},...p_{h))$ respectively.^[2]

Alternatively, a randomised decision rule may assign probabilities directly on elements of the actions space ${\displaystyle {\mathcal {A))}$ for each member of the sample space. More formally, ${\displaystyle d^{*}(x,A)}$ denotes the probability that an action ${\displaystyle a\in {\mathcal {A))}$ is chosen. Under this approach, its loss function is also defined directly as: ${\displaystyle \int _{A\in {\mathcal {A))}d^{*}(x,A)L(\theta ,A)dA}$.^[3]

The introduction of randomised decision rules thus creates a larger decision space from which the statistician may choose his decision. As non-randomised decision rules are a special case of randomised decision rules where one decision or action has probability 1, the original decision space ${\displaystyle {\mathcal {D))}$ is a proper subset of the new decision space ${\displaystyle {\mathcal {D))^{*))$.^[4]

Selection of randomised decision rules

As with nonrandomised decision rules, randomised decision rules may satisfy favourable properties such as admissibility, minimaxity and Bayes. This shall be illustrated in the case of a finite decision problem, i.e. a problem where the parameter space is a finite set of, say, ${\displaystyle k}$ elements. The risk set, henceforth denoted as ${\displaystyle {\mathcal {S))}$, is the set of all vectors in which each entry is the value of the risk function associated with a randomised decision rule under a certain parameter: it contains all vectors of the form ${\displaystyle (R(\theta _{1},d^{*}),...R(\theta _{k},d^{*})),d^{*}\in {\mathcal {D))^{*))$. Note that by the definition of the randomised decision rule, the risk set is the convex hull of the risks ${\displaystyle (R(\theta _{1},d),...R(\theta _{k},d)),d\in {\mathcal {D))}$.^[5]

In the case where the parameter space has only two elements ${\displaystyle \theta _{1))$ and ${\displaystyle \theta _{2))$, this constitutes a subset of ${\displaystyle \mathbb {R} ^{2))$, so it may be drawn with respect to the coordinate axes ${\displaystyle R_{1))$ and ${\displaystyle R_{2))$ corresponding to the risks under ${\displaystyle \theta _{1))$ and ${\displaystyle \theta _{2))$ respectively.^[6] An example is shown on the right.

Admissibility

An admissible decision rule is one that is not dominated by any other decision rule, i.e. there is no decision rule that has equal risk as or lower risk than it for all parameters and strictly lower risk than it for some parameter. In a finite decision problem, the risk point of an admissible decision rule has either lower x-coordinates or y-coordinates than all other risk points or, more formally, it is the set of rules with risk points of the form ${\displaystyle (a,b)}$ such that ${\displaystyle \{(R_{1},R_{2}):R_{1}\leq a,R_{2}\leq b\}\cap {\mathcal {S))=(a,b)}$. Thus the left side of the lower boundary of the risk set is the set of admissible decision rules.^[6][7]

Minimax

A minimax Bayes rule is one that minimises the supremum risk ${\displaystyle \sup _{\theta \in \Theta }R(\theta ,d^{*})}$ among all decision rules in ${\displaystyle {\mathcal {D))^{*))$. Sometimes, a randomised decision rule may perform better than all other nonrandomised decision rules in this regard.^[1]

In a finite decision problem with two possible parameters, the minimax rule can be found by considering the family of squares ${\displaystyle Q(c)=\{(R_{1},R_{2}):0\leq R_{1}\leq c,0\leq R_{2}\leq c\))$.^[8] The value of ${\displaystyle c}$ for the smallest of such squares that touches ${\displaystyle {\mathcal {S))}$ is the minimax risk and the corresponding point or points on the risk set is the minimax rule.

If the risk set intersects the line ${\displaystyle R_{1}=R_{2))$, then the admissible decision rule lying on the line is minimax. If ${\displaystyle R_{2}>R_{1))$ or ${\displaystyle R_{1}>R_{2))$ holds for every point in the risk set, then the minimax rule can either be an extreme point (i.e. a nonrandomised decision rule) or a line connecting two extreme points (nonrandomised decision rules).^[9][6]

• 
  The minimax rule is the randomised decision rule ${\displaystyle (1-p)d_{1}+pd_{2))$.
• 
  The minimax rule is ${\displaystyle d_{2))$.
• 
  The minimax rules are all rules of the form ${\displaystyle (1-p)d_{1}+pd_{2))$, ${\displaystyle 0\leq p\leq 1}$.

Bayes

A randomised Bayes rule is one that has infimum Bayes risk ${\displaystyle r(\pi ,d^{*})}$ among all decision rules. In the special case where the parameter space has two elements, the line ${\displaystyle \pi _{1}R_{1}+(1-\pi _{1})R_{2}=c}$, where ${\displaystyle \pi _{1))$ and ${\displaystyle \pi _{2))$ denote the prior probabilities of ${\displaystyle \theta _{1))$ and ${\displaystyle \theta _{2))$ respectively, is a family of points with Bayes risk ${\displaystyle c}$. The minimum Bayes risk for the decision problem is therefore the smallest ${\displaystyle c}$ such that the line touches the risk set.^[10][11] This line may either touch only one extreme point of the risk set, i.e. correspond to a nonrandomised decision rule, or overlap with an entire side of the risk set, i.e. correspond to two nonrandomised decision rules and randomised decision rules combining the two. This is illustrated by the three situations below:

• 
  The Bayes rules are the set of decision rules of the form ${\displaystyle (1-p)d_{1}+pd_{2))$, ${\displaystyle 0\leq p\leq 1}$.
• 
  The Bayes rule is ${\displaystyle d_{1))$.
• 
  The Bayes rule is ${\displaystyle d_{2))$.

As different priors result in different slopes, the set of all rules that are Bayes with respect to some prior are the same as the set of admissible rules.^[12]

Note that no situation is possible where a nonrandomised Bayes rule does not exist but a randomised Bayes rule does. The existence of a randomised Bayes rule implies the existence of a nonrandomised Bayes rule. This is also true in the general case, even with infinite parameter space, infinite Bayes risk, and regardless of whether the infimum Bayes risk can be attained.^[3][12] This supports the intuitive notion that the statistician need not utilise randomisation to arrive at statistical decisions.^[4]

In practice

As randomised Bayes rules always have nonrandomised alternatives, they are unnecessary in Bayesian statistics. However, in frequentist statistics, randomised rules are theoretically necessary under certain situations,^[13] and were thought to be useful in practice when they were first invented: Egon Pearson forecast that they 'will not meet with strong objection'.^[14] However, few statisticians actually implement them nowadays.^[14][15]

Randomised test

Randomized tests should not be confused with permutation tests.^[16]

In the usual formulation of the likelihood ratio test, the null hypothesis is rejected whenever the likelihood ratio ${\displaystyle \Lambda }$ is smaller than some constant ${\displaystyle K}$, and accepted otherwise. However, this is sometimes problematic when ${\displaystyle \Lambda }$ is discrete under the null hypothesis, when ${\displaystyle \Lambda =K}$ is possible.

A solution is to define a test function ${\displaystyle \phi (x)}$, whose value is the probability at which the null hypothesis is accepted:^[17][18]

${\displaystyle \phi (x)=\left\((\begin{array}{l}1&{\text{ if ))\Lambda >K\\p(x)&{\text{ if ))\Lambda =K\\0&{\text{ if ))\Lambda <K\end{array))\right.}$

This can be interpreted as flipping a biased coin with a probability ${\displaystyle p(x)}$ of returning heads whenever ${\displaystyle \Lambda =k}$ and rejecting the null hypothesis if a heads turns up.^[15]

A generalised form of the Neyman–Pearson lemma states that this test has maximum power among all tests at the same significance level ${\displaystyle \alpha }$, that such a test must exist for any significance level ${\displaystyle \alpha }$, and that the test is unique under normal situations.^[19]

As an example, consider the case where the underlying distribution is Bernoulli with probability ${\displaystyle p}$, and we would like to test the null hypothesis ${\displaystyle p\leq \lambda }$ against the alternative hypothesis ${\displaystyle p>\lambda }$. It is natural to choose some ${\displaystyle k}$ such that ${\displaystyle P({\hat {p))>k|H_{0})=\alpha }$, and reject the null whenever ${\displaystyle {\hat {p))>k}$, where ${\displaystyle {\hat {p))}$ is the test statistic. However, to take into account cases where ${\displaystyle {\hat {p))=k}$ , we define the test function:

${\displaystyle \phi (x)=\left\((\begin{array}{l}1&{\text{ if )){\hat {p))>k\\\gamma &{\text{ if )){\hat {p))=k\\0&{\text{ if )){\hat {p))<k\end{array))\right.}$

where ${\displaystyle \gamma }$ is chosen such that ${\displaystyle P({\hat {p))>k|H_{0})+\gamma P({\hat {p))=k|H_{0})=\alpha }$.

Randomised confidence intervals

An analogous problem arises in the construction of confidence intervals. For instance, the Clopper-Pearson interval is always conservative because of the discrete nature of the binomial distribution. An alternative is to find the upper and lower confidence limits ${\displaystyle U}$ and ${\displaystyle L}$ by solving the following equations:^[14]

${\displaystyle \left\((\begin{array}{l}Pr({\hat {p))<k|p=U)+\gamma P({\hat {p))=k|p=U)&=\alpha /2\\Pr({\hat {p))>k|p=L)+\gamma P({\hat {p))=k|p=L)&=\alpha /2\end{array))\right.}$

where ${\displaystyle \gamma }$ is a uniform random variable on (0, 1).