Exponential convergence of adaptive importance sampling for Markov chains

From MaRDI portal





The purpose of this paper is to establish conditions for exponential convergence of learning algorithms for Markov chains with scoring that arise in particle transport and have application to such fields as nuclear reactor operations, well logging for oil exploration and radiation dosage calculations for exposure to medical X-rays. Simulation of the `analog' chain is often so time consuming as to be impractical. Therefore, learning algorithms have been developed to simulate from approximate zero-variance important functions, and then use the results to improve the importance function. When the procedure is iterated, it has been shown numerically to converge exponentially to the solution. In this paper the problem is formally defined. The main result of this paper is a theorem stating the exponential convergence and its proof. The constraint (theorem assumptions) are shown to be rather mild to guarantee an exponential convergence for general state spaces. As an example, an idealized particle transport problem is treated by adaptive importance sampling. Finally, concluding remarks summarize the experience of the authors with the use of their approach.











This page was built for publication: Exponential convergence of adaptive importance sampling for Markov chains

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4519099)