A companion for the Kiefer--Wolfowitz--Blum stochastic approximation algorithm

Mathematics – Statistics Theory

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

Published in at http://dx.doi.org/10.1214/009053606000001451 the Annals of Statistics (http://www.imstat.org/aos/) by the Inst

Scientific paper

10.1214/009053606000001451

A stochastic algorithm for the recursive approximation of the location $\theta$ of a maximum of a regression function was introduced by Kiefer and Wolfowitz [Ann. Math. Statist. 23 (1952) 462--466] in the univariate framework, and by Blum [Ann. Math. Statist. 25 (1954) 737--744] in the multivariate case. The aim of this paper is to provide a companion algorithm to the Kiefer--Wolfowitz--Blum algorithm, which allows one to simultaneously recursively approximate the size $\mu$ of the maximum of the regression function. A precise study of the joint weak convergence rate of both algorithms is given; it turns out that, unlike the location of the maximum, the size of the maximum can be approximated by an algorithm which converges at the parametric rate. Moreover, averaging leads to an asymptotically efficient algorithm for the approximation of the couple $(\theta,\mu)$.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

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

Rate now

     

Profile ID: LFWR-SCP-O-244902

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.