Asynchronous gossip algorithms for stochastic optimization

  title={Asynchronous gossip algorithms for stochastic optimization},
  author={S. Sundhar Ram and Angelia Nedic and Venugopal V. Veeravalli},
  journal={2009 International Conference on Game Theory for Networks},
We consider a distributed multi-agent network system where the goal is to minimize an objective function that can be written as the sum of component functions, each of which is known (with stochastic errors) to a specific network agent. We propose an asynchronous algorithm that is motivated by a random gossip scheme where each agent has a local Poisson clock. At each tick of its local clock, the agent averages its estimate with a randomly chosen neighbor and adjusts the average using the… CONTINUE READING
Highly Cited
This paper has 89 citations. REVIEW CITATIONS


Publications citing this paper.
Showing 1-10 of 57 extracted citations

A fixed-time optimal consensus algorithm over undirected networks

2018 Chinese Control And Decision Conference (CCDC) • 2018
View 1 Excerpt

89 Citations

Citations per Year
Semantic Scholar estimates that this publication has 89 citations based on the available data.

See our FAQ for additional information.


Publications referenced by this paper.
Showing 1-10 of 30 references

Randomized gossip algorithms

IEEE Transactions on Information Theory • 2006
View 4 Excerpts
Highly Influenced

Sensor networks: When theory meets practice

S. Sundhar Ram, V. V. Veeravali, A. Nedić
ch. Distributed and recursive estimation, Springer • 2009
View 4 Excerpts

Stochastic quasigradient methods

Encyclopedia of Optimization • 2009

Similar Papers

Loading similar papers…