In probability theory and statistics, a collection of random variables is independent and identically distributed if each random variable has the same probability distribution as the others and all are mutually independent. This property is usually abbreviated as i.i.d., iid, or IID. IID was first defined in statistics and finds application in different fields such as data mining and signal processing.
Statistics commonly deals with random samples. A random sample can be thought of as a set of objects that are chosen randomly. More formally, it is "a sequence of independent, identically distributed (IID) random data points".
In other words, the terms random sample and IID are basically one and the same. In statistics, "random sample" is the typical terminology, but in probability it is more common to say "IID".
- Identically distributed means that there are no overall trends–the distribution doesn't fluctuate and all items in the sample are taken from the same probability distribution.
- Independent means that the sample items are all independent events. In other words, they are not connected to each other in any way; knowledge of the value of one variable gives no information about the value of the other and vice versa.
It is not necessary for IID variables to be uniformly distributed. Being IID merely requires that they all have the same distribution as each other, and are chosen independently from that distribution, regardless of how uniform or non-uniform their distribution may be.
Independent and identically distributed random variables are often used as an assumption, which tends to simplify the underlying mathematics. In practical applications of statistical modeling, however, the assumption may or may not be realistic.
The i.i.d. assumption is also used in the central limit theorem, which states that the probability distribution of the sum (or average) of i.i.d. variables with finite variance approaches a normal distribution.
Often the i.i.d. assumption arises in the context of sequences of random variables. Then "independent and identically distributed" implies that an element in the sequence is independent of the random variables that came before it. In this way, an i.i.d. sequence is different from a Markov sequence, where the probability distribution for the nth random variable is a function of the previous random variable in the sequence (for a first order Markov sequence). An i.i.d. sequence does not imply the probabilities for all elements of the sample space or event space must be the same. For example, repeated throws of loaded dice will produce a sequence that is i.i.d., despite the outcomes being biased.
i.d. – The signal level must be balanced on the time axis.
Definition for two random variables
Suppose that the random variables and are defined to assume values in . Let and be the cumulative distribution functions of and , respectively, and denote their joint cumulative distribution function by .
Two random variables and are independent if and only if . (See further Independence (probability theory) § Two random variables.)
Two random variables and are i.i.d. if they are independent and identically distributed, i.e. if and only if
Definition for more than two random variables
The definition extends naturally to more than two random variables. We say that random variables are i.i.d. if they are independent (see further Independence (probability theory) § More than two random variables) and identically distributed, i.e. if and only if
where denotes the joint cumulative distribution function of .
Definition for independence
In probability theory, two events, and , are called independent if and only if . In the following, is short for .
Suppose there are two events of the experiment, and . If , there is a possibility . Generally, the occurrence of has an effect on the probability of , which is called conditional probability, and only when the occurrence of has no effect on the occurrence of , there is .
Note: If and , then and are mutually independent which cannot be established with mutually incompatible at the same time; that is, independence must be compatible and mutual exclusion must be related.
Suppose , , and are three events. If , , , and are satisfied, then the events , , and are mutually independent.
A more general definition is there are events, . If the probabilities of the product events for any events are equal to the product of the probabilities of each event, then the events are independent of each other.
A sequence of outcomes of spins of a fair or unfair roulette wheel is i.i.d. One implication of this is that if the roulette ball lands on "red", for example, 20 times in a row, the next spin is no more or less likely to be "black" than on any other spin (see the gambler's fallacy).
Toss a coin 10 times and record how many times the coin lands on heads.
- Independent – Each outcome of landing will not affect the other outcome, which means the 10 results are independent from each other.
- Identically distributed – Regardless of whether the coin is fair (probability 1/2 of heads) or unfair, as long as the same coin is used for each flip, each flip will have the same probability as each other flip.
Such a sequence of two possible i.i.d. outcomes is also called a Bernoulli process.
Roll a die 10 times and record how many times the result is 1.
- Independent – Each outcome of the die roll will not affect the next one, which means the 10 results are independent from each other.
- Identically distributed – Regardless of whether the die is fair or weighted, each roll will have the same probability as each other roll. In contrast, rolling 10 different dice, some of which are weighted and some of which are not, would not produce i.i.d. variables.
Choose a card from a standard deck of cards containing 52 cards, then place the card back in the deck. Repeat it 52 times. Record the number of kings that appear.
- Independent – Each outcome of the card will not affect the next one, which means the 52 results are independent from each other. In contrast, if each card that is drawn is kept out of the deck, subsequent draws would be affected by it (drawing one king would make drawing a second king less likely), and the result would not be independent.
- Identically distributed – After drawing one card from it, each time the probability for a king is 4/52, which means the probability is identical each time.
Many results that were first proven under the assumption that the random variables are i.i.d. have been shown to be true even under a weaker distributional assumption.
Exchangeable random variables
The most general notion which shares the main properties of i.i.d. variables are exchangeable random variables, introduced by Bruno de Finetti. Exchangeability means that while variables may not be independent, future ones behave like past ones – formally, any value of a finite sequence is as likely as any permutation of those values – the joint probability distribution is invariant under the symmetric group.
This provides a useful generalization – for example, sampling without replacement is not independent, but is exchangeable.
In stochastic calculus, i.i.d. variables are thought of as a discrete time Lévy process: each variable gives how much one changes from one time to another. For example, a sequence of Bernoulli trials is interpreted as the Bernoulli process. One may generalize this to include continuous time Lévy processes, and many Lévy processes can be seen as limits of i.i.d. variables—for instance, the Wiener process is the limit of the Bernoulli process.
In machine learning
Machine learning uses currently acquired massive quantities of data to deliver faster, more accurate results. Therefore, we need to use historical data with overall representativeness. If the data obtained is not representative of the overall situation, then the rules will be summarized badly or wrongly.
Through i.i.d. hypothesis, the number of individual cases in the training sample can be greatly reduced.
This assumption makes maximization very easy to calculate mathematically. Observing the assumption of independent and identical distribution in mathematics simplifies the calculation of the likelihood function in optimization problems. Because of the assumption of independence, the likelihood function can be written like this
In order to maximize the probability of the observed event, take the log function and maximize the parameter θ. That is to say, to compute:
The computer is very efficient to calculate multiple additions, but it is not efficient to calculate the multiplication. This simplification is the core reason for the increase in computational efficiency. And this Log transformation is also in the process of maximizing, turning many exponential functions into linear functions.
For two reasons, this hypothesis is easy to use the central limit theorem in practical applications.
- Even if the sample comes from a more complex non-Gaussian distribution, it can also approximate well. Because it can be simplified from the central limit theorem to Gaussian distribution. For a large number of observable samples, "the sum of many random variables will have an approximately normal distribution".
- The second reason is that the accuracy of the model depends on the simplicity and representative power of the model unit, as well as the data quality. Because the simplicity of the unit makes it easy to interpret and scale, and the representative power + scale out of the unit improves the model accuracy. Like in a deep neural network, each neuron is very simple but has strong representative power, layer by layer to represent more complex features to improve model accuracy.
- Clauset, Aaron (2011). "A brief primer on probability distributions" (PDF). Santa Fe Institute. Archived from the original (PDF) on 2012-01-20. Retrieved 2011-11-29.
- Stephanie (2016-05-11). "IID Statistics: Independent and Identically Distributed Definition and Examples". Statistics How To. Retrieved 2021-12-09.
- Hampel, Frank (1998), "Is statistics too difficult?", Canadian Journal of Statistics, 26 (3): 497–513, doi:10.2307/3315772, hdl:20.500.11850/145503, JSTOR 3315772, S2CID 53117661 (§8).
- Blum, J. R.; Chernoff, H.; Rosenblatt, M.; Teicher, H. (1958). "Central Limit Theorems for Interchangeable Processes". Canadian Journal of Mathematics. 10: 222–229. doi:10.4153/CJM-1958-026-0. S2CID 124843240.
- Cover, T. M.; Thomas, J. A. (2006). Elements Of Information Theory. Wiley-Interscience. pp. 57–58. ISBN 978-0-471-24195-9.
- Casella & Berger 2002, Theorem 1.5.10
- "What is Machine Learning? A Definition". Expert.ai. 2020-05-05. Retrieved 2021-12-16.