Browse > Methodology > Matrix Completion > Low-Rank Matrix Completion

Low-Rank Matrix Completion

6 papers with code · Methodology
Subtask of Matrix Completion

Leaderboards

No evaluation results yet. Help compare methods by submit evaluation metrics.

Latest papers with code

Provable Subspace Tracking from Missing Data and Matrix Completion

6 Oct 2018vdaneshpajooh/NORST-rmc

In this work, we show that a simple modification of our robust ST solution also provably solves ST-miss and robust ST-miss.

LOW-RANK MATRIX COMPLETION

1
06 Oct 2018

Riemannian stochastic variance reduced gradient algorithm with retraction and vector transport

18 Feb 2017hiroyuki-kasai/RSOpt

In recent years, stochastic variance reduction algorithms have attracted considerable attention for minimizing the average of a large but finite number of loss functions.

LOW-RANK MATRIX COMPLETION

19
18 Feb 2017

Depth Image Inpainting: Improving Low Rank Matrix Completion with Low Gradient Regularization

20 Apr 2016xuehy/depthInpainting

The proposed low gradient regularization is integrated with the low rank regularization into the low rank low gradient approach for depth image inpainting.

IMAGE INPAINTING LOW-RANK MATRIX COMPLETION

17
20 Apr 2016

Collaborative Filtering with Graph Information: Consistency and Scalable Methods

NeurIPS 2015 rofuyu/exp-grmf-nips15

Low rank matrix completion plays a fundamental role in collaborative filtering applications, the key idea being that the variables lie in a smaller subspace than the ambient space.

 SOTA for Collaborative Filtering on Flixster (using extra training data)

COLLABORATIVE FILTERING LOW-RANK MATRIX COMPLETION

4
01 Dec 2015

A Gradient Descent Algorithm on the Grassman Manifold for Matrix Completion

27 Oct 2009strin/pyOptSpace

We consider the problem of reconstructing a low-rank matrix from a small subset of its entries.

COLLABORATIVE FILTERING LOW-RANK MATRIX COMPLETION

1
27 Oct 2009