stat340s13
Contents
Computer Simulation of Complex Systems (Stat 340 - Spring 2013)
Introduction, Class 1 - Tuesday, May 7
{{
Template:namespace detect
| type = style | image = | imageright = | style = | textstyle = | text = This article may require cleanup to meet Wikicoursenote's quality standards. The specific problem is: use math environment and LaTex notations for formulas. For example instead of y=1-e^(-λx) write [math]y=1-e^{-\lambda x}[/math]. Please improve this article if you can. | small = | smallimage = | smallimageright = | smalltext = }}
Course Instructor: Ali Ghodsi
Lecture:
001: TTh 8:30-9:50 MC1085
002: TTh 1:00-2:20 DC1351
Tutorial:
2:30-3:20 Mon M3 1006
Midterm
Monday June 17 2013 from 2:30-3:30
TA(s):
TA | Day | Time | Location |
---|---|---|---|
Lu Cheng | Monday | 3:30-5:30 pm | M3 3108, space 2 |
Han ShengSun | Tuesday | 4:00-6:00 pm | M3 3108, space 2 |
Yizhou Fang | Wednesday | 1:00-3:00 pm | M3 3108, space 1 |
Huan Cheng | Thursday | 3:00-5:00 pm | M3 3111, space 1 |
Wu Lin | Friday | 11:00-1:00 pm | M3 3108, space 1 |
Four Fundamental Problems
1. Classification: Given an input object X, we have a function which will take in this input X and identify which 'class (Y)' it belongs to (Discrete Case)
(For example, an image of a fruit can be classified, through some sort of algorithm to be a picture of either an apple or an orange.)
2. Regression: Same as classification but in the continuous case except y is discrete
3. Clustering: Use common features of objects in same class or group to form clusters.(in this case, x is given, y is unknown)
4. Dimensionality Reduction (aka Feature extraction, Manifold learning)
Applications
Most useful when structure of the task is not well understood but can be characterized by a dataset with strong statistical regularity
Examples:
- Computer Vision, Computer Graphics, Finance (fraud detection), Machine Learning
- Search and recommendation (eg. Google, Amazon)
- Automatic speech recognition, speaker verification
- Text parsing
- Face identification
- Tracking objects in video
- Financial prediction(e.g. credit cards)
- Fraud detection
- Medical diagnosis
Course Information
Prerequisite: (One of CS 116, 126/124, 134, 136, 138, 145, SYDE 221/322) and (STAT 230 with a grade of at least 60% or STAT 240) and (STAT 231 or 241)
Antirequisite: CM 361/STAT 341, CS 437, 457
General Information
- No required textbook
- Recommended: "Simulation" by Sheldon M. Ross
- Computing parts of the course will be done in Matlab, but prior knowledge of Matlab is not essential (will have a tutorial on it)
- First midterm will be held on Monday, June 17 from 2:30 to 3:30
- Announcements and assignments will be posted on Learn.
- Other course material on: http://wikicoursenote.com/wiki/
- Log on to both Learn and wikicoursenote frequently.
- Email all questions and concerns to UWStat340@gmail.com. Do not use your personal email address!
Wikicourse note (10% of final mark):
When applying an account in the wikicourse note, please use the quest account as your login name while the uwaterloo email as the registered email. This is important as the quest id will use to identify the students who make the contributions.
Example:
User: questid
Email: questid@uwaterloo.ca
After the student has made the account request, do wait for several hours before students can login into the account using the passwords stated in the email. During the first login, students will be ask to create a new password for their account.
As a technical/editorial contributor: Make contributions within 1 week and do not copy the notes on the blackboard.
Must do both All contributions are now considered general contributions you must contribute to 50% of lectures for full marks
- A general contribution can be correctional (fixing mistakes) or technical (expanding content, adding examples, etc) but at least half of your contributions should be technical for full marks
Do not submit copyrighted work without permission, cite original sources. Each time you make a contribution, check mark the table. Marks are calculated on honour system, although there will be random verifications. If you are caught claiming to contribute but didn't, you will lose marks.
Wikicoursenote contribution form : [1]
- you can submit your contributions in multiple times.
- you will be able to edit the response right after submitting
- send email to make changes to an old response : uwstat340@gmail.com
Tentative Topics
- Random variable and stochastic process generation
- Discrete-Event Systems
- Variance reduction
- Markov Chain Monte Carlo
Tentative Marking Scheme
Item | Value |
---|---|
Assignments (~6) | 30% |
WikiCourseNote | 10% |
Midterm | 20% |
Final | 40% |
The final exam is going to be closed book and only non-programmable calculators are allowed
A passing mark must be achieved in the final to pass the course
Sampling (Generating random numbers), Class 2 - Thursday, May 9
Introduction
Some people believe that sampling activities such as rolling a dice and flipping a coin are not truly random but are deterministic, since the result can be reliably calculated using things such as physics and math. In general, a deterministic model produces specific results given certain inputs by the model user, contrasting with a stochastic model which encapsulates randomness and probabilistic events.
A computer cannot generate truly random numbers because computers can only run algorithms, which are deterministic in nature. They can, however, generate Pseudo Random Numbers; numbers that seem random but are actually deterministic. Although the pseudo random numbers are deterministic, these numbers have a sequence of value and all of them have the appearances of being independent uniform random variables. Being deterministic, pseudo random numbers are valuable and beneficial due to the ease to generate and manipulate.
Mod
Let [math]n \in \N[/math] and [math]m \in \N^+[/math], then by Division Algorithm,
[math]\exists q, \, r \in \N \;\text{with}\; 0\leq r \lt m, \; \text{s.t.}\; n = mq+r[/math],
where [math]q[/math] is called the quotient and [math]r[/math] the remainder. Hence we can define a binary function
[math]\mod : \N \times \N^+ \rightarrow \N [/math] given by [math]r:=n \mod m[/math] which means take the remainder after division by m.
Note: [math]\mod[/math] here is different from the modulo congruence relation in [math]\Z_m[/math], which is an equivalence relation instead of a function.
Multiplicative Congruential Algorithm
This is a simple algorithm used to generate uniform pseudo random numbers. It is also referred to as the Linear Congruential Method or Mixed Congruential Method. We define the Linear Congruential Method to be [math]x_{k+1}=(ax_k + b) \mod m[/math], where [math]x_k, a, b, m \in \N, \;\text{with}\; a, m \gt 0[/math]. ( [math]\mod m[/math] means taking the remainder after division by m) Given a "seed" [math]x_0 \in \N[/math], we can obtain values for [math]x_1, \, x_2, \, \cdots, x_n[/math] inductively. The Multiplicative Congruential Method may also refer to the special case where [math]b=0[/math].
An interesting fact about Linear Congruential Method is that it is one of the oldest and best-known pseudorandom number generator algorithms. It is very fast and requires minimal memory to retain state. However, this method should not be used for applications where high-quality randomness is required. They should not be used for Monte Carlo simulation and cryptographic applications.
First consider the following algorithm
[math]x_{k+1}=x_{k} \mod m[/math]
Example
[math]\text{Let }x_{0}=10,\,m=3[/math]
- [math]\begin{align} x_{1} &{}= 10 mod{3} = 1 \\ x_{2} &{}= 1 mod{3} = 1 \\ x_{3} &{}= 1 mod{3} =1 \\ \end{align}[/math]
[math]\ldots[/math]
Excluding x0, this example generates a series of ones. In general, excluding x0, the algorithm above will always generate a series of the same number less than m. We modify this algorithm to form the Multiplicative Congruential Algorithm.
Multiplicative Congruential Algorithm
[math]x_{k+1}=(a \cdot x_{k} + b) \mod m [/math]
Example
[math]\text{Let }a=2,\, b=1, \, m=3, \, x_{0} = 10[/math]
[math]\begin{align}
\text{Step 1: } 0&{}=(2\cdot 10 + 1) &{}\mod 3 \\
\text{Step 2: } 1&{}=(2\cdot 0 + 1) &{}\mod 3 \\
\text{Step 3: } 0&{}=(2\cdot 1 + 1) &{}\mod 3 \\
\end{align}[/math]
[math]\ldots[/math]
This example generates a sequence with a repeating cycle of two integers.
(If we choose the numbers properly, we could get a sequence of "random" numbers. However, how do we find the value of [math]a,b,[/math] and [math]m[/math]? At the very least [math]m[/math] should be a very large, preferably prime number. The larger [math]m[/math] is, the higher possibility people get a sequence of "random" numbers. This is easier to solve in Matlab. In Matlab, the command rand() generates random numbers which are uniformly distributed in the interval (0,1)). Matlab uses [math]a=7^5, b=0, m=2^31-1[/math](2 to the power of 31 minus 1) – recommended in a 1988 paper, "Random Number Generators: Good Ones Are Hard To Find" by Stephen K. Park and Keith W. Miller (Important part is that [math]m[/math] should be large)
MatLab Instruction for Multiplicative Congruential Algorithm:
Before you start, you need to clear all existing defined variables and operations:
>>clear all >>close all
>>a=17 >>b=3 >>m=31 >>x=5 >>mod(a*x+b,m) ans=26 >>x=mod(a*x+b,m)
(Note:
1. Keep repeating this command over and over again and you will seem to get random numbers – this is how the command rand works in a computer.
2. There is a function called RAND to generate a number between 0 and 1.
3. If we would like to generate 1000 and more numbers, we could use a for loop)
(Note on MATLAB commands:
1. clear all: clears all variables.
2. close all: closes all figures.
3. who: displays all defined variables.
4. clc: clears screen.)
>>a=13 >>b=0 >>m=31 >>x(1)=1 >>for ii=2:1000 x(ii)=mod(a*x(ii-1)+b,m); end >>size(x) ans=1 1000 >>hist(x)
(Note: The semicolon after the x(ii)=mod(a*x(ii-1)+b,m) ensures that Matlab will not show the entire vector of x. It will instead calculate it internally and you will be able to work with it. Adding the semicolon to the end of this line reduces the run time significantly.)
This algorithm involves three integer parameters [math]a, b,[/math] and [math]m[/math] and an initial value, [math]x_0[/math] called the seed. A sequence of numbers is defined by [math]x_{k+1} = ax_k+ b \mod m[/math]. [math]\mod m[/math] means taking the remainder after division by [math]m[/math].
Note: For some bad [math]a[/math] and [math]b[/math], the histogram may not looks uniformly distributed.
Note: hist(x) will generate a graph about the distribution. Use it after run the code to check the real sample distribution.
Example: [math]a=13, b=0, m=31[/math]
The first 30 numbers in the sequence are a permutation of integers from 1 to 30, and then the sequence repeats itself so it is important to choose [math]m[/math] large to decrease the probability of each number repeating itself too early. Values are between [math]0[/math] and [math]m-1[/math]. If the values are normalized by dividing by [math]m-1[/math], then the results are approximately numbers uniformly distributed in the interval [0,1]. There is only a finite number of values (30 possible values in this case). In MATLAB, you can use function "hist(x)" to see if it looks uniformly distributed.
If [math]x_0=1[/math], then
- [math]x_{k+1} = 13x_{k}\mod{31}[/math]
So,
- [math]\begin{align} x_{0} &{}= 1 \\ x_{1} &{}= 13 \times 1 + 0 &{}\mod{31} = 13 \\ x_{2} &{}= 13 \times 13 + 0 &{}\mod{31} = 14 \\ x_{3} &{}= 13 \times 14 + 0 &{}\mod{31} =27 \\ \end{align}[/math]
etc.
For example, with [math]a = 3, b = 2, m = 4, x_0 = 1[/math], we have:
- [math]x_{k+1} = (3x_{k} + 2)\mod{4}[/math]
So,
- [math]\begin{align}
x_{0} &{}= 1 \\
x_{1} &{}= 3 \times 1 + 2 \mod{4} = 1 \\
x_{2} &{}= 3 \times 1 + 2 \mod{4} = 1 \\
\end{align}[/math]
etc.
FAQ:
1.Why in the example above is 1 to 30 not 0 to 30?
b = 0 so in order to have 0 remainder at x_{k}, x_{k-1} must be 0 (since a=13 is not a multiple of 31). However, our seed is 1. Hence, we will never observe 0 in the sequence.
2.Will the number 31 ever appear?Is there a probability that a number never appears?
The number 31 will never appear. When you perform the operation mod m, the highest possible answer that you could receive is m-1. The probability that a particular number in the range from 0 to m - 1 never appears in the above algorithm will be dependent on the values chosen for a, b and m.
Examples:[From Textbook]
If x_{0}=3 and x_{n}=(5x_{n-1}+7)mod 200, find x_{1},...,x_{10}.
Solution:
x_{1}= (15+7) mod 200= 22
x_{2}= 117 mod 200= 117
x_{3}= 592 mod 200 = 192
x_{4}= 2967 mod 200= 167
x_{5}= 14842 mod 200= 42
x_{6}= 74217 mod 200 = 17
x_{7}= 371092 mod 200= 92
x_{8}= 1855467 mod 200= 67
x_{9}= 9277342 mod 200 = 142
x_{10}= 46386717 mod 200 = 117
Comments:
Typically, it is good to choose m such that m is large, and m is prime. Careful selection of parameters 'a' and 'b' also helps generate relatively "random" output values, where it is harder to identify patterns. For example, when we used a non prime number such as 40 for m, our results were not satisfactory in producing an output resembling a uniform distribution.
The computed values are between 0 and m-1. If the values are normalized by dividing by m-1, their result is numbers uniformly distributed on the interval [0,1] (similar to computing from uniform distribution).
From the example shown above, we can see to create a good random number sequence generator, we need to select a large m. As the x_{n} value is dependent on the (5x_{n-1}+7)value, such that the value it can be is between 0 to m after that a value will be repeated; and once this happens the whole sequence will began to repeat. Thus, if we want to create large group of random number, it is better to have large m such that the random value generated will not be repeated after several recursion.
Example:
For x_{n} = (2x_{n-1}+1) mod 3 where x_{0}=2, x_{1} = 5 mod 3 = 2
Notice that, with the small value m, the random number generated repeated itself is faster than when the value is large enough.
There has been a research about how to choose uniform sequence. Many programs give you the chance to choose the seed. Sometimes the first number is chosen by CPU.
Moreover, it is fact that not all variables are uniform. Some has normal distribution, or exponential distribution, or binomial distribution as well.
Inverse Transform Method
This method is useful for generating types of distribution other than uniform distribution, such as exponential distribution and normal distribution. However, to use this method in generating pseudorandom numbers, the probability distribution consumed must be a cdf such that it is continuous for the F^{-1} always exists. Exponential distribution has the property that generated numbers are frequently close to 0. Normal distribution has the property that generated numbers are frequently close to its mean.
Theorem:
If U ~ U[0,1] then the random variable [math] x=F^{-1}(U)[/math]
has the distribution function F(•)
Where [math]F(x) = P(X[/math] ≤ [math]x)[/math] is the CDF and;
[math] F^{-1}(U) [/math]denotes the inverse function of F(•)
Or that [math]F(x)=U[/math] [math]\Rightarrow[/math] [math]x=F^{-1}(U)[/math]
Proof of the theorem:
For all u є [0,1] and for all x є [math] F^{-1}(U) [/math], the generalized inverse satisfies
F([math] F^{-1}(u) [/math]) > u and [math] F^{-1}(F(x)) [/math] < x,
Therefore,
[math]F(x) = P(X[/math] ≤ [math] x)[/math]
[math] = P(F^{-1}(U)[/math] ≤ [math] x)[/math]
[math] = P(F(F^{-1}(U))[/math] ≤ [math] F(x))[/math] ::"Since F in a non-decreasing function on R,the we can add F to both sides"
[math] = P(U[/math] ≤ [math] F(x))[/math]
[math] = F(x) [/math] ::"Because [math]Pr(U [/math] ≤ [math]y)=y[/math],since U is uniform on the unit interval"
Therefore, in order to generate a random variable X~F, it can generate U according to U(0,1) and then make the transformation x=[math] F^{-1}(U) [/math]
Example: [math] f(x) = \lambda e^{-\lambda x}[/math]
[math] F(x)= \int_0^x f(x) dx[/math]
[math] = \int_0^x \lambda e ^{-\lambda x}\ dx[/math]
[math] = \frac{\lambda}{-\lambda}\, e^{-\lambda x}\, | \underset{0}{x} [/math]
[math] = -e^{\lambda x} + e^0 [/math]
[math] =1 - e^{- \lambda x} [/math]
[math] y=1-e^{- \lambda x} [/math]
[math] 1-y=e^{- \lambda x}[/math]
[math]x=-ln(1-y)/{\lambda}[/math]
[math]y=-ln(1-x)/{\lambda}[/math]
[math]F^{-1}(x)=-ln(1-x)/{\lambda}[/math]
Step 1: Draw U ~U[0,1];
Step 2: [math] x=\frac{-ln(1-U)}{\lambda} [/math]
Example:
[math] X= a + (b-a),[/math] U is uniform on [a, b]
[math] x=\frac{-ln(U)}{\lambda}[/math] is exponential with parameter [math] {\lambda} [/math]
Example 2:
Given a CDF of X: [math]F(x) = x^5[/math], transform U~U[0,1].
Sol:
Let [math]y=x^5[/math], solve for x: [math]x=y^{1/5}[/math]. Therefore, [math]F^{-1} (x) = x^{1/5}[/math]
Hence, to obtain a value of x from F(x), we first set u as an uniform distribution, then obtain the inverse function of F(x), and set
[math]x= u^{1/5}[/math]
Example 3:
Given u~U[0,1], generate x from BETA(1,β)
Solution:
F(x)= 1-(1-x)^β
u= 1-(1-x)^β
Solve for x:
(1-x)^β = 1-u
1-x = (1-u)^(1/β)
x = 1-(1-u)^(1/β)
Example 4-Estimating pi:
Let's use rand() and Monte Carlo Method to estimate [math]pi[/math]
N= total number of points
Nc = total number of points inside the circle
Prob[(x,y) lies in the circle]=[math]Area of circle/Area of Square[/math]
If we take square of size 2, circle will have area pi.
Thus pi= [math]4*(Nc/N)[/math]
Matlab Code:
N=10000;Nc=0;a=0,b=2;
for t=1:1000
x=a+(b-a)*rand()
y=a+(b-a)*rand()</math>
if (x-1).^2+(y-1).^2<=1
Nc=Nc+1;
end
end
In Matlab, you can use functions: "who" to see what variables you have defined "clear all" to clear all variables you have defined "close all" to close all figures
MatLab for Inverse Transform Method:
>>u=rand(1,1000) >>hist(u) #will generate a fairly uniform diagram
#let λ=2 in this example; however, you can make another value for λ >>x=(-log(1-u))/2; >>size(x) #1000 in size >>figure >>hist(x) #exponential
Limitations:
1. This method is flawed since not all functions are invertible nor monotonic.
2. It may be impractical since some CDF's and/or integrals are not easy to compute such as Gaussian distribution.
Probability Distribution Function Tool in MATLAB
>>disttool #shows different distributions
This command allows users to explore the effect of changes of parameters on the plot of either a CDF or PDF.
(Generating random numbers continue) Class 3 - Tuesday, May 14
Recall the Inverse Transform Method
1. Draw U~U(0,1)
2. X = F^{-1}(U)
Proof
First note that
[math]P(U\leq a)=a, \forall a\in[0,1][/math]
- [math]P(X\leq x)[/math]
[math]= P(F^{-1}(U)\leq x)[/math]
[math]= P((F(F^{-1}(U))\leq F(x))[/math] (since [math]F(\cdot )[/math] is monotonically increasing)
[math]= P(U\leq F(x)) [/math]
[math]= F(x) [/math]
This is the c.d.f. of X.
Note that the CDF of a U(a,b) random variable is:
- [math] F(x)= \begin{cases} 0 & \text{for }x \lt a \\[8pt] \frac{x-a}{b-a} & \text{for }a \le x \lt b \\[8pt] 1 & \text{for }x \ge b \end{cases} [/math]
Thus, for U~U(0,1), we have [math]P(U\leq 1) = 1[/math] and [math]P(U\leq 1/2) = 1/2[/math].
More generally, we see that [math]P(U\leq a) = a[/math].
For this reason, we had [math]P(U\leq F(x)) = F(x)[/math].
Reminder:
This is only for uniform distribution [math] U~ \sim~ Unif [0,1] [/math]
P(U<=1)=1
P(U<=0.5)=0.5
Discrete Case
We want to generate a discrete random variable x, that has probability mass function: In general in the discrete case, we have [math]x_0, \dots , x_n[/math] where:
- [math]\begin{align}P(X = x_i) &{}= p_i \end{align}[/math]
- [math]x_0 \leq x_1 \leq x_2 \dots \leq x_n[/math]
- [math]\sum p_i = 1[/math]
Algorithm for applying Inverse Transformation Method in Discrete Case:
1: Draw [math] U~ \sim~ Unif [0,1] [/math]
2. [math]X=x_i, [/math] if [math] F(x_{i-1})\lt U\leq F(x_i) [/math]
Example in class:(Coin Flipping Example)
We want to simulate a coin flip. We have U~U(0,1) and X = 0 or X = 1.
We can define the U function so that:
If U <= 0.5, then X = 0
and if 0.5 < U <= 1, then X =1.
This allows the probability of Heads occurring to be 0.5 and is a good generator of a random coin flip.
[math] U~ \sim~ Unif [0,1] [/math]
- [math]\begin{align} P(X = 0) &{}= 0.5\\ P(X = 1) &{}= 0.5\\ \end{align}[/math]
- Notice: For the bounds of X, it does not matter where you place the "=" sign; since U is a continuous random variable, the probability of f(x) equal to a point is zero.
- Code
>>for ii=1:1000 u=rand; if u<0.5 x(ii)=0; else x(ii)=1; end end >>hist(x)
Note: The role of semi-colon in Matlab: Matlab will not print out the results if the line ends in a semi-colon and vice versa.
Example in class:
Suppose we have the following discrete distribution:
- [math]\begin{align} P(X = 0) &{}= 0.3 \\ P(X = 1) &{}= 0.2 \\ P(X = 2) &{}= 0.5 \end{align}[/math]
The cumulative density function (cdf) for this distribution is then:
- [math] F(x) = \begin{cases} 0, & \text{if } x \lt 0 \\ 0.3, & \text{if } x \lt 1 \\ 0.5, & \text{if } x \lt 2 \\ 1, & \text{if } x \gt 2 \end{cases}[/math]
Then we can generate numbers from this distribution like this, given [math]U \sim~ Unif[0, 1][/math]:
- [math] x = \begin{cases} 0, & \text{if } U\leq 0.3 \\ 1, & \text{if } 0.3 \lt U \leq 0.5 \\ 2, & \text{if } 0.5 \lt U\leq 1 \end{cases}[/math]
- Code
Matlab code in class
Use Editor window to edit the code
>>close all >>clear all >>for ii=1:1000 u=rand; if u<0.3 x(ii)=0; elseif u<0.5 x(ii)=1; else x(ii)=2; end end >>size(x) >>hist(x)
Example: Generating a Bernoulli random variable
- [math]\begin{align} P(X = 1) = p, P(X = 0) = 1 - p\end{align}[/math]
- [math] F(x) = \begin{cases} 1-p, & \text{if } x \lt 1 \\ 1, & \text{if } 1 \leq x \end{cases}[/math]
1. Draw [math] U~ \sim~ Unif [0,1] [/math]
2. [math]
X = \begin{cases}
1, & \text{if } U\leq p \\
0, & \text{if } U \gt p
\end{cases}[/math]
Example: Generating Geometric Distribution:
Consider Geo(p) where p is the probability of success, and define random variable X such that X is the number of failure before the first success. x=1,2,3..... We have pmf: P(X=xi) = (1-p)^{xi-1} *p We have CDF: F(x) = P(X<=x) = 1-p(X>x) = 1 - (1-p)^{x}, p(X>x) means we get at least x failures before observe the first success. Now consider the inverse transform:
- [math] x = \begin{cases} 1, & \text{if } U\leq p \\ 2, & \text{if } p \lt U \leq 1-(1-p)^2 \\ 3, & \text{if } 1-(1-p)^2 \lt U\leq 1-(1-p)^3 \\ .... k, & \text{if } 1-(1-p)^(k-1) \lt U\leq 1-(1-p)^k .... \end{cases}[/math]
Note: Unlike the continuous case, the discrete inverse-transform method can always be used for any discrete distribution (but it may not be the most efficient approach)
General Procedure
1. Draw U ~ U(0,1)
2. If [math]U \leq P_{0}[/math] deliver [math]x = x_{0}[/math]
3. Else if [math]U \leq P_{0} + P_{1}[/math] deliver [math]x = x_{1}[/math]
4. Else if [math]U \leq P_{0} + P_{1} + P_{2} [/math] deliver [math]x = x_{2}[/math]
...
Else if [math]U \leq P_{0} + ... + P_{k} [/math] deliver [math]x = x_{k}[/math]
The problem with the inverse transformation method is that we have to find [math]F^{-1}[/math] while not all functions have an inverse. Unfortunately, with many distributions such as the Gaussian(also known as Normal distribution, the only difference is Gaussian is represented by standard deviation while normal is represented by variance) , it is too difficult to find the inverse of [math]F(x)[/math]. In this case, another alternative is to use the acceptance-rejection method that follows.
Acceptance-Rejection Method
Although the inverse transformation method does allow us to change our uniform distribution, it has two limits;
- Not all functions have inverse functions (ie, the range of x and y have limit and do not fix the inverse functions)
- For some distributions, such as Gaussian, it is too difficult to find the inverse
To generate random samples for these functions, we will use different methods, such as the Acceptance-Rejection Method.
Suppose we want to draw random sample from a target density function f(x), x∈S_{x}, where S_{x} is the support of f(x). If we can find some constant c(≥1) and a density function g(x) having the same support S_{x} so that f(x)≤cg(x), ∀x∈S_{x}, then we can apply the procedure for Acceptance-Rejection Method. Typically we choose a density function that we already know how to sample from for g(x).
Note: If the red line was only g(x) as opposed to c*g(x) (i.e. c=1), then g(x)>= f(x) for all values of x iff g and f are the same functions. This because both g(x) and f(x) are pdfs, so the area under each function is equal to 1.
Also remember that c*g(x) always generates higher probability than what we need. Thus we need an approach of getting the proper probabilities.
c must be chosen so that [math]f(x)\eqslantless c*g(x)[/math] for all value of x. c can only equal 1 when f and g have the same distribution. Otherwise:
Either use a software package to test if [math]f(x)\eqslantless c*g(x)[/math] for an arbitrarily chosen c > 0, or:
1. Find first and second derivatives of f(x) and g(x).
2. Identify and classify all local and absolute maximums and minimums, using the First and Second Derivative Tests, as well as all inflection points.
3. Verify that [math]f(x)\eqslantless c*g(x)[/math] at all the local maximums as well as the absolute maximums.
4. Verify that [math]f(x)\eqslantless c*g(x)[/math] at the tail ends by calculating [math]\lim_{x \to +\infty} \frac{f(x)}{c*g(x)}[/math] and [math]\lim_{x \to -\infty} \frac{f(x)}{c*g(x)}[/math] and seeing that they are both < 1. Use of L'Hopital's Rule should make this easy, since both f and g are p.d.f's, resulting in both of them approaching 0.
c should be close to 1, otherwise there is a high chance we will end up rejecting our sample.
- value around x_{1} will be sampled more often under cg(x) than under f(x).<=More samples than we actually need, if [math]\frac{f(y)}{c*g(y)}[/math] is small, the acceptance-rejection technique will need to be done to these points to get the accurate amount.In the region above x_{1}, we should accept less and reject more.
- around x_{2}:number of sample that are drawn and the number we need are much closer. So in the region above x_{2}, we accept more. As a result, g(x) and f(x) are comparable.
Procedure
- Draw Y~g(.)
- Draw U~u(0,1) (Note: U and Y are independent)
- If [math]u\leq \frac{f(y)}{cg(y)}[/math] (which is [math]P(accepted|y)[/math]) then x=y, else return to Step 1
Note: Recall [math]P(U\leq a)=a[/math]. Thus by comparing u and [math]\frac{f(y)}{c*g(y)}[/math], we can get a probability of accepting y at these points. For instance, at some points that cg(x) is much larger than f(x), the probability of accepting x=y is quite small.
ie. At X_{1}, low probability to accept the point since f(x) much smaller than cg(x).
At X_{2}, high probability to accept the point. [math]P(U\leq a)=a[/math] in Uniform Distribution.
Note: Since U is the variable for uniform distribution between 0 and 1. It equals to 1 for all. The condition depends on the constant c. so the condition changes to [math]c\leq \frac{f(y)}{g(y)}[/math]
Proof
We want to show that P(x)(which is original distribution) can be obtained/sampled using a known distribution g(y).
Therefore, mathematically we want to show that:
[math]P(x) = P(y|accepted) = f(y)[/math]
[math]P(y|accepted)=f(y)[/math]
[math]P(y|accepted)=\frac{P(accepted|y)P(y)}{P(accepted)}[/math]
Recall the conditional probability formulas:
[math]P(a|b)=\frac{P(a,b)}{P(b)}[/math], or [math]P(a|b)=\frac{P(b|a)P(a)}{P(b)}[/math]
based on the concept from procedure-step1:
[math]P(y)=g(y)[/math]
[math]P(accepted|y)=\frac{f(y)}{cg(y)}[/math]
(the higher the value is the larger the chance it will be selected)
[math]
\begin{align}
P(accepted)&=\int_y\ P(accepted|y)P(y)\\
&=\int_y\ \frac{f(s)}{cg(s)}g(s)ds\\
&=\frac{1}{c} \int_y\ f(s) ds\\
&=\frac{1}{c}
\end{align}[/math]
Therefore:
[math]\begin{align}
P(x)&=P(y|accepted)\\
&=\frac{\frac{f(y)}{cg(y)}g(y)}{1/c}\\
&=\frac{\frac{f(y)}{c}}{1/c}\\
&=f(y)\end{align}[/math]
Here is an alternative introduction of Acceptance-Rejection Method
Comments:
-Acceptance-Rejection Method is not good for all cases. One obvious cons is that it could be very hard to pick the g(y) and the constant c in some cases. And usually, c should be a small number otherwise the amount of work when applying the method could be HUGE.
-Note: When f(y) is very different than g(y), it is less likely that the point will be accepted as the ratio above would be very small and it will be difficult for u to be less than this small value.
Acceptance-Rejection Method
Example 1 (discrete case)
We wish to generate X~Bi(2,0.5), assuming that we cannot generate this directly.
We use a discrete distribution DU[0,2] to approximate this.
f(x)=Pr(X=x)=2Cx*(0.5)^2
x | 0 | 1 | 2 |
f(x) | 1/4 | 1/2 | 1/4 |
g(x) | 1/3 | 1/3 | 1/3 |
c=f(x)/g(x) | 3/4 | 3/2 | 3/4 |
f(x)/(c*g(x)) | 1/2 | 1 | 1/2 |
Since we need c>=f(x)/g(x)
We need c=3/2
Therefore, the algorithm is:
1. Generate u,v~U(0,1)
2. Set y=floor(3*u) (This is using uniform distribution to generate DU[0,2]
3. If (y=0) and (v<1/2), output=0
If (y=2) and (v<1/2), output=2
Else if y=1, output=1
An elaboration of “c”
c is the expected number of times the code runs to output 1 random variable. Remember that when u < f(x)/(c*g(x)) is not satisfied, we need to go over the code again.
Proof
Let f(x) be the function we wish to generate from, but we cannot use inverse transform method to generate directly.
Let g(x) be the helper function
Let kg(x)>=f(x)
Since we need to generate y from g(x),
Pr(select y)=g(y)
Pr(output y|selected y)=Pr(u<f(y)/(c*g(y)))= (y)/(c*g(y)) (Since u~Unif(0,1))
Pr(output y)=Pr(output y1|selected y1)Pr(select y1)+ Pr(output y2|selected y2)Pr(select y2)+…+ Pr(output yn|selected yn)Pr(select yn)=1/c
Consider that we are asking for expected time for the first success, it is a geometric distribution with probability of success=c
Therefore, E(X)=1/(1/c))=c
Acknowledgements: Some materials have been borrowed from notes from Stat340 in Winter 2013.
Example of Acceptance-Rejection Method
Generating a random variable having p.d.f.
[math]f(x) = 20x(1 - x)^3, 0\lt x \lt 1 [/math]
Since this random variable (which is beta with parameters 2, 4) is concentrated in the interval (0, 1), let us consider the acceptance-rejection method with
g(x) = 1, 0 < x < 1
To determine the constant c such that f(x)/g(x) <= c, we use calculus to determine the maximum value of
f(x)/g(x) = 20x(1 - x)^3
Differentiation of this quantity yields
[math]d/dx[f(x)/g(x)]=20*[(1-x)^3-3x(1-x)^2][/math]
Setting this equal to 0 shows that the maximal value is attained when x = 1/4, and thus,
[math]f(x)/g(x)\lt = 20*(1/4)*(3/4)^3=135/64=c [/math]
Hence,
[math]f(x)/c*g(x)=(256/27)*(x*(1-x)^3)[/math]
and thus the simulation procedure is as follows:
1) Generate two random numbers U1 and U2 .
2) If U_{2}<(256/27)*U_{1}*(1-U_{1})^{3}, set X=U_{2}, and stop Otherwise return to step 1). The average number of times that step 1) will be performed is c = 135/64.
(The above example is from http://www.cs.bgu.ac.il/~mps042/acceptance.htm, example 2.)
Class 4 - Thursday, May 16
Chance of acceptance is less if the distance between [math]f(x)[/math] and [math] c \cdot g(x)[/math] is big, and vice-versa, [math] c [/math] keeps [math] \frac {f(x)}{c \cdot g(x)} [/math] , so we have to choose the constant [math] C [/math] to achieve this. [math] c= \max \left(\frac{f(x)}{g(x)}\right) [/math] For this method to be efficient, the constant c must be selected so that the rejection rate is low. It is easy to show that the expected number of trials for an acceptance is c. Thus the smaller c is, the lower the rejection rate, better the algorithm.
Procedure:
1. Choose [math]g(x)[/math] (simple density function, i.e,:Normal, Uniform)
2. Find a constant c such that :[math] c \cdot g(x) \geq f(x) [/math]
How to find c:
- Let [math]Y \sim~ g(y)[/math]
- Let [math]U \sim~ Unif [0,1] [/math]
- If [math]U \leq \frac{f(x)}{c \cdot g(x)}[/math] then X=Y; else go to 1
Example:generate a random variable from the pdf
f(x)=2x for 0<=x<=1
f(x)=0 ow
this is in fact beta(2,1)
[math]beta(a,b)=\frac{T(a+b)}{(T(a)T(b))}x^{(a-1)}(1-x)^{(b-1)}[/math]
Where T(n)=(n-1)! if n is positive integer
[math]beta(2,1)= \frac{T(3)}{(T(2)T(1))}x(1-x) = 2x[/math]
[math]g=u(0,1)[/math]
[math]y~g[/math]
[math]f(x)\lt =(c(g(x))[/math]
[math]c\gt =f(x)/g(x)[/math]
[math]c=max f(x)/g(x)[/math]
[math]max (2x/1), 0\lt =x\lt =1[/math]
c=2
Note that c can't be negative in general.
Step
- Draw y~u(0,1)
- Draw u~u(0,1)
- if u<= (2*y)/(2*1), x=y
else go to 1
Matlab Code
close all clear all ii=1 jj=0 while ii<1000 y=rand u=rand if u<=Y x(ii)=y ii=ii+1 end end
the reason of not using for loop is that we need continue the looping until we get 1000 successful samples. we will reject some samples during the process.
Matlab Code
U=rand(1,1000) x=U.^.5
Example of Acceptance-Rejection Method
[math]f(x)=3x^2, 0\lt x\lt 1; [/math] [math]g(x)=1, 0\lt x\lt 1[/math]
[math]c = max(f(x)/g(x)) = max(3x^2/1) = 3; [/math] [math]f(x)/(cg(x)) = x^2[/math]
1. Generate two uniform numbers u1 and u2 2. If u2<=(u1)^2, accept u1 as the random variable from f, if not return to Step 1
We can also use g(x)=2x for a more efficient algorithm
[math]c = max(f(x)/g(x)) = max(3x^2/2x) = 3/2; [/math] Use the inverse method to sample from g(x) [math]G(x)=x^2[/math] Generate U from U(0,1) and set [math]x=sqrt(u)[/math]
1. Generate two uniform numbers u1 and u2 2. If [math]u2\lt =3sqrt(u1)/2[/math], accept u1 as the random variable from f, if not return to Step 1