A stochastic approximation algorithm with multiplicative step size adaptation

Details A stochastic approximation algorithm with multiplicative step size adaptation A stochastic approximation algorithm with multiplicative step size adaptation

2005-03-21

arxiv.org/abs/math/0503434v1

Mathematics

Statistics Theory

Scientific paper

An algorithm of searching a zero of an unknown undimensional function is considered, measured at a point x with some error. The step sizes are random positive values and are calculated according to the rule: if two consecutive iterations are in same direction step is multiplied by u>1, otherwise, it is multiplied by 01, divergence. Due to the multiplicative rule of updating of the step, it is natural to expect that the sequence converges rapidly: like a geometric progression (if convergence takes place), but the limit value may not coincide with, but instead, approximates one of zeros of the function. By adjusting the parameters u and d, one can reach necessary precision of approximation; higher precision is obtained at the expense of lower convergence rate.

Affiliated with

Also associated with

No associations

Rating

A stochastic approximation algorithm with multiplicative step size adaptation 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 A stochastic approximation algorithm with multiplicative step size adaptation, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A stochastic approximation algorithm with multiplicative step size adaptation will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-160309