An adaptive version for the Metropolis adjusted Langevin algorithm with a truncated drift
Let \(\chi\) be an open subset of the \(d\)-dimensional Euclidean space \({\mathbb R}^{d}\) equipped with its Borel subsets and \(\pi\) is a positive and continuously differentiable density with respect to the Lebesgue measure on \(\chi.\) The bounded function \(D:\chi \to \chi\) is a drift function. The essence of the Metropolis-Hastings (MH) algorithm with a drift function \(D\) and a proposed density for the generating Markov chain \((X_{n})\) with invariant distribution \(\pi\) is reminded. In section 2 some adaptive schemes for the random walk Metropolis algorithm are extended to more general versions of the MH algorithm, particularly to the Metropolis adjusted Langevin algorithm with a truncated drift. The computing scheme of an adaptive version of the MH algorithm with bounded drift is presented in algorithm 2.1 which is exposed in section 2.1. The ergodicity of the adaptive MH algorithm is studied in section 2.2. Three assumptions are introduced and essentially used to prove the main results. Theorem 2.1 states an order \({\mathcal O}\left( \log n \over n^{\lambda}\right)\) \(({1 \over 2} < \lambda \leq 1)\) of the rate of convergence in \(V\)-norm of the distribution \({\mathcal L}(X_{n})\) of the stochastic process \((X_{n})\) generated by the algorithm 2.1 to the density \(\pi.\) It is shown that for any measurable function \(f\) the quasi-Monte Carlo algorithm for the function \(f\) on the set \((X_{n})\) converges to \(\pi(f)\) as \(n \to \infty.\) In section 2.3 the geometric ergodisity of the MH algorithm is studied. The algorithm 2.1 is illustrated by two simulation examples which are given in section 3. The first example is an illustration of sampling from a 20-dimensional Gaussian distribution. The second example models the failure of pumps at a nuclear plant. In section 4 the convergence of stochastic approximation algorithms is shown. A new approach to analyse stochastic approximation algorithms with Markovian dynamics is developed. The adaptive process \((\sigma_{n}, \mu_{n}, \Gamma_{n})\) in algorithm 2.1 gives a stochastic approximation of the recurrence form of the solution of the equation \(h(\theta) = 0.\) In Theorem 4.1 the asymptotic behaviour of the random process \((\theta_{n}, X_{n})\) is studied by using the mixingale theory. Theorem 2.1 is proved in section 5. Propositions 2.1 and 2.2 are proved in section 6.
- Adaptive Markov Chain Monte Carlo through Regeneration
- An adaptive Metropolis algorithm
- Applications of a Kushner and Clark lemma to general classes of stochastic algorithms
- Exponential convergence of Langevin distributions and their discrete approximations
- Geometric ergodicity of Metropolis algorithms
- scientific article; zbMATH DE number 3723610 (Why is no real title available?)
- scientific article; zbMATH DE number 48727 (Why is no real title available?)
- scientific article; zbMATH DE number 1972910 (Why is no real title available?)
- scientific article; zbMATH DE number 2117879 (Why is no real title available?)
- Langevin-type models II: Self-targeting candidates for MCMC algorithms
- Markov chains for exploring posterior distributions. (With discussion)
- On adaptive Markov chain Monte Carlo algorithms
- On the almost sure asymptotic behaviour of stochastic algorithm
- On the efficiency of adaptive MCMC algorithms
- On the ergodicity properties of some adaptive MCMC algorithms
- Optimal scaling for various Metropolis-Hastings algorithms.
- Optimal scaling of MaLa for nonlinear regression.
- Renewal theory and computable convergence rates for geometrically erdgodic Markov chains
- Strong laws of large numbers for dependent heterogeneous processes: a synthesis of recent and new results
- Adaptive independent Metropolis-Hastings
- Smoothed Langevin proposals in Metropolis-Hastings algorithms.
- Powered embarrassing parallel MCMC sampling in Bayesian inference, a weighted average intuition
- Convergent stochastic expectation maximization algorithm with efficient sampling in high dimension. Application to deformable template model estimation
- Optimal strategies for the control of autonomous vehicles in data assimilation
- Bayesian model selection for high-dimensional Ising models, with applications to educational data
- The tamed unadjusted Langevin algorithm
- Approximation and sampling of multivariate probability distributions in the tensor train decomposition
- Dimension-independent likelihood-informed MCMC
- Scalable posterior approximations for large-scale Bayesian inverse problems via likelihood-informed parameter and state reduction
- On the computational complexity of MCMC-based estimators in large samples
- Langevin diffusions and the Metropolis-adjusted Langevin algorithm
- Proximal Markov chain Monte Carlo algorithms
- Adaptive step size selection for Hessian-based manifold Langevin samplers
- Markov chain Monte Carlo confidence intervals
- A hierarchical Bayesian model for spatial prediction of multivariate non-Gaussian random fields
- Transport map accelerated Markov chain Monte Carlo
- Efficient Adaptive MCMC Through Precision Estimation
- An adaptive backward coupling Metropolis algorithm for truncated distributions
- Limit theorems for some adaptive MCMC algorithms with subgeometric kernels. II
- Bayesian inference in the presence of intractable normalizing functions
- A Bayesian mixed-effects model to learn trajectories of changes from repeated manifold-valued observations
- An Adaptive Independence Sampler MCMC Algorithm for Bayesian Inferences of Functions
- Bayesian computation for statistical models with intractable normalizing constants
- Joint estimation of Robin coefficient and domain boundary for the Poisson problem
- Geometric Integration of Measure-Preserving Flows for Sampling
- Prior normalization for certified likelihood-informed subspace detection of Bayesian inverse problems
- Certified dimension reduction in nonlinear Bayesian inverse problems
- Maximum likelihood estimation of regularization parameters in high-dimensional inverse problems: an empirical Bayesian approach. I: Methodology and experiments
- Decreasing flow uncertainty in Bayesian inverse problems through Lagrangian drifter control
- Bayesian inverse problems with l₁ priors: a randomize-then-optimize approach
- Kernel estimators of asymptotic variance for adaptive Markov chain Monte Carlo
- A coherent framework for learning spatiotemporal piecewise-geodesic trajectories from longitudinal manifold-valued data
- Bayesian computation: a summary of the current state, and samples backwards and forwards
- Forecasting transaction counts with integer-valued GARCH models
- Limit theorems for some adaptive MCMC algorithms with subgeometric kernels
- Accelerating adaptation in the adaptive Metropolis–Hastings random walk algorithm
- Multilevel Delayed Acceptance MCMC
- Towards optimal scaling of Metropolis-coupled Markov chain Monte Carlo
- On the stability and ergodicity of adaptive scaling Metropolis algorithms
- hIPPYlib-MUQ: a Bayesian inference software framework for integration of data with complex predictive models under uncertainty
- Non-stationary phase of the Metropolis-adjusted Langevin algorithm with annealed proposals
- An adaptive approach to Langevin MCMC
- Efficient sampling for sparse Bayesian learning using hierarchical prior normalization
- On adaptive Markov chain Monte Carlo algorithms
- A cautionary tale on the efficiency of some adaptive Monte Carlo schemes
This page was built for publication: An adaptive version for the Metropolis adjusted Langevin algorithm with a truncated drift
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2433262)
