Lecture

Optimization and Simulation

Description

This lecture covers the Metropolis-Hastings algorithm, focusing on gradient-based approaches to bias the search towards higher likelihood values. It explains the reject criterion, Python code implementation, and practical considerations such as multiple starting points and stationarity detection.

About this result
This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.