By Topic

On parallel processing approach to adaptive stochastic estimations

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Yin, G. ; Dept. of Math., Wayne State Univ., Detroit, MI, USA ; Zhu, Y.M.

With the main motivation of improving asymptotic properties, and with reference to the recent developments on parallel stochastic approximation methods, a novel approach to adaptive Robbins-Monro stochastic approximation algorithms (1951) is developed. The authors take a previously developed algorithm as their point of departure and suggest a convex combination approach. The essence of this approach is that in lieu of using a single observer, a collection of observers which operate in parallel is used to estimate the same system. At any time, all observers take the same point of observation with possibly different noise processes. An approximation sequence Zn is formed by taking convex combination of all the processors. A consistent procedure for constructing the best convex combination sequences is given. The proposed algorithm is proved to be asymptotically more efficient than previous approaches

Published in:

Decision and Control, 1988., Proceedings of the 27th IEEE Conference on

Date of Conference:

7-9 Dec 1988