Metropolis-adjusted Langevin algorithm
In computational statistics, the Metropolis-adjusted Langevin algorithm (MALA) or Langevin Monte Carlo (LMC) is a Markov chain Monte Carlo (MCMC) method for obtaining random samples – sequences of random observations – from a probability distribution for which direct sampling is difficult. As the name suggests, MALA uses a combination of two mechanisms to generate the states of a random walk that has the target probability distribution as an invariant measure:
Wikipage disambiguates
Link from a Wikipage to another Wikipage
primaryTopic
Metropolis-adjusted Langevin algorithm
In computational statistics, the Metropolis-adjusted Langevin algorithm (MALA) or Langevin Monte Carlo (LMC) is a Markov chain Monte Carlo (MCMC) method for obtaining random samples – sequences of random observations – from a probability distribution for which direct sampling is difficult. As the name suggests, MALA uses a combination of two mechanisms to generate the states of a random walk that has the target probability distribution as an invariant measure:
has abstract
In computational statistics, t ...... y a single discrete time step.
@en
Wikipage page ID
49,312,612
page length (characters) of wiki page
Wikipage revision ID
994,070,141
Link from a Wikipage to another Wikipage
comment
In computational statistics, t ...... ution as an invariant measure:
@en
label
Metropolis-adjusted Langevin algorithm
@en