Distributed Reinforcement Learning via Gossip

From MaRDI portal




Abstract: We consider the classical TD(0) algorithm implemented on a network of agents wherein the agents also incorporate the updates received from neighboring agents using a gossip-like mechanism. The combined scheme is shown to converge for both discounted and average cost problems.












This page was built for publication: Distributed Reinforcement Learning via Gossip

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5282396)