O Metropolis-Hastings Algoritmo is a widely used algorithm in the field of statistical physics and estatísticas bayesianas for generating samples from a probability distribution when direct sampling is difficult. It is particularly useful for sampling from high-dimensional spaces and is a cornerstone of Cadeia de Markov Monte Carlo métodos (MCMC).
The algorithm works by constructing a Markov chain that has the desired distribution as its equilibrium distribution. It begins with an initial sample and proposes a new sample based on a proposal distribution. A key step is to determine whether to accept or reject this proposed sample. This decision is made based on the ratio of the probabilities of the proposed sample and the current sample, adjusted by the proposal distribution.
Especificamente, se temos um estado atual state x and propose a new state x’, we compute the acceptance ratio:
α = min(1, (P(x’) * Q(x | x’)) / (P(x) * Q(x’ | x)))
Aqui, P denotes the target distribution, and Q is the proposal distribution. If the proposed sample is accepted, it becomes the new current sample; if not, the current sample is retained. This process is repeated, allowing the chain to explore the space and converge to the target distribution over time.
Uma das forças do Algoritmo de Metropolis-Hastings é sua flexibilidade na escolha da distribuição de proposta, que pode ser ajustada para eficiência. No entanto, é preciso tomar cuidado para garantir que a distribuição de proposta seja bem projetada, a fim de evitar problemas como má mistura ou ficar preso em modos locais.
Overall, the Metropolis-Hastings Algorithm is a powerful tool for statistical inference and has applications across various fields, including machine learning, biologia computacional, and physics.