|COOKIES: By using this website you agree that we can place Google Analytics Cookies on your device for performance monitoring.|
Adaptive algorithms for Stratified Sampling Monte Carlo
If you have a question about this talk, please contact Robin Evans.
Note the earlier time and different room to allow attendance at the RSS Ordinary Meeting
We consider the problem of estimating the integral of a function f over a domain. Although no analytic expression for f is available, it is possible to obtain n samples from f, chosen anywhere in the domain. A popular method for computing the integral of the function is to stratify the space in strata and sample points in the strata.
We propose an algorithm for returning a stratified estimate of the integral. We prove that this algorithm adapts online the number of samples in each stratum to the amount of variation of the function in the stratum. In particular, this enables to allocate more samples where the function varies more, and be almost as efficient as an “oracle” strategy that has access to the variations of the functions in each stratum. More precisions on this aspect is in paper (Carpentier and Munos, 2011). We also provide some results on (i) how to choose the number of strata in an efficient way and (ii) how to adapt the strata themselves to the specific shape of the function. We express those results with finite-time bounds on a proxy of the variance of the estimate (returned by the algorithms we present).
This talk is part of the Statistics Reading Group series.
This talk is included in these lists:
Note that ex-directory lists are not shown.
Other listsGiving What We Can: Cambridge EED Film Series: 'City of God' UCL based talks series
Other talksLava, luck and linear logs The Conscious Phenotype Sex, Disease and Fertility in History An introduction to Mendelian randomization TBC (neural progenitors / brain & spinal cord development) Professor Patrick Cramer - Title to be confirmed