数学
独立同分布随机变量
渐近最优算法
事件(粒子物理)
应用数学
采样(信号处理)
指数分布
随机变量
指数族
分布(数学)
指数函数
指数增长
重尾分布
区间(图论)
统计
离散数学
数学优化
组合数学
数学分析
计算机科学
物理
滤波器(信号处理)
量子力学
计算机视觉
作者
Paul Glasserman,Sandeep Juneja
标识
DOI:10.1287/moor.1070.0276
摘要
Successful efficient rare-event simulation typically involves using importance sampling tailored to a specific rare event. However, in applications one may be interested in simultaneous estimation of many probabilities or even an entire distribution. In this paper, we address this issue in a simple but fundamental setting. Specifically, we consider the problem of efficient estimation of the probabilities P(S n ≥ na) for large n, for all a lying in an interval 𝒜, where S n denotes the sum of n independent, identically distributed light-tailed random variables. Importance sampling based on exponential twisting is known to produce asymptotically efficient estimates when 𝒜 reduces to a single point. We show, however, that this procedure fails to be asymptotically efficient throughout 𝒜 when 𝒜 contains more than one point. We analyze the best performance that can be achieved using a discrete mixture of exponentially twisted distributions, and then present a method using a continuous mixture. We show that a continuous mixture of exponentially twisted probabilities and a discrete mixture with a sufficiently large number of components produce asymptotically efficient estimates for all a ∈ 𝒜 simultaneously.
科研通智能强力驱动
Strongly Powered by AbleSci AI