Exponential convergence of adaptive importance sampling for Markov chains (Q4519099)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 1538487
Language Label Description Also known as
default for all languages
No label defined
    English
    Exponential convergence of adaptive importance sampling for Markov chains
    scientific article; zbMATH DE number 1538487

      Statements

      Exponential convergence of adaptive importance sampling for Markov chains (English)
      0 references
      0 references
      0 references
      0 references
      1 August 2001
      0 references
      adaptive procedures
      0 references
      biased random walks
      0 references
      learning algorithms
      0 references
      Monte Carlo simulation
      0 references
      particle transport
      0 references
      zero-variance solution
      0 references
      exponential convergence
      0 references
      Markov chains
      0 references
      nuclear reactor operations
      0 references
      oil exploration
      0 references
      radiation dosage calculations
      0 references
      medical X-rays
      0 references
      importance sampling
      0 references
      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.
      0 references

      Identifiers

      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references