Emergent Mind
A Note on Stability in Asynchronous Stochastic Approximation without Communication Delays
(2312.15091)
Published Dec 22, 2023
in
cs.LG
and
math.OC
Abstract
In this paper, we study asynchronous stochastic approximation algorithms without communication delays. Our main contribution is a stability proof for these algorithms that extends a method of Borkar and Meyn by accommodating more general noise conditions. We also derive convergence results from this stability result and discuss their application in important average-reward reinforcement learning problems.
We're not able to analyze this paper right now due to high demand.
Please check back later (sorry!).
Generate a summary of this paper on our Pro plan:
We ran into a problem analyzing this paper.