Adapative importance sampling on discrete Markov chains
In modelling particle transport through the medium, the path of a particle behaves as a transient Markov chain. The authors are interested in characteristics of the particle's movement depending on its starting state, which take the form of a ``score accumulated with each transition. The main purpose of this work is to prove that under certain conditions adaptive importance sampling for discrete Markov chains with scoring converges exponentially. Examples presented show that this exponential convergence can occur with a reasonably small number of simulation runs. These assumptions include that the state space is finite, the vector of expected scores conform a linear model and that there are sufficiently many replications of the initial states in the simulation.
- Adaptive Importance Sampling Technique for Markov Chains Using Stochastic Approximation
- Exponential convergence of adaptive importance sampling for Markov chains
- Publication:3359723
- Stochastic adaptation of importance sampler
- Implicitly adaptive importance sampling
- Optimizing adaptive importance sampling by stochastic approximation
- MCMC-driven adaptive multiple importance sampling
- An adaptive importance sampling technique
- Coupling based estimation approaches for the average reward performance potential in Markov chains
- A new \textit{walk on equations} Monte Carlo method for solving systems of linear algebraic equations
- Rare-event simulation of non-Markovian queueing networks using a state-dependent change of measure determined using cross-entropy
- On the inefficiency of state-independent importance sampling in the presence of heavy tails
- An adaptive zero-variance importance sampling approximation for static network dependability evaluation
- Adaptive Importance Sampling Technique for Markov Chains Using Stochastic Approximation
- Exponential convergence of adaptive importance sampling for Markov chains
- ACCELERATED MONTE CARLO FOR PARTICLE DISPERSION
- Adaptive simulation using perfect control variates
- An improved ``walk on equations Monte Carlo algorithm for linear algebraic systems
- Accelerating convergence in stochastic particle dispersion simulation codes
- The cross-entropy method with patching for rare-event simulation of large Markov chains
- The square root rule for adaptive importance sampling
- Rare-event simulation for neural network and random forest predictors
- Approximating zero-variance importance sampling in a reliability setting
This page was built for publication: Adapative importance sampling on discrete Markov chains
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1305417)
