# Adapting Regularized Low Rank Models for Parallel Architectures

arXiv: https://arxiv.org/abs/1702.02241 · HTML: https://mlsanity.com/paper/1702.02241/

## Key facts

- Cited by 3 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 8 Feb 2017.

## Built on by (most cited first, 3 of 3)

- [Smooth over-parameterized solvers for non-smooth structured optimization](https://mlsanity.com/paper/2205.01385/) (2022)
- [Robust Dual-Graph Regularized Moving Object Detection](https://mlsanity.com/paper/2204.11939/) (2022)
- [Human Motion Detection Based on Dual-Graph and Weighted Nuclear Norm Regularizations](https://mlsanity.com/paper/2304.04879/) (2023)

## Abstract (arXiv)

We introduce a reformulation of regularized low-rank recovery models to take advantage of GPU, multiple CPU, and hybridized architectures. Low-rank recovery often involves nuclear-norm minimization through iterative thresholding of singular values. These models are slow to fit and difficult to parallelize because of their dependence on computing a singular value decomposition at each iteration. Regularized low-rank recovery models also incorporate non-smooth terms to separate structured components (e.g. sparse outliers) from the low-rank component, making these problems more difficult. Using Burer-Monteiro splitting and marginalization, we develop a smooth, non-convex formulation of regularized low-rank recovery models that can be fit with first-order solvers. We develop a computable certificate of convergence for this non-convex program, and use it to establish bounds on the suboptimality of any point. Using robust principal component analysis (RPCA) as an example, we include numerical experiments showing that this approach is an order-of-magnitude faster than existing RPCA solvers on the GPU. We also show that this acceleration allows new applications for RPCA, including real-time background subtraction and MR image analysis.