Categorical distribution

Categorical
Parameters k > 0 number of categories (integer)
p_1, \ldots, p_k event probabilities (\Sigma p_i = 1)
Support x \in \{1,\dots,k\}
pmf

(1) p(x=i)=p_i
(2) p(x) = p_1^{[x=1]} \cdots p_k^{[x=k]}
(3) p(x) = [x=1]\cdot p_1 \, + \dots + \, [x=k]\cdot p_k

CDF \begin{cases} 0 & \text{for }x<1 \\ \sum_{j=1}^i p_j & \text{for }x \in [i,i+1) \\ 1 & \text{for }x \geq k \end{cases}
Mean \operatorname{E}([x=i]) = p_i, this is the mean of the Iverson bracket [x=i] and not the mean of x
Median i\text{ such that }\sum_{j=1}^{i-1} p_j \leq 0.5\text{ and }\sum_{j=1}^{i} p_j \geq 0.5
Mode i\text{ such that }p_i=\max(p_1, \ldots, p_k)
Variance \textstyle{\mathrm{Var}}([x=i]) = p_i (1-p_i)
\textstyle {\mathrm{Cov}}([x=i],[x=j]) = - p_i p_j~~(i\neq j)
MGF \sum_{i=1}^k p_i e^{t_i}
CF \sum_{j=1}^k p_je^{it_j} where i^2= -1
PGF \sum_{i=1}^k p_i z_i\text{ for }(z_1,\ldots,z_k)\in\mathbb{C}^k

In probability theory and statistics, a categorical distribution (also called a "generalized Bernoulli distribution" or, less precisely, a "discrete distribution") is a probability distribution that describes the result of a random event that can take on one of K possible outcomes, with the probability of each outcome separately specified. There is not necessarily an underlying ordering of these outcomes, but numerical labels are attached for convenience in describing the distribution, often in the range 1 to K. Note that the K-dimensional categorical distribution is the most general distribution over a K-way event; any other discrete distribution over a size-K sample space is a special case. The parameters specifying the probabilities of each possible outcome are constrained only by the fact that each must be in the range 0 to 1, and all must sum to 1.

The categorical distribution is the generalization of the Bernoulli distribution for a categorical random variable, i.e. for a discrete variable with more than two possible outcomes.

Terminology

Occasionally, the categorical distribution is termed the "discrete distribution". However, this properly refers not to one particular family of distributions but to a general class of distributions.

Note that, in some fields, such as machine learning and natural language processing, the categorical and multinomial distributions are conflated, and it is common to speak of a "multinomial distribution" when a categorical distribution is actually meant.[1] This imprecise usage stems from the fact that it is sometimes convenient to express the outcome of a categorical distribution as a "1-of-K" vector (a vector with one element containing a 1 and all other elements containing a 0) rather than as an integer in the range 1 to K; in this form, a categorical distribution is equivalent to a multinomial distribution for a single observation (see below).

However, conflating the categorical and multinomial distributions can lead to problems. For example, in a Dirichlet-multinomial distribution, which arises commonly in natural language processing models (although not usually with this name) as a result of collapsed Gibbs sampling where Dirichlet distributions are collapsed out of a Hierarchical Bayesian model, it is very important to distinguish categorical from multinomial. The joint distribution of the same variables with the same Dirichlet-multinomial distribution has two different forms depending on whether it is characterized as a distribution whose domain is over individual categorical nodes or over multinomial-style counts of nodes in each particular category (similar to the distinction between a set of Bernoulli-distributed nodes and a single binomial-distributed node). Both forms have very similar-looking probability mass functions (PMF's), which both make reference to multinomial-style counts of nodes in a category. However, the multinomial-style PMF has an extra factor, a multinomial coefficient, that is a constant equal to 1 in the categorical-style PMF. Confusing the two can easily lead to incorrect results in settings where this extra factor is not constant with respect to the distributions of interest. The factor is frequently constant in the complete conditionals used in Gibbs sampling and the optimal distributions in variational methods.

Introduction

A categorical distribution is a discrete probability distribution whose sample space is the set of k individually identified items. It is the generalization of the Bernoulli distribution for a categorical random variable.

In one formulation of the distribution, the sample space is taken to be a finite sequence of integers. The exact integers used as labels are unimportant; they might be {0, 1, ..., k-1} or {1, 2, ..., k} or any other arbitrary set of values. In the following descriptions, we use {1, 2, ..., k} for convenience, although this disagrees with the convention for the Bernoulli distribution, which uses {0, 1}. In this case, the probability mass function f is:

f(x=i| \boldsymbol{p} ) = p_i ,

where \boldsymbol{p} = (p_1,...,p_k), p_i represents the probability of seeing element i and \textstyle{\sum_{i=1}^k p_i = 1}.

Another formulation that appears more complex but facilitates mathematical manipulations is as follows, using the Iverson bracket:[2]

f(x| \boldsymbol{p} ) = \prod_{i=1}^k p_i^{[x=i]} ,

where [x=i] evaluates to 1 if x=i, 0 otherwise. There are various advantages of this formulation, e.g.:

Yet another formulation makes explicit the connection between the categorical and multinomial distributions by treating the categorical distribution as a special case of the multinomial distribution in which the parameter n of the multinomial distribution (the number of sampled items) is fixed at 1. In this formulation, the sample space can be considered to be the set of 1-of-K encoded[3] random vectors x of dimension k having the property that exactly one element has the value 1 and the others have the value 0. The particular element having the value 1 indicates which category has been chosen. The probability mass function f in this formulation is:

f( \mathbf{x}| \boldsymbol{p} ) = \prod_{i=1}^k p_i^{x_i} ,

where p_i represents the probability of seeing element i and \textstyle{\sum_i p_i = 1}. This is the formulation adopted by Bishop.[3][nb 1]

Properties

The possible probabilities for the categorical distribution with k = 3 are the 2-simplex p_1+p_2+p_3 = 1, embedded in 3-space.
Y_i=I(\boldsymbol{X}=i),
where I is the indicator function. Then Y has a distribution which is a special case of the multinomial distribution with parameter n=1. The sum of n independent and identically distributed such random variables Y constructed from a categorical distribution with parameter \boldsymbol{p} is multinomially distributed with parameters n and \boldsymbol{p} .

With a conjugate prior

In Bayesian statistics, the Dirichlet distribution is the conjugate prior distribution of the categorical distribution (and also the multinomial distribution). This means that in a model consisting of a data point having a categorical distribution with unknown parameter vector p, and (in standard Bayesian style) we choose to treat this parameter as a random variable and give it a prior distribution defined using a Dirichlet distribution, then the posterior distribution of the parameter, after incorporating the knowledge gained from the observed data, is also a Dirichlet. Intuitively, in such a case, starting from what we know about the parameter prior to observing the data point, we then can update our knowledge based on the data point and end up with a new distribution of the same form as the old one. This means that we can successively update our knowledge of a parameter by incorporating new observations one at a time, without running into mathematical difficulties.

Formally, this can be expressed as follows. Given a model

\begin{array}{lclcl} \boldsymbol\alpha &=& (\alpha_1, \ldots, \alpha_K) &=& \text{concentration hyperparameter} \\ \mathbf{p}\mid\boldsymbol\alpha &=& (p_1, \ldots, p_K) &\sim& \operatorname{Dir}(K, \boldsymbol\alpha) \\ \mathbb{X}\mid\mathbf{p} &=& (x_1, \ldots, x_K) &\sim& \operatorname{Cat}(K,\mathbf{p}) \end{array}

then the following holds:[1]

\begin{array}{lclcl} \mathbf{c} &=& (c_1, \ldots, c_K) &=& \text{number of occurrences of category }i = \sum_{j=1}^N [x_j=i] \\ \mathbf{p} \mid \mathbb{X},\boldsymbol\alpha &\sim& \operatorname{Dir}(K,\mathbf{c}+\boldsymbol\alpha) &=& \operatorname{Dir}(K,c_1+\alpha_1,\ldots,c_K+\alpha_K) \end{array}

This relationship is used in Bayesian statistics to estimate the underlying parameter p of a categorical distribution given a collection of N samples. Intuitively, we can view the hyperprior vector α as pseudocounts, i.e. as representing the number of observations in each category that we have already seen. Then we simply add in the counts for all the new observations (the vector c) in order to derive the posterior distribution.

Further intuition comes from the expected value of the posterior distribution (see the article on the Dirichlet distribution):

\mathbb{E}[p_i \mid \mathbb{X},\boldsymbol\alpha] = \frac{c_i+\alpha_i}{N+\sum_k\alpha_k}

This says that the expected probability of seeing a category i among the various discrete distributions generated by the posterior distribution is simply equal to the proportion of occurrences of that category actually seen in the data, including the pseudocounts in the prior distribution. This makes a great deal of intuitive sense: If, for example, there are three possible categories, and we saw category 1 in our observed data 40% of the time, we would expect on average to see category 1 40% of the time in the posterior distribution as well.

(Note that this intuition is ignoring the effect of the prior distribution. Furthermore, it's important to keep in mind that the posterior is a distribution over distributions. Remember that the posterior distribution in general tells us what we know about the parameter in question, and in this case the parameter itself is a discrete probability distribution, i.e. the actual categorical distribution that generated our data. For example, if we saw the 3 categories in the ratio 40:5:55 in our observed data, then ignoring the effect of the prior distribution, we would expect the true parameter — i.e. the true, underlying distribution that generated our observed data — to have the average value of (0.40,0.05,0.55), which is indeed what the posterior tells us. However, the true distribution might actually be (0.35,0.07,0.58) or (0.42,0.04,0.54) or various other nearby possibilities. The amount of uncertainty involved here is specified by the variance of the posterior, which is controlled by the total number of observations – the more data we observe, the less our uncertainty about the true parameter.)

(Technically, the prior parameter \alpha_i should actually be seen as representing \alpha_i-1 prior observations of category i. Then, the updated posterior parameter c_i+\alpha_i represents c_i+\alpha_i-1 posterior observations. This reflects the fact that a Dirichlet distribution with \boldsymbol\alpha = (1,1,\ldots) has a completely flat shape — essentially, a uniform distribution over the simplex of possible values of p. Logically, a flat distribution of this sort represents total ignorance, corresponding to no observations of any sort. However, the mathematical updating of the posterior works fine if we ignore the \dots-1 term and simply think of the α vector as directly representing a set of pseudocounts. Furthermore, doing this avoids the issue of interpreting \alpha_i values less than 1.)

MAP Estimation

The maximum-a-posteriori estimate of the parameter p in the above model is simply the mode of the posterior Dirichlet distribution, i.e.,[1]

\arg\max_{\mathbf{p}} p(\mathbf{p} | \mathbb{X}) = \frac{\alpha_i + c_i - 1}{\sum_i (\alpha_i + c_i - 1)}, \qquad \forall i \; \alpha_i + c_i > 1

In many practical applications, the only way to guarantee the condition that \forall i \; \alpha_i + c_i > 1 is to set \alpha_i > 1 for all i.

Marginal likelihood

In the above model, the marginal likelihood of the observations (i.e. the joint distribution of the observations, with the prior parameter marginalized out) is a Dirichlet-multinomial distribution:[1]

\begin{align} p(\mathbb{X}\mid\boldsymbol{\alpha}) &= \int_{\mathbf{p}}p(\mathbb{X}\mid \mathbf{p})p(\mathbf{p}\mid\boldsymbol{\alpha})\textrm{d}\mathbf{p} \\ &= \frac{\Gamma\left(\sum_k \alpha_k\right)} {\Gamma\left(N+\sum_k \alpha_k\right)}\prod_{k=1}^K\frac{\Gamma(c_{k}+\alpha_{k})}{\Gamma(\alpha_{k})} \end{align}

This distribution plays an important role in hierarchical Bayesian models, because when doing inference over such models using methods such as Gibbs sampling or variational Bayes, Dirichlet prior distributions are often marginalized out. See the article on this distribution for more details.

Posterior predictive distribution

The posterior predictive distribution of a new observation in the above model is the distribution that a new observation \tilde{x} would take given the set \mathbb{X} of N categorical observations. As shown in the Dirichlet-multinomial distribution article, it has a very simple form:[1]

\begin{align} p(\tilde{x}=i\mid\mathbb{X},\boldsymbol{\alpha}) &= \int_{\mathbf{p}}p(\tilde{x}=i\mid\mathbf{p})\,p(\mathbf{p}\mid\mathbb{X},\boldsymbol{\alpha})\,\textrm{d}\mathbf{p} \\ &=\, \frac{c_i + \alpha_i}{N+\sum_k \alpha_k} \\ &=\, \mathbb{E}[p_i \mid \mathbb{X},\boldsymbol\alpha] \\ &\propto\, c_i + \alpha_i. \\ \end{align}

Note the various relationships among this formula and the previous ones:

The reason for the equivalence between posterior predictive probability and the expected value of the posterior distribution of p is evident once we re-examine the above formula. As explained in the posterior predictive distribution article, the formula for the posterior predictive probability has the form of an expected value taken with respect to the posterior distribution:

\begin{align} p(\tilde{x}=i\mid\mathbb{X},\boldsymbol{\alpha}) &= \int_{\mathbf{p}}p(\tilde{x}=i\mid\mathbf{p})\,p(\mathbf{p}\mid\mathbb{X},\boldsymbol{\alpha})\,\textrm{d}\mathbf{p} \\ &=\, \mathbb{E}_{\mathbf{p}\mid\mathbb{X},\boldsymbol{\alpha}} \left[p(\tilde{x}=i\mid\mathbf{p})\right] \\ &=\, \mathbb{E}_{\mathbf{p}\mid\mathbb{X},\boldsymbol{\alpha}} \left[p_i\right] \\ &=\, \mathbb{E}[p_i \mid \mathbb{X},\boldsymbol\alpha]. \\ \end{align}

The crucial line above is the third. The second follows directly from the definition of expected value. The third line is particular to the categorical distribution, and follows from the fact that, in the categorical distribution specifically, the expected value of seeing a particular value i is directly specified by the associated parameter pi. The fourth line is simply a rewriting of the third in a different notation, using the notation farther up for an expectation taken with respect to the posterior distribution of the parameters.

Note also what happens in a scenario in which we observe data points one by one and each time consider their predictive probability before observing the data point and updating the posterior. For any given data point, the probability of that point assuming a given category depends on the number of data points already in that category. If a category has a high frequency of occurrence, then new data points are more likely to join that category — further enriching the same category. This type of scenario is often termed a preferential attachment (or "rich get richer") model. This models many real-world processes, and in such cases the choices made by the first few data points have an outsize influence on the rest of the data points.

Posterior conditional distribution

In Gibbs sampling, we typically need to draw from conditional distributions in multi-variable Bayes networks where each variable is conditioned on all the others. In networks that include categorical variables with Dirichlet priors (e.g. mixture models and models including mixture components), the Dirichlet distributions are often "collapsed out" (marginalized out) of the network, which introduces dependencies among the various categorical nodes dependent on a given prior (specifically, their joint distribution is a Dirichlet-multinomial distribution). One of the reasons for doing this is that in such a case, the distribution of one categorical node given the others is exactly the posterior predictive distribution of the remaining nodes.

That is, for a set of nodes \mathbb{X}, if we denote the node in question as x_n and the remainder as \mathbb{X}^{(-n)}, then

\begin{align} p(x_n=i\mid\mathbb{X}^{(-n)},\boldsymbol{\alpha}) &=\, \frac{c_i^{(-n)} + \alpha_i}{N-1+\sum_i \alpha_i} &\propto\, c_i^{(-n)} + \alpha_i \\ \end{align}

where c_i^{(-n)} is the number of nodes having category i among the nodes other than node n.

Sampling

The most common way to sample from a categorical distribution uses a type of inverse transform sampling:

Assume we are given a distribution expressed as "proportional to" some expression, with unknown normalizing constant. Then, before taking any samples, we prepare some values as follows:

  1. Compute the unnormalized value of the distribution for each category.
  2. Sum them up and divide each value by this sum, in order to normalize them.
  3. Impose some sort of order on the categories (e.g. by an index that runs from 1 to k, where k is the number of categories).
  4. Convert the values to a cumulative distribution function (CDF) by replacing each value with the sum of all of the previous values. This can be done in time O(k). The resulting value for the first category will be 0.

Then, each time it is necessary to sample a value:

  1. Pick a uniformly distributed number between 0 and 1.
  2. Locate the greatest number in the CDF whose value is less than or equal to the number just chosen. This can be done in time O(log(k)), by binary search.
  3. Return the category corresponding to this CDF value.

If it is necessary to draw many values from the same categorical distribution, the following approach is more efficient. It draws n samples in O(n) time (assuming an O(1) approximation is used to draw values from the binomial distribution[5]).

function draw_categorical(n) // where n is the number of samples to draw from the categorical distribution
  r = 1
  s = 0
  for i from 1 to k // where k is the number of categories
    v = draw from a binomial(n, p[i] / r) distribution // where p[i] is the probability of category i
    for j from 1 to v
      z[s++] = i // where z is an array in which the results are stored
    n = n - v
    r = r - p[i]
  shuffle (randomly re-order) the elements in z
  return z


Sampling via the Gumbel distribution

In machine learning it is typical to parametrize the categorical distribution, p_1,\ldots,p_k via an unconstrained representation in \mathbb{R}^k, whose components are given by:

\gamma_i = \log p_i + \alpha

where \alpha is any real constant. Given this representation, p_1,\ldots,p_k can be recovered using the softmax function, which can then be sampled using the techniques described above. There is however a more direct sampling method that uses samples from the Gumbel distribution.[6] Let g_1,\ldots,g_k be k independent draws from the standard Gumbel distribution, then

c = \arg \max_i \gamma_i + g_i

will be a sample from the desired categorical distribution. (If u_i is a sample from the standard uniform distribution, then g_i=-\log(-\log u_i) is a sample from the standard Gumbel distribution.)

See also

Related distributions

Notes

  1. ↑ However, Bishop does not explicitly use the term categorical distribution.

References

  1. ↑ 1.0 1.1 1.2 1.3 1.4 1.5 Minka, T. (2003) Bayesian inference, entropy and the multinomial distribution. Technical report Microsoft Research.
  2. ↑ Minka, T. (2003), op. cit. Minka uses the Kronecker delta function, similar to but less general than the Iverson bracket.
  3. ↑ 3.0 3.1 Bishop, C. (2006) Pattern Recognition and Machine Learning, Springer. ISBN 0-387-31073-8
  4. ↑ Johnson, N.L., Kotz, S., Balakrishnan, N. (1997) Discrete Multivariate Distributions, Wiley. ISBN 0-471-12844-9 (p.105)
  5. ↑ Agresti, A., An Introduction to Categorical Data Analysis, Wiley-Interscience, 2007, ISBN 978-0-471-22618-5, pp. 25
  6. ↑ Adams, Ryan. "The Gumbel-Max Trick for Discrete Distributions".