Almost sure convergence of randomly truncated stochastic algorithms under verifiable conditions

Abstract

We study the almost sure convergence of randomly truncated stochastic algorithms. We present a new convergence theorem which extends the already known results by making vanish the classical condition on the noise terms. The aim of this work is to prove an almost sure convergence result of randomly truncated stochastic algorithms under easily verifiable conditions

Cited by in corpus (5)

• Robust adaptive importance sampling for normal random vectors
• A framework for adaptive Monte-Carlo procedures
• A Robbins-Monro procedure for estimation in semiparametric regression models
• Asymptotic normality of randomly truncated stochastic algorithms
• Liquidity costs: a new numerical methodology and an empirical study