Lecture

Markov Chain Monte Carlo

In course

Sunt et fugiat ullamco mollit exercitation excepteur. Fugiat in anim consequat consectetur ut sit. Officia labore non cupidatat ut cillum amet consequat esse esse. Cupidatat sit ad enim incididunt cupidatat eiusmod irure. Sint consectetur eu sint officia anim nulla pariatur amet anim.

Description

This lecture covers the Markov Chain Monte Carlo method, focusing on the Metropolis-Hastings algorithm. It explains how to generate samples from a target probability distribution using this algorithm, constructing a transition kernel. The lecture also discusses the detailed balance condition and the importance of density functions in the process.

Instructor

sit non

Laborum mollit id labore nostrud aliquip duis. Ipsum occaecat consequat sint esse occaecat. Sint id qui aliqua nulla aliqua consectetur enim fugiat laboris ex aliquip ad aute est. Enim fugiat officia et irure eiusmod exercitation sint fugiat ad do non. Veniam enim pariatur aliquip labore dolore velit commodo reprehenderit esse non. Voluptate proident exercitation consequat ut occaecat Lorem do.

Official source

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

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

Computer engineering

Computer networks: Internet browsing

Statistics

Statistical inference: Mathematical statistics

Related lectures (31)

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.