COOKIES: By using this website you agree that we can place Google Analytics Cookies on your device for performance monitoring. |
University of Cambridge > Talks.cam > Isaac Newton Institute Seminar Series > Multilevel Nested Simulation for Efficient Risk Estimation
Multilevel Nested Simulation for Efficient Risk EstimationAdd to your list(s) Download to your calendar using vCal
If you have a question about this talk, please contact INI IT. UNQW03 - Reducing dimensions and cost for UQ in complex systems We investigate the problem of computing a nested expectation of the form P[E[X|Y] >= 0] = E[H(E[X|Y])] where H is the Heaviside function. This nested expectation appears, for example, when estimating the probability of a large loss from a financial portfolio. We present a method that combines the idea of using Multilevel Monte Carlo (MLMC) for nested expectations with the idea of adaptively selecting the number of samples in the approximation of the inner expectation, as proposed by (Broadie et al., 2011). We propose and analyse an algorithm that adaptively selects the number of inner samples on each MLMC level and prove that the resulting MLMC method with adaptive sampling has an order e-2|log(e)|2 complexity to achieve a root mean-squared error e. The theoretical analysis is verified by numerical experiments on a simple model problem. Joint work with: Michael B. Giles (University of Oxford) This talk is part of the Isaac Newton Institute Seminar Series series. This talk is included in these lists:
Note that ex-directory lists are not shown. |
Other listsagriculture Andrew Chamblin Memorial Lecture 2013 Workshop on Multimodal Approaches to Language AcquisitionOther talksBayesian Quadrature for Multiple Related Integrals The world is not flat: towards 3D cell biology and 3D devices Malaria’s Time Keeping Modeling and understanding of Quaternary climate cycles Babraham Lecture - Deciphering the gene regulation network in human germline cells at single-cell & single base resolution Complete Graphs with No Rainbow Tree |