Leveraged Matrix Completion With Noise

Xinjian Huang

doi:10.1109/TCYB.2023.3305552

2024-08-01

DOI：10.1109/TCYB.2023.3305552

原文链接

原文求助

摘要

En 中文

Completing low-rank matrices from subsampled measurements has received much attention in the past decade. Existing works indicate that O(nr log(2)(n)) datums are required to theoretically secure the completion of an n x n noisy matrix of rank r with high probability, under some quite restrictive assumptions: 1) the underlying matrix must be incoherent and 2) observations follow the uniform distribution. The restrictive-ness is partially due to ignoring the roles of the leverage score and the oracle information of each element. In this article, we employ the leverage scores to characterize the importance of each element and significantly relax assumptions to: 1) not any other structure assumptions are imposed on the underlying low-rank matrix and 2) elements being observed are appropriately dependent on their importance via the leverage score. Under these assumptions, instead of uniform sampling, we devise an ununiform/biased sampling procedure that can reveal the importance of each observed element. Our proofs are supported by a novel approach that phrases sufficient optimality conditions based on the Golfing scheme, which would be of independent interest to the wider areas. Theoretical findings show that we can provably recover an unknown n x n matrix of rank r from just about O(nr log(2)(n)) entries, even when the observed entries are cor-rupted with a small amount of noisy information. The empirical results align precisely with our theories.

Keyword:

Noise measurement

Sparse matrices

Linear matrix inequalities

Computer science

Complexity theory

Upper bound

Pollution measurement

Leverage score

low rank

matrix completion

noise