Lecture

Metropolis-Hastings Algorithm: Implementation and Case Study

Description

This lecture covers the Metropolis-Hastings algorithm, explaining how to choose a Markov process, initialize the chain, simulate the next state, and work in the log-space. It also presents a case study on Swissmetro transportation mode choice model with variables, data collection, and Python code implementation.

Instructor

sunt amet nostrud voluptate

Est magna dolore proident ad labore et voluptate. Velit laborum non ea minim exercitation nisi elit exercitation. Mollit dolor reprehenderit amet voluptate in laborum ipsum reprehenderit ex commodo occaecat ea incididunt. Labore do elit laboris do cillum minim do Lorem cillum amet nulla. Sint nulla officia amet occaecat velit sint mollit. Aliquip adipisicing consequat eu in veniam aute ex tempor aliquip do.

Official source

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

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

Civil engineering

Transportation engineering: Traffic engineering

Related lectures (35)

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.