Graph-Regularized Low-Rank Matrix Completion by Variable Projection
We address the low-rank matrix completion problem by incorporating graph regularization into the existing Riemannian Trust-Region Matrix Completion (RTRMC) framework. The latter uses the geometry of the low-rank constraint to remodel the problem as an unconstrained optimization problem on a single Grassmann manifold. Our approach, named Graph-Regularized RTRMC (GR-RTRMC), exploits the inherent relationships between rows and columns of the matrix. By using these relationships, we aim to improve the accuracy and robustness of matrix completion, particularly in scenarios where the underlying data exhibits strong correlations between rows or columns.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
Graph-Based Matrix Completion Applied to Weather Data
Low-rank matrix completion is the task of recovering unknown entries of a matrix by assuming that the true matrix admits a good low-rank approximation. Sometimes additional information about the variables is known, and i…
Low-Rank Matrix CompletionMatrix CompletionLearning Latent Features with Pairwise Penalties in Low-Rank Matrix Completion
Low-rank matrix completion has achieved great success in many real-world data applications. A matrix factorization model that learns latent features is usually employed and, to improve prediction performance, the similar…
Low-Rank Matrix CompletionMatrix CompletionRelative Error Bound Analysis for Nuclear Norm Regularized Matrix Completion
In this paper, we develop a relative error bound for nuclear norm regularized matrix completion, with the focus on the completion of full-rank matrices. Under the assumption that the top eigenspaces of the target matrix …
Low-Rank Matrix CompletionMatrix CompletionScalable Nuclear-norm Minimization by Subspace Pursuit Proximal Riemannian Gradient
Nuclear-norm regularization plays a vital role in many learning tasks, such as low-rank matrix recovery (MR), and low-rank representation (LRR). Solving this problem directly can be computationally expensive due to the u…
ClusteringMatrix CompletionA regularized deep matrix factorized model of matrix completion for image restoration
It has been an important approach of using matrix completion to perform image restoration. Most previous works on matrix completion focus on the low-rank property by imposing explicit constraints on the recovered matrix,…
Image RestorationMatrix Completion