English
Related papers

Related papers: Randomized Robust Subspace Recovery for High Dimen…

200 papers

Classical methods such as Principal Component Analysis (PCA) and Canonical Correlation Analysis (CCA) are ubiquitous in statistics. However, these techniques are only able to reveal linear relationships in data. Although nonlinear variants…

Machine Learning · Statistics 2014-05-14 David Lopez-Paz , Suvrit Sra , Alex Smola , Zoubin Ghahramani , Bernhard Schölkopf

High dimensional data has introduced challenges that are difficult to address when attempting to implement classical approaches of statistical process control. This has made it a topic of interest for research due in recent years. However,…

Applications · Statistics 2019-04-23 Mohammad Nabhan , Yajun Mei , Jianjun Shi

Principal component analysis (PCA) is one of the most commonly used statistical procedures with a wide range of applications. This paper considers both minimax and adaptive estimation of the principal subspace in the high dimensional…

Statistics Theory · Mathematics 2014-01-08 T. Tony Cai , Zongming Ma , Yihong Wu

Dimensionality reduction techniques play important roles in the analysis of big data. Traditional dimensionality reduction approaches, such as principal component analysis (PCA) and linear discriminant analysis (LDA), have been studied…

Machine Learning · Computer Science 2018-05-31 Haozhe Xie , Jie Li , Hanqing Xue

The immense amount of daily generated and communicated data presents unique challenges in their processing. Clustering, the grouping of data without the presence of ground-truth labels, is an important tool for drawing inferences from data.…

Machine Learning · Statistics 2018-02-08 Panagiotis A. Traganitis , Georgios B. Giannakis

Commonly used in computer vision and other applications, robust PCA represents an algorithmic attempt to reduce the sensitivity of classical PCA to outliers. The basic idea is to learn a decomposition of some data matrix of interest into…

Computer Vision and Pattern Recognition · Computer Science 2016-10-10 Tae-Hyun Oh , Yasuyuki Matsushita , In So Kweon , David Wipf

Principal component analysis (PCA) requires the computation of a low-rank approximation to a matrix containing the data being analyzed. In many applications of PCA, the best possible accuracy of any rank-deficient approximation is at most a…

Computation · Statistics 2010-06-04 Vladimir Rokhlin , Arthur Szlam , Mark Tygert

Tensor, also known as multi-dimensional array, arises from many applications in signal processing, manufacturing processes, healthcare, among others. As one of the most popular methods in tensor literature, Robust tensor principal component…

Machine Learning · Statistics 2025-12-18 Bo Shen , Yutong Zhang , Zhenyu , Kong

We introduce a novel framework for an approxi- mate recovery of data matrices which are low-rank on graphs, from sampled measurements. The rows and columns of such matrices belong to the span of the first few eigenvectors of the graphs…

Machine Learning · Computer Science 2016-10-05 Nauman Shahid , Nathanael Perraudin , Gilles Puy , Pierre Vandergheynst

Principal Components Analysis (PCA) is one of the most widely used dimension reduction techniques. Robust PCA (RPCA) refers to the problem of PCA when the data may be corrupted by outliers. Recent work by Cand{\`e}s, Wright, Li, and Ma…

Information Theory · Computer Science 2018-08-14 Namrata Vaswani , Praneeth Narayanamurthy

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.…

Machine Learning · Statistics 2025-02-25 Sangil Han , Kyoowon Kim , Sungkyu Jung

Principal component analysis (PCA) is a key tool in the field of data dimensionality reduction. However, some applications involve heterogeneous data that vary in quality due to noise characteristics associated with each data sample.…

Machine Learning · Statistics 2026-03-18 Javier Salazar Cavazos , Jeffrey A. Fessler , Laura Balzano

Robust PCA is a widely used statistical procedure to recover a underlying low-rank matrix with grossly corrupted observations. This work considers the problem of robust PCA as a nonconvex optimization problem on the manifold of low-rank…

Machine Learning · Statistics 2017-09-04 Teng Zhang , Yi Yang

Principal Component Analysis (PCA) is a very successful dimensionality reduction technique, widely used in predictive modeling. A key factor in its widespread use in this domain is the fact that the projection of a dataset onto its first…

Machine Learning · Statistics 2017-05-19 Xianghui Luo , Robert J. Durrant

We consider the problem of recovering an $n_1 \times n_2$ low-rank matrix with $k$-sparse singular vectors from a small number of linear measurements (sketch). We propose a sketching scheme and an algorithm that can recover the singular…

Information Theory · Computer Science 2024-07-02 Xiaoqi Liu , Ramji Venkataramanan

Principal Component Analysis (PCA) finds a linear mapping and maximizes the variance of the data which makes PCA sensitive to outliers and may cause wrong eigendirection. In this paper, we propose techniques to solve this problem; we use…

Artificial Intelligence · Computer Science 2012-07-03 Peratham Wiriyathammabhum , Boonserm Kijsirikul

Robust principal component analysis (RPCA) can recover low-rank matrices when they are corrupted by sparse noises. In practice, many matrices are, however, of high-rank and hence cannot be recovered by RPCA. We propose a novel method called…

Machine Learning · Computer Science 2019-04-19 Jicong Fan , Tommy W. S. Chow

Principal Components Regression (PCR) is a traditional tool for dimension reduction in linear regression that has been both criticized and defended. One concern about PCR is that obtaining the leading principal components tends to be…

Statistics Theory · Mathematics 2017-10-10 Martin Slawski

Principal component analysis (PCA) is a classical dimension reduction method which projects data onto the principal subspace spanned by the leading eigenvectors of the covariance matrix. However, it behaves poorly when the number of…

Statistics Theory · Mathematics 2013-05-27 Zongming Ma

We study the basic problem of robust subspace recovery. That is, we assume a data set that some of its points are sampled around a fixed subspace and the rest of them are spread in the whole ambient space, and we aim to recover the fixed…

Machine Learning · Statistics 2015-03-19 Teng Zhang , Gilad Lerman