Fast Exact Matrix Completion: A Unifying Optimization Framework

10/21/2019

∙

We consider the problem of matrix completion of rank k on an n× m matrix. We show that both the general case and the case with side information can be formulated as a combinatorical problem of selecting k vectors from p column features. We demonstrate that it is equivalent to a separable optimization problem that is amenable to stochastic gradient descent. We design fastImpute, based on projected stochastic gradient descent, to enable efficient scaling of the algorithm of sizes of 10^5 × 10^5. We report experiments on both synthetic and real-world datasets that show fastImpute is competitive in both the accuracy of the matrix recovered and the time needed across all cases. Furthermore, when a high number of entries are missing, fastImpute is over 75% lower in MAPE and 10x faster than current state-of-the-art matrix completion methods in both the case with side information and without.

READ FULL TEXT

Fast Exact Matrix Completion: A Unifying Optimization Framework

Interpretable Matrix Completion: A Discrete Optimization Approach

Convergence Analysis for Rectangular Matrix Completion Using Burer-Monteiro Factorization and Gradient Descent

Matrix completion and extrapolation via kernel regression

Gradient Descent for Sparse Rank-One Matrix Completion for Crowd-Sourced Aggregation of Sparsely Interacting Workers

A Novel Approach to Quantized Matrix Completion Using Huber Loss Measure

Accelerated Stochastic Gradient for Nonnegative Tensor Completion and Parallel Implementation

Fully Distributed and Asynchronized Stochastic Gradient Descent for Networked Systems

Fast Exact Matrix Completion: A Unifying Optimization Framework

Related Research

Interpretable Matrix Completion: A Discrete Optimization Approach

Convergence Analysis for Rectangular Matrix Completion Using Burer-Monteiro Factorization and Gradient Descent

Matrix completion and extrapolation via kernel regression

Gradient Descent for Sparse Rank-One Matrix Completion for Crowd-Sourced Aggregation of Sparsely Interacting Workers

A Novel Approach to Quantized Matrix Completion Using Huber Loss Measure

Accelerated Stochastic Gradient for Nonnegative Tensor Completion and Parallel Implementation

Fully Distributed and Asynchronized Stochastic Gradient Descent for Networked Systems