Asynchronous Stochastic Approximation and Q-Learning 2: Asynchronous Stochastic Approximation with Outdated Information Converges with Probability 1 Under a Weighted Maximum Norm ContractionResearch Paper
Many iterative algorithms update only part of a vector at a time. In a parallel implementation, one processor may read a value written several rounds earlier by another processor. Random observations also perturb each update. John N. Tsitsiklis's 1994 paper gives conditions under which such an asynchronous stochastic iteration still converges. The paper…