Gossip Algorithms for Computing U-statistics

By K. Pelckmans, Johan A. K. Suykens. 2009

11 citations recorded by the source corpus.

Subfields: Computer Networks and Communications, Sociology and Political Science, Statistical and Nonlinear Physics

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Computer Networks and Communications

1. Aurélien Bellet
2. Joseph Salmon
3. Stéphan Clemencon
4. Igor Colin
5. Marc Tommasi
6. Paul Vanhaesebrouck
7. Hanlin Tang
8. Ji Liu

In Sociology and Political Science

1. Aurélien Bellet

In Statistical and Nonlinear Physics

1. Aurélien Bellet

Citations in the corpus

• Gossip Dual Averaging for Decentralized Optimization of Pairwise Functions (2016, neutral): “To go around this problem, we rely on a gossip data propagation step (Pelckmans & Suykens, 2009; Colin et al., 2015) so that the nodes are able to compute biased estimates of ∇ f i ( · ) while keeping the communication and memory overhead to a small level for each node.”
• Extending Gossip Algorithms to Distributed Estimation of U-statistics (2015, background): “To estimate Ûn(H), U2-gossip [17] does not use averaging.”