The ``component debiasing method in distributed Byzantine problems
From MaRDI portal
The ``component debiasing'' method in distributed Byzantine problems
Cites work
- A distributed one-step estimator
- A review of distributed statistical inference
- Communication-efficient algorithms for statistical optimization
- Distributed feature screening via componentwise debiasing
- Distributed statistical estimation and rates of convergence in normal approximation
- Dual Averaging for Distributed Optimization: Convergence Analysis and Network Scaling
- Geometric median and robust estimation in Banach spaces
- scientific article; zbMATH DE number 62513 (Why is no real title available?)
- Invariance principles for U-statistics and von Mises functionals
- On the optimality of averaging in distributed statistical learning
- On U-statistics and v. mise? statistics for weakly dependent processes
- Probability Inequalities for Sums of Bounded Random Variables
- Statistical inference in massive data sets
- The Byzantine Generals Problem
- The space complexity of approximating the frequency moments
This page was built for publication: The ``component debiasing method in distributed Byzantine problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6864284)