Title :
Gossip with transmission constraints
Author :
Borkar, Vivek S. ; Makhijani, R. ; Sundaresan, R.
Author_Institution :
Dept. of Electr. Eng., IIT Bombay, Mumbai, India
Abstract :
We consider an asynchronous stochastic approximation version of the classical gossip algorithm wherein the inter-processor communication is subject to transmission delays. We highlight some fundamental difficulties associated with it and suggest an alternative scheme based on reinforcement learning.
Keywords :
approximation theory; delays; learning (artificial intelligence); telecommunication computing; asynchronous stochastic approximation; classical gossip algorithm; inter-processor communication; reinforcement learning; transmission constraints; transmission delays; Approximation methods; Convergence; Delays; Monte Carlo methods; Noise; Noise measurement; Stochastic processes;
Conference_Titel :
Information Theory and Applications Workshop (ITA), 2013
Conference_Location :
San Diego, CA
Print_ISBN :
978-1-4673-4648-1
DOI :
10.1109/ITA.2013.6502936
