mlsanityData to 14 Oct 2026

Subspace Recovery in Winsorized PCA: Insights into Accuracy and Robustness

arXiv 2502.16391 ↗First posted 23 Feb 2025stat.ML cs.LG stat.APcited by 0

Not on the map. Why?

Abstract (arXiv)

In this paper, we explore the theoretical properties of subspace recovery using Winsorized Principal Component Analysis (WPCA), utilizing a common data transformation technique that caps extreme values to mitigate the impact of outliers. Despite the widespread use of winsorization in various tasks of multivariate analysis, its theoretical properties, particularly for subspace recovery, have received limited attention. We provide a detailed analysis of the accuracy of WPCA, showing that increasing the number of samples while decreasing the proportion of outliers guarantees the consistency of the sample subspaces from WPCA with respect to the true population subspace. Furthermore, we establish perturbation bounds that ensure the WPCA subspace obtained from contaminated data remains close to the subspace recovered from pure data. Additionally, we extend the classical notion of breakdown points to subspace-valued statistics and derive lower bounds for the breakdown points of WPCA. Our analysis demonstrates that WPCA exhibits strong robustness to outliers while maintaining consistency under mild assumptions. A toy example is provided to numerically illustrate the behavior of the upper bounds for perturbation bounds and breakdown points, emphasizing winsorization's utility in subspace recovery.

Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 14 of its 47 references that are in the map. First posted on arXiv 23 Feb 2025.

Builds on

14 of 47 references.

References · 14

  1. 2016Deep Learning with Differential Privacycited by 2,728
  2. 2017Finite Sample Differentially Private Confidence Intervalscited by 104
  3. 2016Global Optimality of Local Search for Low Rank Matrix Recoverycited by 82
  4. 2020CoinPress: Practical Private Mean and Covariance Estimationcited by 74
  5. 2015Randomized Block Krylov Methods for Stronger and Faster Approximate Singular Value Decompositioncited by 64
  6. 2016Rate-Optimal Perturbation Bounds for Singular Subspaces with Applications to High-Dimensional Statisticscited by 45
  7. 2018Heteroskedastic PCA: Algorithm, Optimality, and Applicationscited by 34
  8. 2019Differentially Private Algorithms for Learning Mixtures of Separated Gaussianscited by 27
  9. 2016LazySVD: Even Faster SVD Decomposition Yet Without Agonizing Paincited by 22
  10. 2022Subspace Recovery from Heterogeneous Data with Non-isotropic Noisecited by 14
  11. 2024Optimal Differentially Private PCA and Estimation for Spiked Covariance Matricescited by 11
  12. 2024Robust SVD Made Easy: A fast and reliable algorithm for large-scale data analysiscited by 4
2 more
  1. 2023Generalized Spherical Principal Component Analysiscited by 3
  2. 2018A generalized spatial sign covariance matrixcited by 2

Built on by

Not cited yet.