On Local Convergence of Iterative Hard Thresholding for Matrix Completion

by   Trung Vu, et al.

Iterative hard thresholding (IHT) has gained in popularity over the past decades in large-scale optimization. However, convergence properties of this method have only been explored recently in non-convex settings. In matrix completion, existing works often focus on the guarantee of global convergence of IHT via standard assumptions such as incoherence property and uniform sampling. While such analysis provides a global upper bound on the linear convergence rate, it does not describe the actual performance of IHT in practice. In this paper, we provide a novel insight into the local convergence of a specific variant of IHT for matrix completion. We uncover the exact linear rate of IHT in a closed-form expression and identify the region of convergence in which the algorithm is guaranteed to converge. Furthermore, we utilize random matrix theory to study the linear rate of convergence of IHTSVD for large-scale matrix completion. We find that asymptotically, the rate can be expressed in closed form in terms of the relative rank and the sampling rate. Finally, we present various numerical results to verify the aforementioned theoretical analysis.


page 6

page 7

page 9

page 11


Exact Linear Convergence Rate Analysis for Low-Rank Symmetric Matrix Completion via Gradient Descent

Factorization-based gradient descent is a scalable and efficient algorit...

Matrix Completion via Nonconvex Regularization: Convergence of the Proximal Gradient Algorithm

Matrix completion has attracted much interest in the past decade in mach...

Matrix Completion with Cross-Concentrated Sampling: Bridging Uniform Sampling and CUR Sampling

While uniform sampling has been widely studied in the matrix completion ...

Structured Gradient Descent for Fast Robust Low-Rank Hankel Matrix Completion

We study the robust matrix completion problem for the low-rank Hankel ma...

Asymptotic Convergence Rate of Alternating Minimization for Rank One Matrix Completion

We study alternating minimization for matrix completion in the simplest ...

A Max-Norm Constrained Minimization Approach to 1-Bit Matrix Completion

We consider in this paper the problem of noisy 1-bit matrix completion u...

Bayesian matrix completion with a spectral scaled Student prior: theoretical guarantee and efficient sampling

We study the problem of matrix completion in this paper. A spectral scal...

Please sign up or login with your details

Forgot password? Click here to reset