Adaptive Importance Sampling Technique for Markov Chains Using Stochastic Approximation

For a discrete-time finite-state Markov chain, we develop an adaptive importance sampling scheme to estimate the expected total cost before hitting a set of terminal states. This scheme updates the change of measure at every transition using constant or decreasing step-size stochastic approximation. The updates are shown to concentrate asymptotically in a neighborhood of the desired zero variance estimator. Through simulation experiments on simple Markovian queues, we observe that the proposed technique performs very well in estimating performance measures related to rare events associated with queue lengths exceeding prescribed thresholds. We include performance comparisons of the proposed algorithm with existing adaptive importance sampling algorithms on a small example. We also discuss the extension of the technique to estimate the infinite horizon expected discounted cost and the expected average cost. Work supported in part by grant III.5(157)/99-ET from Dept. of Science and Tech...

• Type: Journal
• Year: 2006
• Where: IOR
• Authors: T. P. I. Ahamed, Vivek S. Borkar, S. Juneja
• Keywords: Adaptive Importance, Discrete-time Finite-state Markov, Importance Sampling Scheme, IOR 2006