DeepAI AI Chat
Log In Sign Up

Regularized Weighted Low Rank Approximation

by   Frank Ban, et al.
Carnegie Mellon University
berkeley college

The classical low rank approximation problem is to find a rank k matrix UV (where U has k columns and V has k rows) that minimizes the Frobenius norm of A - UV. Although this problem can be solved efficiently, we study an NP-hard variant of this problem that involves weights and regularization. A previous paper of [Razenshteyn et al. '16] derived a polynomial time algorithm for weighted low rank approximation with constant rank. We derive provably sharper guarantees for the regularized version by obtaining parameterized complexity bounds in terms of the statistical dimension rather than the rank, allowing for a rank-independent runtime that can be significantly faster. Our improvement comes from applying sharper matrix concentration bounds, using a novel conditioning technique, and proving structural theorems for regularized low rank problems.


page 1

page 2

page 3

page 4


Approximation Algorithms for ℓ_0-Low Rank Approximation

We study the ℓ_0-Low Rank Approximation Problem, where the goal is, give...

Concentration-Based Guarantees for Low-Rank Matrix Reconstruction

We consider the problem of approximately reconstructing a partially-obse...

On Approximation Guarantees for Greedy Low Rank Optimization

We provide new approximation guarantees for greedy low rank matrix estim...

Optimal Analysis of Subset-Selection Based L_p Low Rank Approximation

We study the low rank approximation problem of any given matrix A over R...

Classical Algorithms from Quantum and Arthur-Merlin Communication Protocols

The polynomial method from circuit complexity has been applied to severa...

Weighted Low Rank Matrix Approximation and Acceleration

Low-rank matrix approximation is one of the central concepts in machine ...

Near-Optimal Algorithms for Linear Algebra in the Current Matrix Multiplication Time

Currently, in the numerical linear algebra community, it is thought that...