Robust Online and Distributed Mean Estimation Under Adversarial Data Corruption
Not on the map. Why?
Abstract (arXiv)
We study robust mean estimation in an online and distributed scenario in the presence of adversarial data attacks. At each time step, each agent in a network receives a potentially corrupted data point, where the data points were originally independent and identically distributed samples of a random variable. We propose online and distributed algorithms for all agents to asymptotically estimate the mean. We provide the error-bound and the convergence properties of the estimates to the true mean under our algorithms. Based on the network topology, we further evaluate each agent's trade-off in convergence rate between incorporating data from neighbors and learning with only local observations.
Key facts. Cited by 5 papers in the map (data through 14 Oct 2026). Builds on 7 of its 17 references that are in the map. First posted on arXiv 17 Sep 2022.
Builds on
7 of 17 references.
References · 7
- 2018Byzantine-Robust Distributed Learning: Towards Optimal Statistical Ratescited by 711
- 2019Mean estimation and regression under heavy-tailed distributions--a surveycited by 136
- 2020Outlier Robust Mean Estimation with Subgaussian Rates via Stabilitycited by 50
- 2016Distributed Cooperative Decision-Making in Multiarmed Bandits: Frequentist and Bayesian Algorithmscited by 48
- 2020Cooperative Multi-Agent Bandits with Heavy Tailscited by 31
- 2019A New Approach to Distributed Hypothesis Testing and Non-Bayesian Learning: Improved Learning Rate and Byzantine-Resiliencecited by 5
- 2021Distributed Estimation of Sparse Inverse Covariancescited by 1
Built on by
Citing papers per year: 2023: 3; 2024: 0; 2025: 1; 2026: 1.
5 papers.
- 2023Byzantine-Robust Distributed Online Learning: Taming Adversarial Participants in An Adversarial Environmentcited by 8
- 2023Online Robust Mean Estimationcited by 3
- 2025Corruption-Tolerant Asynchronous Q-Learning with Near-Optimal Ratescited by 1
- 2023Robust Online Covariance and Sparse Precision Estimation Under Arbitrary Data Corruptioncited by 0
- 2026Robust Asynchronous Q-Learning under Reward and State Corruption via Batchingcited by 0
- 2026Robust Asynchronous Q-Learning under Reward and State Corruption via Batching23 Jul 2026
- 2025Corruption-Tolerant Asynchronous Q-Learning with Near-Optimal Rates10 Sep 2025
- 2023Online Robust Mean Estimation24 Oct 2023
- 2023Robust Online Covariance and Sparse Precision Estimation Under Arbitrary Data Corruption16 Sep 2023
- 2023Byzantine-Robust Distributed Online Learning: Taming Adversarial Participants in An Adversarial Environment16 Jul 2023