Asymptotic Convergence Rate of Alternating Minimization for Rank One Matrix Completion

08/11/2020
by   Rui Liu, et al.
12

We study alternating minimization for matrix completion in the simplest possible setting: completing a rank-one matrix from a revealed subset of the entries. We bound the asymptotic convergence rate by the variational characterization of eigenvalues of a reversible consensus problem. This leads to a polynomial upper bound on the asymptotic rate in terms of number of nodes as well as the largest degree of the graph of revealed entries.

READ FULL TEXT
research
10/02/2019

A deterministic theory of low rank matrix completion

The problem of completing a large low rank matrix using a subset of reve...
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
02/05/2016

A Note on Alternating Minimization Algorithm for the Matrix Completion Problem

We consider the problem of reconstructing a low rank matrix from a subse...
research
12/20/2018

Using First Hitting Times to Find Sets that Maximize the Convergence Rate to Consensus

In a model of communication in a social network described by a simple co...
research
02/24/2015

1-Bit Matrix Completion under Exact Low-Rank Constraint

We consider the problem of noisy 1-bit matrix completion under an exact ...
research
12/29/2021

On Local Convergence of Iterative Hard Thresholding for Matrix Completion

Iterative hard thresholding (IHT) has gained in popularity over the past...
research
04/14/2016

1-bit Matrix Completion: PAC-Bayesian Analysis of a Variational Approximation

Due to challenging applications such as collaborative filtering, the mat...

Please sign up or login with your details

Forgot password? Click here to reset