2 papers
stat.ML2025
Robust Distributed Estimation: Extending Gossip Algorithms to Ranking and Trimmed Means
Anna Van Elst, Igor Colin, Stephan Clémençon
This paper addresses the problem of robust estimation in gossip algorithms over arbitrary communication graphs. Gossip algorithms are fully decentralized, relying only on local nei…
stat.ML2025
Asynchronous Gossip Algorithms for Rank-Based Statistical Methods
Anna Van Elst, Igor Colin, Stephan Clémençon
As decentralized AI and edge intelligence become increasingly prevalent, ensuring robustness and trustworthiness in such distributed settings has become a critical issue-especially…