paper-with-me

홈 › Papers

Scale-Calibrated Median-of-Means for Robust Distributed Principal Component Analysis

2026-05-20 · Kisung You arxiv

Distributed principal component analysis (PCA) produces node-level estimates of both a mean vector and a principal subspace. Robustly aggregating these heterogeneous objects requires a relative scale between mean error and subspace error. We study a scale-calibrated median-of-means estimator for this problem using the product geometry of Euclidean space and the Grassmann manifold. A node-level PCA expansion shows that the mean component has the usual linear influence, whereas the subspace component is an eigengap-weighted covariance perturbation. We prove a local reduction showing that the proposed product-manifold median-of-means estimator is asymptotically equivalent to a scaled spatial median of node influence errors. This yields fixed-node non-Gaussian limits, growing-node Gaussian limits with finite-block bias, and an explicit scale-dependent covariance formula. We propose robust block-scale and inference-optimal calibration rules, establish high-probability median-of-means bounds, characterize factorwise bad-node influence, and prove node-bootstrap validity. Simulations and large-scale single-cell RNA-seq data show that scale calibration adapts to eigengap-driven subspace uncertainty and provides a robust distributed PCA summary.

📄 PDF Abstract BibTeX arXiv:2605.20681

Code (0)

등록된 구현이 없습니다.

Similar Papers 제목 키워드 기반

Distributed k-Means and k-Median Clustering on General Topologies

2013-06-03 · NeurIPS 2013 12 · Maria Florina Balcan, Steven Ehrlich, YIngyu Liang

This paper provides new algorithms for distributed clustering for two popular center-based objectives, k-median and k-means. These algorithms have provable guarantees and improve communication complexity over existing ap…

Clustering

Variance Reduced Median-of-Means Estimator for Byzantine-Robust Distributed Inference

2021-03-04 · Jiyuan Tu, Weidong Liu, Xiaojun Mao, Xi Chen

This paper develops an efficient distributed inference algorithm, which is robust against a moderate fraction of Byzantine nodes, namely arbitrary and possibly adversarial machines in a distributed learning system. In ro…

Computational Efficiency

Distributed $k$-Clustering for Data with Heavy Noise

2018-10-18 · NeurIPS 2018 · Xiangyu Guo, Shi Li

In this paper, we consider the $k$-center/median/means clustering with outliers problems (or the $(k, z)$-center/median/means problems) in the distributed setting. Most previous distributed algorithms have their communic…

Clustering

Distributed k-Clustering for Data with Heavy Noise

2018-12-01 · NeurIPS 2018 12 · Shi Li, Xiangyu Guo

In this paper, we consider the $k$-center/median/means clustering with outliers problems (or the $(k, z)$-center/median/means problems) in the distributed setting. Most previous distributed algorithms have their communi…

Clustering

Robust Communication-Optimal Distributed Clustering Algorithms

2017-03-02 · Pranjal Awasthi, Ainesh Bakshi, Maria-Florina Balcan, Colin White 외

In this work, we study the $k$-median and $k$-means clustering problems when the data is distributed across many servers and can contain outliers. While there has been a lot of work on these problems for worst-case insta…

Clustering