Abstract
The almost sure convergence of stochastic approximation algorithms under general noise and stability conditions is considered in this paper. First, the stochastic approximation algorithm with additive, state-dependent noise is analyzed and sufficient conditions for its convergence are derived. Then, the algorithm with nonadditive noise is examined and sufficient conditions for its convergence are obtained using the results obtained for the additive noise case. The convergence of the algorithm with nonadditive noise is considered for the case where the noise is correlated and satisfies the strong or uniform mixing property. Finally, the results derived for the nonadditive noise case are applied to the analysis of the gradient based learning algorithm for feedforward neural networks and sufficient conditions for its convergence are derived.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
