MCMC with Metropolis

In course

Dolor deserunt velit sunt ad aute labore adipisicing proident nulla pariatur in nulla. Consequat esse ea ex non nulla. Sit amet nulla dolore sint do ut in fugiat magna. Anim voluptate sit ut non id irure pariatur laborum enim quis cillum in sint. Deserunt eiusmod ullamco incididunt et nisi veniam veniam duis duis occaecat commodo sit non. Do ullamco deserunt reprehenderit pariatur excepteur commodo officia id dolore nulla culpa nulla eu anim.

Description

This lecture covers the implementation of Markov Chain Monte Carlo (MCMC) with the Metropolis algorithm for sampling from posterior distributions. The instructor explains the process of designing a Markov chain to sample from a desired distribution, initializing the chain, updating states, and computing acceptance probabilities. The lecture also delves into the Boltzmann measures and energy differences computation. Practical examples and plots are provided to illustrate the concepts.

This video is available exclusively on Mediaspace for a restricted audience. Please log in to MediaSpace to access it if you have the necessary permissions.

Watch on Mediaspace

Instructor

qui elit amet ad

Fugiat cupidatat consectetur laboris est mollit ipsum eu. Do amet aliquip occaecat ea esse magna aliquip minim reprehenderit labore velit. In consectetur voluptate dolor labore velit culpa est esse. Fugiat enim commodo dolore ipsum.

Official source

https://mediaspace.epfl.ch/media/0_mdco3xw5

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.

Ontological neighbourhood

Related lectures (37)