Review on "A simple introduction to Markov Chain Monte-Carlo sampling"

Lucas Oliveira David

ld492@drexel.edu

Introduction

Markov Chain Monte-Carlo

(MCMC)

"A computer-driven sampling method." [1]

 

Characterizes a distribution even without knowing all its mathematical properties.

From "MCMC". Available at: wikiwand.

Monte-Carlo

Family of methods called Monte-Carlo simulations that estimate properties of a distribution by repeatedly random sampling from it.

Simulated equity curve for a trading system, from "Monte-Carlo Simulation". Available at: knispo-guido-to-stock-trading.

Monte-Carlo

Mean computation

Example: estimating the mean of a distribution based on a randomly small subset of it.

 

    Example within the example: finding the average score of each currently valid move in a Othelo game, so the autonomous agent can select the one with greater value (see PlayerLikeAMonteCarlo).

Markov Chain

Let r be a random variable which describes the weather (whether it's 0-sunny or 1-raining), s.t.

r = \begin{cases} 0, & \text{with probability }p = .6\\ 1, & \text{with probability }1-p=.4 \end{cases}

A possible sequence of day weathers described by this model could be:

1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 0, 0, 1, 0, 1, 0, 0, 1, 0, 1, 0, 1, 0, 1, 0, 0, 0, 1, 0, 0

Rain happens 40% of the time, but the sequence doesn't describe our world very well, as, in practice, sunny periods tend to stay that way and raining days tend to be followed by more rain. What about:

0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0, 1, 0, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0

That seems more realistic. To accomplish that, let's use the idea of states.

Markov Chain

What if we want to find out about day #42?

sunny

raining

.1

.5

.9

.5

P = \begin{pmatrix} .9 & .1 \\ .5 & .5 \end{pmatrix}
X_{42} = [Pr(S_{42} = 0)\space Pr(S_{42} = 1)]

(the probability of raining given all previous states)

That looks very complicated to know. Let's assume something to make our problem easier...

\equiv
X_0 = [0\space 1]
Pr[S_{42} = j \mid S_{41} = i_{41}, ..., S_1 = i_1]

Markov Chain

Pr[S_{n+1} = j \mid \cap_{k = 1}^n S_k = i_k] = Pr[S_{n+1} = j \mid S_n = i_n]

(Markov property: a state can be fully determined by its direct previous state)

Now, let's say today is day #0 and it IS raining. Therefore:

X_0 = [0\space 1]
X_1 = X_0 P = [.5\space .5]
X_{n+1} = X_n P = [0\space 1] P^n
X_2 = X_1 P = [0\space 1] P^2 = [.7\space .3]
X_3 = X_2 P = [0\space 1] P^3 = [.78\space .22]

Markov Chain

q = [\alpha\space \beta] \text{ s.t. } q = q P \text{?}

Is the change in the state vector decreasing, as n increases? Is it converging to a stationary state? I.e.,

\therefore q \approx [.83\space .17]
q I = q P \Leftrightarrow q (I - P) = 0 \Leftrightarrow q \begin{pmatrix} -.1 & .1 \\ .5 & -.5 \end{pmatrix} = 0

Markov Chain

Def: Markov chains are instances of random processes that share the Markov property. That is, mathematical models for random phenomena evolving over time [2].

Def: A Markov chain is said to be stationary if and only if the marginal distribution X_n doesn't depend on n [3] (i.e., it has a stationary state).

MCMC

Completely random sampling from highly dimensional distributions is very inefficient.

 

How to improve it?

MCMC

So what is MCMC really about?

Dermatology data set, preprocessed with PCA for visualization purposes

D = [d]_{366 \times 34}

Given a likelihood function p, an initial guess x_0 and a set of hyper-parameters, MCMC efficiently samples from a distribution by creating a Markov chain with stationary distribution equivalent to the desired real distribution of the problem at hand.

 

Samples can now be drawn from the created model, simulating drawing samples from the distribution of interest.

 

Expectation of the created model's distribution can be easily estimated, hence finding an estimation for the expectation of the real distribution.

MCMC

So what is MCMC really about?

MCMC

import numpy.random as r


def metropolis(n_cycles, p, initial_guess, std):
    samples = [initial_guess]

    for i in range(n_cycles):
        x_i = samples[-1]

        x_c = x_i + std * r.randn()

        if r.rand() < min(1, p(x_c) / p(x_i)):
            samples.append(x_c)
        else:
            samples.append(x_i)

    return samples

MCMC

Execution example

Markov chain created

Real (unknown) distribution and the generated Markov chain

How to find out the mean of test scores in a student population when only one student's score is known to be 100?

 

A experienced lecture knows that the scores are normally distributed with a std of 15.

MCMC

Example: in-set class

MCMC

Example: in-set class

Chains for three different initial guesses.

Dashed line: true distribution.

Continuous line: synthetic distribution.

MCMC

Example: Equation of State Calculations by Fast Computing Machines [4]

A 2-dimensional configuration of particles.

MCMC

import numpy.random as r


def metropolis(n_cycles, E, initial_guess, box_width, k, T):
    samples = [initial_guess]

    for i in range(n_cycles):
        x_i = samples[-1]
        x_c = x_i[:]

        i = r.randint(x_c.shape)
        x_c[i] = (x_c[i][0] + box_width * r.randn(),
                  x_c[i][1] + box_width * r.randn())

        if E(x_c) < E(x_i) or r.rand() < (E(x_c) - E(x_i)) / (k*T):
            sample.append(x_c)
        else:
            samples.append(x_i)

    return samples

Example: Equation of State Calculations by Fast Computing Machines [4]

Limitations

Limitations

Likelihood function

The likelihood function p used must be  equal or at least proportional to the true density function in the target distribution.

Markov chain created

Limitations

Proposal distribution

  • High std's throw us out of the target distribution.
  • Low std's might take too long to converge, or result in sub-optimal convergence (local maxima).

Highly variate chain

Lowly variable chain

Limitations

Proposal distribution

# ...
def metropolis_hastings(n_cycles, p, initial_guess, std):
    # for ...
        x_c ~ g(x_c, x_i)

        if r.rand() < min(1, p(x_c) * g(x_i, x_c) / (p(x_i) * g(x_c, x_i))):

    # return ...

The proposal distribution g must be symmetric, s.a.:

x_c = x_i + std * r.randn()

If not, an adjust must be made (known as Metropolis-Hastings).

Limitations

Distant initial guesses (burn-in)

Initial values are likely offset from the true distribution and therefore must be discarded.

Limitations

Multivariate distribution with correlated parameters

In practice, correlated model parameters lead to extremely slow convergence of sampling chains or even non-covergence.

Extensions

Extensions

For each parameter of the model, and accept/reject the update based on the all other parameters. I.e., use a specific conditional distribution for each parameter.

A cycle of Metropolis is finished when all parameters are updated.

Metropolis within Gibbs

Chains produced, the real distribution and

the density of the sampled values.

Extensions

Differential Evolution

Metropolis-Hastings explores within a circumference.

 

Keeps                       chains.

At every iteration, for every chain, randomly select two chains m and n and compute a new candidate as follows:

Metropolis-Hastings exploration

Differential evolution exploration

\{\theta_1, \theta_2, ..., \theta_k\}
\theta_c = \theta_k + \gamma (\theta_m - \theta_n) + randn()

Final Thoughts

Final Thoughts

  • MCMC is a very efficient way to solve very complicated problems, and can be applied to pretty much every area.
  • Metropolis-Hastings was named one of the top 10 algorithm of the 20th century [5].
  • It has some problems such as burn-in and convergence dependency on tuning/initial state, but extensions to handle these were developed as well.

References

[1] Ravenzwaaij, Don, Pete Cassey, and Scott D. Brown. "A simple introduction to Markov Chain Monte–Carlo sampling." Psychonomic bulletin & review (2016): 1-12.

[2] Norris, J.R. "Markov Chains", Cambridge Series in Statistical and Probabilistic Mathematics. Cambridge University Press, 1998.

[3] Geyer, Charles. "Introduction to markov chain monte carlo." Handbook of Markov Chain Monte Carlo (2011): 3-48.

[4] Metropolis, Nicholas, et al. "Equation of state calculations by fast computing machines." The journal of chemical physics 21.6 (1953): 1087-1092.

[5] Cipra, Barry A. "The best of the 20th century: editors name top 10 algorithms." SIAM news 33.4 (2000): 1-2.

Review of "A simple introduction to Markov Chain Monte-Carlo sampling"

By Lucas David

Made with Slides.com

Review of "A simple introduction to Markov Chain Monte-Carlo sampling"

  • 65

More from Lucas David

  • Undergraduate Final Report - A Study of The Isomap Algorithm and Its Applications in Machine Learning
    Lucas David
    290