𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Improved results on the robustness of stochastic approximation algorithms

✍ Scribed by Aijun Gao; Hanfu (Han-fu Chen) Chen; Yunmin Zhu

Publisher
Institute of Applied Mathematics, Chinese Academy of Sciences and Chinese Mathematical Society
Year
1992
Tongue
English
Weight
334 KB
Volume
8
Category
Article
ISSN
0168-9673

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Analysis of robust stochastic approximat
Analysis of robust stochastic approximation algorithms for process identification
✍ Srdjan S. StankoviΔ‡; Branko D. KovačeviΔ‡ πŸ“‚ Article πŸ“… 1986 πŸ› Elsevier Science 🌐 English βš– 534 KB

An analysis of robust recursive algorithms for dynamic system identification is presented. Problems related to the construction of optimal stochastic approximation algorithms in the min-max sense are demonstrated. Starting from the definition of one class of robustified recursive identification algo

Further results on almost sure convergen
Further results on almost sure convergence of the stochastic gradient algorithm
✍ Miloje S. Radenkovic πŸ“‚ Article πŸ“… 1999 πŸ› John Wiley and Sons 🌐 English βš– 151 KB πŸ‘ 2 views

In this paper, we consider the rate of convergence of the parameter estimation error and the cost function for the stochastic gradient-type algorithm. The problem is solved in the case of the minimum-variance stochastic adaptive control. It is proven that the cost function has the rate of convergenc