DeepAI AI Chat
Log In Sign Up

Fast Computation of Robust Subspace Estimators

by   Holger Cevallos Valdiviezo, et al.

Dimension reduction is often an important step in the analysis of high-dimensional data. PCA is a popular technique to find the best low-dimensional approximation of high-dimensional data. However, classical PCA is very sensitive to atypical data. Robust methods to estimate the low-dimensional subspace that best approximates the regular data have been proposed by Maronna (2005). However, for high-dimensional data his algorithms become computationally expensive. Alternative algorithms for the robust subspace estimators are proposed that are better suited to compute the solution for high-dimensional problems. The main ingredients of the new algorithms are twofold. First, the principal directions of the subspace are estimated directly by iterating the estimating equations corresponding to the estimators. Second, to reduce computation time even further five robust deterministic values are proposed to initialize the algorithms instead of using random starting values. It is shown that the new algorithms yield robust solutions and the computation time is largely reduced, especially for high-dimensional data.


Subspace clustering of high-dimensional data: a predictive approach

In several application domains, high-dimensional observations are collec...

Randomized Robust Subspace Recovery for High Dimensional Data Matrices

This paper explores and analyzes two randomized designs for robust Princ...

Quantum-inspired canonical correlation analysis for exponentially large dimensional data

Canonical correlation analysis (CCA) is a technique to find statistical ...

Probabilistic methods for approximate archetypal analysis

Archetypal analysis is an unsupervised learning method for exploratory d...

Fast Binary Embedding via Circulant Downsampled Matrix -- A Data-Independent Approach

Binary embedding of high-dimensional data aims to produce low-dimensiona...

Linearly-scalable learning of smooth low-dimensional patterns with permutation-aided entropic dimension reduction

In many data science applications, the objective is to extract appropria...

Subspace Shapes: Enhancing High-Dimensional Subspace Structures via Ambient Occlusion Shading

We test the hypothesis whether transforming a data matrix into a 3D shad...