Abstract
In this paper, we are interested in the almost sure convergence of randomly truncated stochastic algorithms. In their pioneering work Chen and Zhu [Chen, H., Zhu, Y., 1986. Stochastic Approximation Procedure with Randomly Varying Truncations. In: Scientia Sinica Series.] required that the family of the noise terms is summable to ensure the convergence. In our paper, we present a new convergence theorem which extends the already known results by making vanish this condition on the noise terms — a condition which is quite hard to check in practice. The aim of this work is to prove an almost sure convergence result for randomly truncated stochastic algorithms under assumptions expressed independently of the algorithm paths so that the conditions can easily be verified in practical applications.
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.
