Guaranteed Matrix Completion Under Multiple Linear Transformations
Low-rank matrix completion (LRMC) is a classical model in both computer vision (CV) and machine learning, and has been successfully applied to various real applications. In the recent CV tasks, the completion is usually employed on the variants of data, such as "non-local" or filtered, rather than their original forms. This fact makes that the theoretical analysis of the conventional LRMC is no longer suitable in these applications. To tackle this problem, we propose a more general framework for LRMC, in which the linear transformations of the data are taken into account. We rigorously prove the identifiability of the proposed model and show an upper bound of the reconstruction error. Furthermore, we derive an efficient completion algorithm by using augmented Lagrangian multipliers and the sketching trick. In the experiments, we apply the proposed method to the classical image inpainting problem and achieve the state-of-the-art results.
Code (0)
등록된 구현이 없습니다.
Tasks
Image InpaintingLow-Rank Matrix CompletionMatrix CompletionSimilar Papers 제목 키워드 기반
Representational Transfer Learning for Matrix Completion
We propose to transfer representational knowledge from multiple sources to a target noisy matrix completion task by aggregating singular subspaces information. Under our representational similarity framework, we first in…
Matrix CompletionTransfer LearningMultiple Testing of Linear Forms for Noisy Matrix Completion
Many important tasks of large-scale recommender systems can be naturally cast as testing multiple linear forms for noisy matrix completion. These problems, however, present unique challenges because of the subtle bias-an…
Matrix CompletionRecommendation SystemsvalidTensor Methods for Nonlinear Matrix Completion
In the low-rank matrix completion (LRMC) problem, the low-rank assumption means that the columns (or rows) of the matrix to be completed are points on a low-dimensional linear algebraic variety. This paper extends this t…
Low-Rank Matrix CompletionMatrix CompletionFast Exact Matrix Completion: A Unified Optimization Framework for Matrix Completion
We formulate the problem of matrix completion with and without side information as a non-convex optimization problem. We design fastImpute based on non-convex gradient descent and show it converges to a global minimum th…
Matrix CompletionA Unified Computational and Statistical Framework for Nonconvex Low-Rank Matrix Estimation
We propose a unified framework for estimating low-rank matrices through nonconvex optimization based on gradient descent algorithm. Our framework is quite general and can be applied to both noisy and noiseless observatio…
Matrix Completion