Asymptotic normality of randomly truncated stochastic algorithms

Details Asymptotic normality of randomly truncated stochastic algorithms Asymptotic normality of randomly truncated stochastic algorithms

2010-03-22

arxiv.org/abs/1003.4183v1

Mathematics

Probability

Scientific paper

We study the convergence rate of randomly truncated stochastic algorithms, which consist in the truncation of the standard Robbins-Monro procedure on an increasing sequence of compact sets. Such a truncation is often required in practice to ensure convergence when standard algorithms fail because the expected-value function grows too fast. In this work, we give a self contained proof of a central limit theorem for this algorithm under local assumptions on the expected-value function, which are fairly easy to check in practice.

Affiliated with

Also associated with

No associations

Rating

Asymptotic normality of randomly truncated stochastic algorithms does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Asymptotic normality of randomly truncated stochastic algorithms, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Asymptotic normality of randomly truncated stochastic algorithms will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-206617