Adversarially-Robust Gossip Algorithms for Approximate Quantile and Mean Computations

Bernhard Haeupler, Marc Kaufmann, Raghu Raman Ravi +1

This paper presents gossip algorithms for aggregation tasks that demonstrate both robustness to adversarial corruptions of any order of magnitude and optimality across a substantia…