In statistics, additive smoothing, also called Laplace smoothing[1] or Lidstone smoothing, is a technique used to smooth count data, eliminating issues caused by certain values having 0 occurrences. Given a set of observation counts
x=\langlex1,x2,\ldots,xd\rangle
d
N
\hat\thetai=
| xi+\alpha | |
| N+\alphad |
(i=1,\ldots,d),
where the smoothed count
\hatxi=N\hat\thetai
xi/N
1/d.
From a Bayesian point of view, this corresponds to the expected value of the posterior distribution, using a symmetric Dirichlet distribution with parameter α as a prior distribution. In the special case where the number of categories is 2, this is equivalent to using a beta distribution as the conjugate prior for the parameters of the binomial distribution.
Laplace came up with this smoothing technique when he tried to estimate the chance that the sun will rise tomorrow. His rationale was that even given a large sample of days with the rising sun, we still can not be completely sure that the sun will still rise tomorrow (known as the sunrise problem).[4]
A pseudocount is an amount (not generally an integer, despite its name) added to the number of observed cases in order to change the expected probability in a model of those data, when not known to be zero. It is so named because, roughly speaking, a pseudo-count of value
\alpha
\alpha
i
xi
N
i
pi,empirical=
| xi | |
| N |
,
but the posterior probability when additively smoothed is
pi,\alpha-smoothed=
| xi+\alpha | |
| N+\alphad |
,
as if to increase each count
xi
\alpha
Depending on the prior knowledge, which is sometimes a subjective value, a pseudocount may have any non-negative finite value. It may only be zero (or the possibility ignored) if impossible by definition, such as the possibility of a decimal digit of being a letter, or a physical possibility that would be rejected and so not counted, such as a computer printing a letter when a valid program for is run, or excluded and not counted because of no interest, such as if only interested in the zeros and ones. Generally, there is also a possibility that no value may be computable or observable in a finite time (see the halting problem). But at least one possibility must have a non-zero pseudocount, otherwise no prediction could be computed before the first observation. The relative values of pseudocounts represent the relative prior expected probabilities of their possibilities. The sum of the pseudocounts, which may be very large, represents the estimated weight of the prior knowledge compared with all the actual observations (one for each) when determining the expected probability.
In any observed data set or sample there is the possibility, especially with low-probability events and with small data sets, of a possible event not occurring. Its observed frequency is therefore zero, apparently implying a probability of zero. This oversimplification is inaccurate and often unhelpful, particularly in probability-based machine learning techniques such as artificial neural networks and hidden Markov models. By artificially adjusting the probability of rare (but not impossible) events so those probabilities are not exactly zero, zero-frequency problems are avoided. Also see Cromwell's rule.
The simplest approach is to add one to each observed number of events, including the zero-count possibilities. This is sometimes called Laplace's rule of succession. This approach is equivalent to assuming a uniform prior distribution over the probabilities for each possible event (spanning the simplex where each probability is between 0 and 1, and they all sum to 1).
Using the Jeffreys prior approach, a pseudocount of one half should be added to each possible outcome.
Pseudocounts should be set to one only when there is no prior knowledge at all see the principle of indifference. However, given appropriate prior knowledge, the sum should be adjusted in proportion to the expectation that the prior probabilities should be considered correct, despite evidence to the contrary see further analysis. Higher values are appropriate inasmuch as there is prior knowledge of the true values (for a mint-condition coin, say); lower values inasmuch as there is prior knowledge that there is probable bias, but of unknown degree (for a bent coin, say).
A more complex approach is to estimate the probability of the events from other factors and adjust accordingly.
One way to motivate pseudocounts, particularly for binomial data, is via a formula for the midpoint of an interval estimate, particularly a binomial proportion confidence interval. The best-known is due to Edwin Bidwell Wilson, in : the midpoint of the Wilson score interval corresponding to standard deviations on either side is
| nS+z | |
| n+2z |
.
z=2
| nS+2 | |
| n+4 |
.
Often the bias of an unknown trial population is tested against a control population with known parameters (incidence rates)
\boldsymbol\mu=\langle\mu1,\mu2,\ldots,\mud\rangle.
1/d
\mui
\hat\thetai=
| xi+\mui\alphad | |
| N+\alphad |
(i=1,\ldots,d).
As a consistency check, if the empirical estimator happens to equal the incidence rate, i.e.
\mui=xi/N,
\alpha
Additive smoothing is commonly a component of naive Bayes classifiers.
In a bag of words model of natural language processing and information retrieval, the data consists of the number of occurrences of each word in a document. Additive smoothing allows the assignment of non-zero probabilities to words which do not occur in the sample. Recent studies have proven that additive smoothing is more effective than other probability smoothing methods in several retrieval tasks such as language-model-based pseudo-relevance feedback and recommender systems.[5] [6]