Online high rank matrix completion

02/20/2020
by   Jicong Fan, et al.
0

Recent advances in matrix completion enable data imputation in full-rank matrices by exploiting low dimensional (nonlinear) latent structure. In this paper, we develop a new model for high rank matrix completion (HRMC), together with batch and online methods to fit the model and out-of-sample extension to complete new data. The method works by (implicitly) mapping the data into a high dimensional polynomial feature space using the kernel trick; importantly, the data occupies a low dimensional subspace in this feature space, even when the original data matrix is of full-rank. We introduce an explicit parametrization of this low dimensional subspace, and an online fitting procedure, to reduce computational complexity compared to the state of the art. The online method can also handle streaming or sequential data and adapt to non-stationary latent structure. We provide guidance on the sampling rate required these methods to succeed. Experimental results on synthetic data and motion capture data validate the performance of the proposed methods.

READ FULL TEXT
research
12/15/2019

Polynomial Matrix Completion for Missing Data Imputation and Transductive Learning

This paper develops new methods to recover the missing entries of a high...
research
03/28/2017

Algebraic Variety Models for High-Rank Matrix Completion

We consider a generalization of low-rank matrix completion to the case w...
research
04/26/2018

Tensor Methods for Nonlinear Matrix Completion

In the low rank matrix completion (LRMC) problem, the low rank assumptio...
research
08/02/2018

Fusion Subspace Clustering: Full and Incomplete Data

Modern inference and learning often hinge on identifying low-dimensional...
research
09/26/2013

Online Algorithms for Factorization-Based Structure from Motion

We present a family of online algorithms for real-time factorization-bas...
research
11/06/2015

An Extended Frank-Wolfe Method with "In-Face" Directions, and its Application to Low-Rank Matrix Completion

Motivated principally by the low-rank matrix completion problem, we pres...
research
03/29/2016

Unified View of Matrix Completion under General Structural Constraints

In this paper, we present a unified analysis of matrix completion under ...

Please sign up or login with your details

Forgot password? Click here to reset