1 / 42

The Monte Carlo method

The Monte Carlo method. (1,1). (-1,1). (0,0). 1. (-1,-1). (1,-1). 1 If X 2 +Y 2 1 0 o/w. Z=. (X,Y) is a point chosen uniformly at random in a 2 2 square centered at the origin (0,0). P(Z=1)=/4.

pier
Download Presentation

The Monte Carlo method

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript


  1. The Monte Carlo method

  2. (1,1) (-1,1) (0,0) 1 (-1,-1) (1,-1) 1 If X2+Y21 0 o/w Z= • (X,Y) is a point chosen uniformly at random • in a 22 square centered at the origin (0,0). • P(Z=1)=/4.

  3. Assume we run this experiment m times, with Zi being the value of Z at the ith run. • If W=iZi, then •  W’=4W/m is an estimate of .

  4. By Chernoff bound, • Def: A randomized algorithm gives an (,)-approximation for the value V if the output X of the algorithm satisfies Pr[|X-V|V]  1-.

  5. The above method for estimating  gives an (,)-approximation, as long as <1 and m large enough.

  6. Thm1: Let X1,…,Xm be independent and identically distributed indicator random variables, with =E[Xi]. If m  (3ln(2/))/2, then • I.e. m samples provide an (,)-approximation for . • Pf: Exercise!

  7. Def: FPRAS: fully polynomial randomized approximation scheme. • A FPRAS for a problem is a randomized algorithm for which, given an input x and any parameters  and  with 0<,<1, the algorithm outputs an (,)-approximation to V(x) in time poly(1/,ln-1,|x|).

  8. (x1x2x3)(x2x4)(x1x3x4) • Def: DNF counting problem: counting the number of satisfying assignments of a Boolean formula in disjunctive normal form (DNF). • Def: a DNF formula is a disjunction of clauses C1C2… Ct, where each clause is a conjunction of literals. • Eg.

  9. Counting the number of satisfying assignments of a DNF formula is actually #P-complete. • Counting the number of Hamiltonian cycles in a graph and counting the number of perfect matching in a bipartite graph are examples of #P-complete problems.

  10. 1. X0. 2. For k=1 to m, do: (a) Generate a random assignment for the n variables, chosen uniformly at random. (b) If the random assignment satisfies F, then X X+1. 3. Return Y  (X/m)2n. The number of satisfying Assigments of F. • A naïve algorithm for DNF counting problem: Input: A DNF formula F with n variables. Output: Y = an approximation of c(F)

  11. If the k-th iteration in the algorithm • generated a satisfying assignment; • 0 o/w. Xk= Analysis • Pr[Xk=1]=c(F)/2n. • Let X= and then E[X]=mc(F)/2n.

  12. Analysis • By Theorem 1, X/m gives an (,)-approximation of c(F)/2n, and hence Y gives an (,)-approximation of c(F), when m  32nln(2/))/2c(F). • If c(F)  2n/poly(n), then this is not too bad, m is a poly. • But, if c(F)=poly(n), then m=O(2n/c(F))!

  13. Analysis • Note that if Cihasliliterals then there are exactly 2n-li satisfying assignments for Ci. • Let SCi denote the set of assignments that satisfy clause i. • U={(i,a): 1it and aSCi}. • |U|= • Want to estimate • Define S={(i,a): 1it and aSCi, aSCj for j<i}.

  14. DNF counting algorithm II: • Input: A DNF formula F with n variables. • Output: Y: an approximation of c(F). • X0. • For k=1 to m do: (a) With probability choose, uniformly at random an assignment aSCi. (b) If a is not in any SCj, j<i, then XX+1. • Return Y

  15. DNF counting algorithm II: • Note that |U|t|S|. Why? • Let Pr[i is chosen]= • Then Pr[(i,a) is chosen] =Pr[i is chosen]Pr[a is chosen|i is chosen] =

  16. poly(t,1/,ln(1/)) DNF counting algorithm II: • Thm: DNF counting algorithm II is an FPRAS for DNF counting problem when m=(3t/2)ln(2/). • Pf: Step 2(a) chooses an element of U uniformly at random. • The probability that this element belongs to S is at least 1/t. • Fix any ,>0, and let m= (3t/2)ln(2/).

  17. DNF counting algorithm II: • The processing time of each sample is poly(t). • By Thm1, with m samples, X/m gives an (,)-approximation of c(F)/|U| and hence Y gives an (,)-approximation of c(F).

  18. Counting with Approximate Sampling • Def: w: the output of a sampling algorithm for a finite sample space . • The sampling algorithm generates an -uniform sample of  if, for any subset S of , |Pr[wS]-|S|/|||.

  19. Def: A sampling algorithm is a fully polynomial almost uniform sampler (FPAUS) for a problem if, given an input x and >0, it generates an -uniform sample of (x) in time poly(|x|,ln(1/)). • Consider an FPAUS for independent sets would take as input a graph G=(V,E) and a parameter . • The sample space: the set of all independent sets in G.

  20. Goal: Given an FPAUS for independent sets, we construct an FPRAS for counting the number of independent sets. • Assume G has m edges, and let e1,…,em be an arbitrary ordering of the edges. • Ei: the set of the first i edges in E and let Gi=(V,Ei). • (Gi): denote the set of independent sets in Gi.

  21. |(G0)|=2n. Why? • To estimate |(G)|, we need good estimates for

  22. Let be estimate for ri, then • To evaluate the error, we need to bound the ratio • To have an (,)-approximation, we want Pr[|R-1|]1-.

  23. Lemma: Suppose that for all i, 1im, is an (/2m,/m)-approximation for ri. Then Pr[|R-1|]1-. • Pf: • For each 1im, we have

  24.    • Equivalently, 

  25. Estimating ri: • Input: Graph Gi-1=(V,Ei-1) and Gi=(V,Ei) • Output: = an approximation of ri. • X0 • Repeat for M=(1296m2/2)ln(2m/) independent trials: (a) Generate an (/6m)-uniform sample from (Gi-1). (b) If the sample is an independent set in Gi, then XX+1. • Return X/M.

  26. Lemma: When m1 and 0<1, the procedure for estimating ri yields an (/2m,/m)-approximation for ri. • Pf: • Suppose Gi-1 and Gi differ in that edge {u,v} is in Gi but not in Gi-1. • (Gi)  (Gi-1). • An independent set in (Gi-1)\(Gi) contains both u and v.

  27. Associate each I(Gi-1)\(Gi) with an independent set I\{v}(Gi). • Note that I’(Gi) is associated with no more than one independent set I’{v}(Gi-1)\(Gi), thus |(Gi-1)\(Gi)|  |(Gi)|. • It follows that

  28. • Let Xk=1 if the k-th sample is in (Gi) and 0 o/w. • Because our samples are generated by an (/6m)-uniform sampler, by definition,

  29.  Since ri1/2, we have • By linearity of expectations,

  30. -----(1) • If M3ln(2m/)/(/12m)2(1/3)=1296m2-2ln(2m/), then • Equivalently, with probability 1- /m,

  31. -----(2) • As we have • Using, ri1/2, then

  32. Combining (1) and (2), with probability 1-/m, • This gives the desired (/2m,/m)-approximation. • Thm: Given FPAUS for independent sets in any graph, we can construct an FPRAS for the number of independent sets in a graph G.

  33. The Markov Chain Monte Carlo Method • The Markov Chain Monte Carlo Method provides a very general approach to sampling from a desired probability distribution. • Basic idea: Define an ergodic Markov chain whose set of states is the sample space and whose stationary distribution is the required sampling distribution.

  34. 1/M if xy and yN(x) 0 if xy and yN(x) 1-N(x)/M if x=y. Px,y= • Lemma: For a finite state space  and neighborhood structure {N(x)|x}, let N=maxx|N(x)|. • Let M be any number such that MN. Consider a Markov chain where • If this chain is irreducible and aperiodic, then the stationary distribution is the uniform distribution.

  35. Pf: • For xy, if x=y, then xPx,y=yPy,x, since Px,y=Py,x=1/M. • It follows that the uniform distribution x=1/|| is the stationary distribution by the following theorem.

  36. Thm: • P: transition matrix of a finite irreducible and ergodic Markov chain. If there are nonnegative numbers =(0,..,n) such that and if, for any pair of states i,j, iPi,j=jPj,i, then is the stationary distribution corresponding to P. Pf:  • Since , it follows that is the unique stationary distribution of the Markov Chain.

  37. Eg. Markov chain with states from independent sets in G=(V,E). • X0 is an arbitrary independent set in G. • To compute Xi+1: (a) choose a vertex v uniformly at random from V; (b) if vXi then Xi+1=Xi\{v}; (c) if vXi and if adding v to Xi still gives an independent set, then Xi+1=Xi{v}; (d) o/w, Xi+1=Xi.

  38. The neighbors of a state Xi are independent sets that differ from Xi in just one vertex. • Since every state is reachable from the empty set, the chain is irreducible. • Assume G has at least one edge (u,v), then the state {v} has a self-loop (Pv,v>0), thus aperiodic. • When xy, it follows that Px,y=1/|V| or 0, by the previous lemma, the stationary distribution is the uniform distribution.

  39. (1/M)min(1,y/x) if xy and yN(x) 0 if xy and yN(x) 1-yxPx,y if x=y. Px,y= The Metropolis Algorithm(When stationary distribution is nonuniform) • Lemma: For a finite state space  and neighborhood structure {N(x)|x}, let N=maxx|N(x)|. • Let M be and number such that MN. For all x, let x>0 be the desired probability of state x in the stationary distribution. Consider a Markov chain • Then, if this chain is irreducible and aperiodic, then the stationary distribution is given by x.

  40. Pf: • For any xy, if xy, then Px,y=1/M and Py,x=(1/M)(x/y). • It follows that Px,y=1/M=(y/x)Py,x. •  xPx,y=yPy,x. • Similarly, for x>y. • Again, by the previous theorem, x’s form the stationary distribution.

  41. Eg. Create a Markov chain, in the stationary distribution, each independent set I has probability proportional to |I|, for some >0. • I.e. x=|Ix|/B, where Ix is the independent set corresponding to state x and B=x|Ix|. • Note that, when =1, this is the uniform distribution.

  42. X0 is an arbitrary independent set in G. • To compute Xi+1: (a) choose v uniformly at random from V; (b) if vXi then Xi+1=Xi\{v} with probability min(1,1/); (c) if vXi and Xi{v} still gives an independent set, then put Xi+1=Xi{v} with probability min(1,); (d) o/w, set Xi+1=Xi.

More Related