AI Paper Atlas

Research map / Learning theory and algorithms / Sample complexity

Communication-efficient distributed eigenspace estimation with arbitrary node failures

Vasileios Charisopoulos, Anil Damle

NeurIPS 2022 · Learning theory and algorithms › Sample complexity · approach: Distributed estimation under communication limits · 0 citations (OpenAlex)

Read the paperCheck your idea against 137,217 papers

AI-extracted. The measured effects below were read by AI from the paper's full text (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Measured effects reported in the paper

What was changedWhereMeasuredEffect
Use a robust reference estimator and adaptive filtering instead of the first response as reference followed by naive averagingDistributed PCA · Gaussian simulation with adversarial node responsessubspace distanceImproved
Add robust mean estimation after Procrustes alignment (ablation)ProcrustesFixing · Gaussian simulation with adversarial node responsessubspace distanceImproved
Use the proposed robust estimator with corruption level up to 45%Distributed PCA · Gaussian simulation with adversarial node responsessubspace distanceImproved

Closest papers by meaning

Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy