Découvrez les nouveautés de cette version : Fonctionnalités, améliorations et évolutions vous attendent ! 👉 Cliquez ici pour en savoir plus

Monte Carlo Methods

Version 5.1 par Rémi Peyre le 15/01/2023 - 20:45

Monte Carlo Methods

8KUAAN11

2 ECTS


SEMESTER 8


lectures

classes / seminars

practical work

integrative teaching

independent work

6 h

12 h

0 h

0 h

36 h

Language used

French



Course supervisor(s)

Yvain BRUNED, Full professor at the Nancy Faculty of Science & Technologyindex.png

Key words

Random simulation; Monte Carlo method; Variance reduction; MCMC methods

Prerequisites

Probability theory (level: 1st year of master's degree); basics in Python programming language

Overall objective

Learn how to use random simulation to solve complicated deterministic problems.

Course content and organisation

   The first part of this course presents the Monte Carlo method to assess a probabilistic expectation by the use of simulations: by doing so, one computes a deterministic quantity through a random algorithm!

   In this first part, we will explain not only how to estimate the wanted quantity of interest; but also (and this is not less important) how to get the confidence interval for our estimator.  It may be important to be able to sharpen that confidence interval: that aim is achieved by the variance reduction techniques.  We will present four of these techniques, viz. importance sampling, conditioning, control variates and coupling (a.k.a. “common randomm numbers”).

   In many situations, simulating the needed wanted variables—which is of course central to the Monte Carlo method—turns out to be a more difficult challenge than applying the Monte Carlo method as such.  A typical situation where this occurs is when one needs to simulate random variables according to some posterior distribution in large-dimensional Bayesian statistics.  To tackle that issue, the second part of the course will present a range of methods to simulate variables following such random distributions, which methods are based on Markov chains, hence their name: Monte Carlo Markov Chain (or commonly “MCMC”) methods.

   In particular, we will study the Metropolis‒Hastings algorithm, which is very general; and we will also introduce the Gibbs sampling method, which is faster but also trickier to operate.  The reliability of such simulation methods (in particular concerning their speed of convergence) will be looked at under both theoretical and practical angles.

   A large part of the teaching will be devoted to implementing the studied concepts into computer programs.  For the computer exercise sessions, Python was chosen for language.

Skills

Levels

Description and operational verbs

Know


Understand


Apply 


Analyse 


Summarise


Assess


Compliance with the United Nations Sustainable Development Goals

Evaluation methods

Continuous assessment

Written test

Oral presentation / viva

Written report / project