Matrix Completion under Interval Uncertainty

08/11/2014
by   Jakub Marecek, et al.
0

Matrix completion under interval uncertainty can be cast as matrix completion with element-wise box constraints. We present an efficient alternating-direction parallel coordinate-descent method for the problem. We show that the method outperforms any other known method on a benchmark in image in-painting in terms of signal-to-noise ratio, and that it provides high-quality solutions for an instance of collaborative filtering with 100,198,805 recommendations within 5 minutes.

READ FULL TEXT

page 13

page 15

research
05/10/2016

A note on the statistical view of matrix completion

A very simple interpretation of matrix completion problem is introduced ...
research
02/28/2019

Multilspectral snapshot demosaicing via non-convex matrix completion

Snapshot mosaic multispectral imagery acquires an undersampled data cube...
research
01/08/2020

Nonlinear Traffic Prediction as a Matrix Completion Problem with Ensemble Learning

We focus on short-term traffic forecasting for traffic operations manage...
research
10/02/2021

One-Bit Matrix Completion with Differential Privacy

Matrix completion is a prevailing collaborative filtering method for rec...
research
03/29/2020

Nonconvex Matrix Completion with Linearly Parameterized Factors

Techniques of matrix completion aim to impute a large portion of missing...
research
02/12/2020

Finiteness of fibers in matrix completion via Plücker coordinates

Let Ω⊆{1,...,m}×{1,...,n}. We consider fibers of coordinate projections ...
research
03/19/2019

State-Building through Public Land Disposal? An Application of Matrix Completion for Counterfactual Prediction

How would the frontier have evolved in the absence of homestead policies...

Please sign up or login with your details

Forgot password? Click here to reset