On large deviations and design of efficient importance sampling algorithms
2014 (English)Doctoral thesis, comprehensive summary (Other academic)
This thesis consists of four papers, presented in Chapters 2-5, on the topics large deviations and stochastic simulation, particularly importance sampling. The four papers make theoretical contributions to the development of a new approach for analyzing efficiency of importance sampling algorithms by means of large deviation theory, and to the design of efficient algorithms using the subsolution approach developed by Dupuis and Wang (2007).
In the first two papers of the thesis, the random output of an importance sampling algorithm is viewed as a sequence of weighted empirical measures and weighted empirical processes, respectively. The main theoretical results are a Laplace principle for the weighted empirical measures (Paper 1) and a moderate deviation result for the weighted empirical processes (Paper 2). The Laplace principle for weighted empirical measures is used to propose an alternative measure of efficiency based on the associated rate function.The moderate deviation result for weighted empirical processes is an extension of what can be seen as the empirical process version of Sanov's theorem. Together with a delta method for large deviations, established by Gao and Zhao (2011), we show moderate deviation results for importance sampling estimators of the risk measures Value-at-Risk and Expected Shortfall.
The final two papers of the thesis are concerned with the design of efficient importance sampling algorithms using subsolutions of partial differential equations of Hamilton-Jacobi type (the subsolution approach).
In Paper 3 we show a min-max representation of viscosity solutions of Hamilton-Jacobi equations. In particular, the representation suggests a general approach for constructing subsolutions to equations associated with terminal value problems and exit problems. Since the design of efficient importance sampling algorithms is connected to such subsolutions, the min-max representation facilitates the construction of efficient algorithms.
In Paper 4 we consider the problem of constructing efficient importance sampling algorithms for a certain type of Markovian intensity model for credit risk. The min-max representation of Paper 3 is used to construct subsolutions to the associated Hamilton-Jacobi equation and the corresponding importance sampling algorithms are investigated both theoretically and numerically.
The thesis begins with an informal discussion of stochastic simulation, followed by brief mathematical introductions to large deviations and importance sampling.
Place, publisher, year, edition, pages
Stockholm: KTH Royal Institute of Technology, 2014. , xii, 20 p.
Large deviations, Monte Carlo methods, importance sampling
Probability Theory and Statistics
IdentifiersURN: urn:nbn:se:kth:diva-144423ISBN: 978-91-7595-130-0OAI: oai:DiVA.org:kth-144423DiVA: diva2:713478
2014-05-14, Sal F3, Lindstedtsvägen 26, KTH, Stockholm, 13:15 (English)
Juneja, Sandeep, Professor
Hult, Henrik, Associate Professor
QC 201404242014-04-242014-04-232014-04-24Bibliographically approved
List of papers