Abstract
For a stochastic approximation-type recursion with finitely many possible limit points, we find a lower bound on the probability of converging to a prescribed point in its ‘domain of attraction’. This has implications for the lock-in phenomena in the stochastic models of increasing return economics and the sample complexity of stochastic approximation algorithms in engineering.
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.
