|
| | | | |
| | | |
| Stat |
Members: 3657
Articles: 2'599'751
Articles rated: 2609
08 October 2024 |
|
| | | | |
|
Article overview
| |
|
|
Communication-efficient distributed eigenspace estimation with arbitrary node failures | | Vasileios Charisopoulos
; Anil Damle
; | | Date: |
1 Jun 2022 | | Abstract: | We develop an eigenspace estimation algorithm for distributed environments
with arbitrary node failures, where a subset of computing nodes can return
structurally valid but otherwise arbitrarily chosen responses. Notably, this
setting encompasses several important scenarios that arise in distributed
computing and data-collection environments such as silent/soft errors, outliers
or corrupted data at certain nodes, and adversarial responses. Our estimator
builds upon and matches the performance of a recently proposed non-robust
estimator up to an additive $ ilde{O}(sigma sqrt{alpha})$ error, where
$sigma^2$ is the variance of the existing estimator and $alpha$ is the
fraction of corrupted nodes. | | Source: | arXiv, 2206.00127 | | Services: | Forum | Review | PDF | Favorites | |
|
|
No review found.
Did you like this article?
Note: answers to reviews or questions about the article must be posted in the forum section.
Authors are not allowed to review their own article. They can use the forum section.
|
| |
|
|
|
REGISTER