Riemannian CUR Decompositions for Robust Principal Component Analysis
원문 초록
Robust Principal Component Analysis (PCA) has received massive attention in recent years. It aims to recover a low-rank matrix and a sparse matrix from their sum. This paper proposes a novel nonconvex Robust PCA algorithm, coined Riemannian CUR (RieCUR), which utilizes the ideas of Riemannian optimization and robust CUR decompositions. This algorithm has the same computational complexity as Iterated Robust CUR, which is currently state-of-the-art, but is more robust to outliers. RieCUR is also able to tolerate a significant amount of outliers, and is comparable to Accelerated Alternating Projections, which has high outlier tolerance but worse computational complexity than the proposed method. Thus, the proposed algorithm achieves state-of-the-art performance on Robust PCA both in terms of computational complexity and outlier tolerance.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
Efficient Optimization with Orthogonality Constraint: a Randomized Riemannian Submanifold Method
Riemannian Optimization on Relaxed Indicator Matrix Manifold
Causal Abstraction Learning based on the Semantic Embedding Principle
A Spectral Framework for Tracking Communities in Evolving Networks
Elliptical Wishart distributions: information geometry, maximum likelihood estimator, performance analysis and statistical learning
The Gaussian Discriminant Variational Autoencoder (GdVAE): A Self-Explainable Model with Counterfactual Explanations
토론
이 논문과 연결된 포럼 글이 아직 없습니다.