The INI has a new website!

This is a legacy webpage. Please visit the new site to ensure you are seeing up to date information.

Skip to content

SCS

Seminar

Iterative Monte Carlo for extreme quantiles and extreme probabilities

Guyader, A; Hengartner, NW; Matzner-LÝber, E (Rennes 2; Los Alamos; Rennes 2)
Monday 21 June 2010, 14:50-15:15

Abstract

Let $X$ be a random vector with distribution $\mu$ on ${\mathbb R}^d$ and $\Phi$ be a mapping from ${\mathbb R}^d$ to ${\mathbb R}$. That mapping acts as a black box, e.g., the result from some computer experiments for which no analytical expression is available. This paper presents an efficient algorithm to estimate a tail probability given a quantile or a quantile given a tail probability. It proceeds by successive elementary steps, each one being based on Metropolis-Hastings algorithm. The algorithm improves upon existing multilevel splitting methods and can be analyzed using Poisson process tools that lead to exact description of the distribution of the estimated probabilities and quantiles. The performance of the algorithm is demonstrated in a problem related to digital watermarking.

Presentation

[pdf ]

Video

The video for this talk should appear here if JavaScript is enabled.
If it doesn't, something may have gone wrong with our embedded player.
We'll get it fixed as soon as possible.

Back to top ∧