Computing Robust Principal Components by A* Search

Principal Component Analysis (PCA) is a classical dimensionality reduction technique that computes a low rank representation of the data. Recent studies have shown how to compute this low rank representation from most of the data, excluding a small amount of outlier data. We describe an algorithm that solves this problem by applying a variant of the A* algorithm to search for the outliers. The results obtained by our algorithm are optimal, and more accurate than the current state of the art. This comes at the cost of running time, which is typically slower than the current state of the art. We also describe a related variant of the A* algorithm that runs much faster and produces a solution that is guaranteed to be near the optimal.

[1]  Yi Ma,et al.  Robust principal component analysis? , 2009, JACM.

[2]  V. Kshirsagar,et al.  Face recognition using Eigenfaces , 2011, 2011 3rd International Conference on Computer Research and Development.

[3]  Edward Y. Chang,et al.  Exact Recoverability of Robust PCA via Outlier Pursuit with Tight Recovery Bounds , 2015, AAAI.

[4]  Nils J. Nilsson,et al.  A Formal Basis for the Heuristic Determination of Minimum Cost Paths , 1968, IEEE Trans. Syst. Sci. Cybern..

[5]  David J. Kriegman,et al.  The yale face database , 1997 .

[6]  Gene H. Golub,et al.  Some modified matrix eigenvalue problems , 1973, Milestones in Matrix Computation.

[7]  R. Welsch,et al.  The Hat Matrix in Regression and ANOVA , 1978 .

[8]  William H. Press,et al.  Numerical recipes: the art of scientific computing, 3rd Edition , 2007 .

[9]  Aaron Melman,et al.  Analysis of third-order methods for secular equations , 1998, Math. Comput..

[10]  George Atia,et al.  Coherence Pursuit: Fast, Simple, and Robust Principal Component Analysis , 2016, IEEE Transactions on Signal Processing.

[11]  Ke Xu,et al.  Unsupervised Feature Selection by Heuristic Search with Provable Bounds on Suboptimality , 2016, AAAI.

[12]  Carlos F. Borges,et al.  A Parallel Divide and Conquer Algorithm for the Generalized Real Symmetric Definite Tridiagonal Eigenproblem , 1993 .

[13]  S. Chatterjee,et al.  Influential Observations, High Leverage Points, and Outliers in Linear Regression , 1986 .

[14]  Hiroshi Murase,et al.  Visual learning and recognition of 3-d objects from appearance , 2005, International Journal of Computer Vision.

[15]  Dario Bini,et al.  Journal of Computational and Applied Mathematics Solving secular and polynomial equations: A multiprecision algorithm , 2022 .

[16]  Constantine Caramanis,et al.  Robust PCA via Outlier Pursuit , 2010, IEEE Transactions on Information Theory.

[17]  Yonina C. Eldar,et al.  Simultaneously Structured Models With Application to Sparse and Low-Rank Matrices , 2012, IEEE Transactions on Information Theory.

[18]  Haim Schweitzer,et al.  Optimal Column Subset Selection by A-Star Search , 2015, AAAI.

[19]  J. Bunch,et al.  Rank-one modification of the symmetric eigenproblem , 1978 .

[20]  Jesfis Peral,et al.  Heuristics -- intelligent search strategies for computer problem solving , 1984 .

[21]  Soon Ki Jung,et al.  Decomposition into Low-rank plus Additive Matrices for Background/Foreground Separation: A Review for a Comparative Evaluation with a Large-Scale Dataset , 2015, Comput. Sci. Rev..