On the robust PCA and Weiszfeld's algorithm
From MaRDI portal
Publication:2019909
Abstract: Principal component analysis (PCA) is a powerful standard tool for reducing the dimensionality of data. Unfortunately, it is sensitive to outliers so that various robust PCA variants were proposed in the literature. This paper addresses the robust PCA by successively determining the directions of lines having minimal Euclidean distances from the data points. The corresponding energy functional is not differentiable at a finite number of directions which we call anchor directions. We derive a Weiszfeld-like algorithm for minimizing the energy functional which has several advantages over existing algorithms. Special attention is paid to the careful handling of the anchor directions, where we take the relation between local minima and one-sided derivatives of Lipschitz continuous functions on submanifolds of into account. Using ideas for stabilizing the classical Weiszfeld algorithm at anchor points and the Kurdyka-{L}ojasiewicz property of the energy functional, we prove global convergence of the whole sequence of iterates generated by the algorithm to a critical point of the energy functional. Numerical examples demonstrate the very good performance of our algorithm.
Recommendations
Cites work
- scientific article; zbMATH DE number 194744 (Why is no real title available?)
- scientific article; zbMATH DE number 3371284 (Why is no real title available?)
- A Majorize–Minimize Strategy for Subspace Optimization Applied to Image Restoration
- A modified Weiszfeld algorithm for the Fermat-Weber location problem
- A note on Fermat's problem
- A well-tempered landscape for non-convex robust subspace recovery
- Barycentric subspace analysis on manifolds
- Conditional gradient algorithms for rank-one matrix approximations with a sparsity constraint
- Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward-backward splitting, and regularized Gauss-Seidel methods
- Convex Analysis
- Efficient L1-Norm Principal-Component Analysis via Bit Flipping
- Fast, robust and non-convex subspace recovery
- Fréchet subdifferential calculus and optimality conditions in nondifferentiable programming
- Local convergence in Fermat's problem
- On gradients of functions definable in o-minimal structures
- On the Convergence of a Class of Iterative Methods for Solving the Weber Location Problem
- On the rotational invariant \(L_1\)-norm PCA
- On vector and matrix median computation
- Optimal Algorithms for <formula formulatype="inline"> <tex Notation="TeX">$L_{1}$</tex></formula>-subspace Signal Processing
- Optimization over geodesics for exact principal geodesic analysis
- Principal component analysis for Riemannian manifolds, with an application to triangular shape spaces
- Projection algorithms for nonconvex minimization with application to sparse principal component analysis
- Projection-Pursuit Approach to Robust Dispersion Matrices and Principal Components: Primary Theory and Monte Carlo
- Proximal Alternating Minimization and Projection Methods for Nonconvex Problems: An Approach Based on the Kurdyka-Łojasiewicz Inequality
- Robust PCA via Outlier Pursuit
- Robust Statistics
- Robust Statistics
- Robust Statistics
- Robust \(\ell_1\) approaches to computing the geometric median and principal and independent components
- Robust computation of linear models by convex relaxation
- Robust principal component analysis?
- Robust recovery of multiple subspaces by geometric \(l_{p}\) minimization
- Sample-limited \(L_p\) barycentric subspace analysis on constant curvature spaces
- Scale space and variational methods in computer vision. 6th international conference, SSVM 2017, Kolding, Denmark, June 4--8, 2017. Proceedings
- Technical note: Directional derivatives in nonsmooth optimization
- The elements of statistical learning. Data mining, inference, and prediction
- Two proposals for robust PCA using semidefinite programming
- Weiszfeld's method: old and new results
- \(l_p\)-recovery of the most significant subspace among multiple subspaces with outliers
Cited in
(4)- Robust PCA via regularized \textsc{Reaper} with a matrix-free proximal algorithm
- scientific article; zbMATH DE number 3992690 (Why is no real title available?)
- On orthogonal projections for dimension reduction and applications in augmented target loss functions for learning problems
- Robust PCA and pairs of projections in a Hilbert space
This page was built for publication: On the robust PCA and Weiszfeld's algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2019909)
