Efficient simulation of density and probability of large deviations of sum of random vectors using saddle point representations
Santanu Dey, Sandeep Juneja, Ankush Agarwal

TL;DR
This paper introduces a saddle-point based importance sampling method for efficiently estimating the density and large deviation probabilities of sums of i.i.d. light-tailed vectors, improving accuracy and computational efficiency.
Contribution
It develops a novel saddle-point representation approach that enables identification of zero-variance importance sampling measures with asymptotically vanishing relative error.
Findings
The proposed method achieves asymptotically vanishing relative error.
It effectively estimates tail densities and large deviation probabilities.
Extension to expected overshoot estimation demonstrates broader applicability.
Abstract
We consider the problem of efficient simulation estimation of the density function at the tails, and the probability of large deviations for a sum of independent, identically distributed, light-tailed and non-lattice random vectors. The latter problem besides being of independent interest, also forms a building block for more complex rare event problems that arise, for instance, in queueing and financial credit risk modelling. It has been extensively studied in literature where state independent exponential twisting based importance sampling has been shown to be asymptotically efficient and a more nuanced state dependent exponential twisting has been shown to have a stronger bounded relative error property. We exploit the saddle-point based representations that exist for these rare quantities, which rely on inverting the characteristic functions of the underlying random vectors. These…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
