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.
Publisher
Cambridge University Press (CUP)
Subject
Applied Mathematics,Computational Theory and Mathematics,Statistics and Probability,Theoretical Computer Science
Cited by
12 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献