A Note on Alternating Minimization Algorithm for the Matrix Completion Problem

02/05/2016
by   David Gamarnik, et al.
0

We consider the problem of reconstructing a low rank matrix from a subset of its entries and analyze two variants of the so-called Alternating Minimization algorithm, which has been proposed in the past. We establish that when the underlying matrix has rank r=1, has positive bounded entries, and the graph G underlying the revealed entries has bounded degree and diameter which is at most logarithmic in the size of the matrix, both algorithms succeed in reconstructing the matrix approximately in polynomial time starting from an arbitrary initialization. We further provide simulation results which suggest that the second algorithm which is based on the message passing type updates, performs significantly better.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
08/11/2020

Asymptotic Convergence Rate of Alternating Minimization for Rank One Matrix Completion

We study alternating minimization for matrix completion in the simplest ...
research
10/23/2020

Adversarial Crowdsourcing Through Robust Rank-One Matrix Completion

We consider the problem of reconstructing a rank-one matrix from a revea...
research
12/03/2013

Understanding Alternating Minimization for Matrix Completion

Alternating Minimization is a widely used and empirically successful heu...
research
02/08/2017

Matrix Completion from O(n) Samples in Linear Time

We consider the problem of reconstructing a rank-k n × n matrix M from a...
research
12/14/2022

Equivalence of Approximate Message Passing and Low-Degree Polynomials in Rank-One Matrix Estimation

We consider the problem of estimating an unknown parameter vector θ∈ℝ^n,...
research
06/10/2015

Matrix Completion from Fewer Entries: Spectral Detectability and Rank Estimation

The completion of low rank matrices from few entries is a task with many...
research
11/10/2013

Learning Gaussian Graphical Models with Observed or Latent FVSs

Gaussian Graphical Models (GGMs) or Gauss Markov random fields are widel...

Please sign up or login with your details

Forgot password? Click here to reset