Lecture

Optimization and Simulation

Description

This lecture covers the Metropolis-Hastings algorithm, a method for simulating a random variable with a given probability mass function efficiently. It introduces the concept of transition probabilities, time reversibility, and the stationary distribution of a Markov process.

Instructor

dolore ea occaecat

Voluptate enim amet proident cillum. Officia irure enim ea eu ullamco nostrud laboris ipsum aliqua qui. Ad pariatur adipisicing velit consequat ipsum elit mollit. Enim qui enim in cupidatat ut esse irure voluptate voluptate mollit sit Lorem voluptate. Magna mollit excepteur laborum do officia deserunt laboris fugiat non aliquip eiusmod laboris minim.

Official source

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

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 (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.