← Back to all news
arXiv Machine Learning By Beno\^it Loucheur, P. -A. Absil, Michel Journ\'ee

Graph-Regularized Low-Rank Matrix Completion by Variable Projection

Read the original on arXiv Machine Learning →

arXiv:2607. 09546v1 Announce Type: new Abstract: We address the low-rank matrix completion problem by incorporating graph regularization into the existing Riemannian Trust-Region Matrix Completion (RTRMC) framework.

Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv Machine Learning.

Related stories

arXiv Machine Learning
5d ago

Retraction-Based Gradient Projection Algorithms on Manifolds

The paper presents a framework for retraction-based convex optimization on Riemannian manifolds, introducing retraction-specific convex sets and retraction-based gradient projection algorithms. It extends the standard theory of gradient projection algorithms to this setting and proves convergence results for various stepsize rules. The authors apply the framework to weighted low-rank approximation and validate the convergence results numerically on an image completion task.

By Conglong Xu, Hao Wu
More like this →
arXiv Machine Learning
Sep 16

Near-Optimal Nonconvex Matrix Completion

arXiv:2609. 17048v1 Announce Type: cross Abstract: We study nonconvex methods for matrix completion, the problem of recovering a low-rank matrix from a subset of its entries.

By Jian-Feng Cai, Xiliang Lu, Juntao You
More like this →
arXiv Machine Learning
Jun 4

Low-rank Distributional Matrix Completion

arXiv:2606. 04176v1 Announce Type: new Abstract: We study a distributional generalization of the matrix completion problem in which each entry of the target matrix is a probability distribution rather than a scalar.

By Jiayi Wang, Raymond K. W. Wong
rag
More like this →
arXiv Machine Learning
Sep 15

N$^2$: A Unified Python Package and Test Bench for Nearest Neighbor-Based Matrix Completion

arXiv:2506.04166v3 Announce Type: replace Abstract: Nearest neighbor (NN) methods have re-emerged as competitive tools for matrix completion, offering strong empirical performance and recent theoreti...

By Caleb Chin, Aashish Khubchandani, Harshvardhan Maskara, Kyuseong Choi, Jacob Feitelberg, Albert Gong, Manit Paul, Tathagata Sadhukhan, Dwaipayan Saha, Anish Agarwal, Raaz Dwivedi
llmsbenchmarks
More like this →
arXiv Machine Learning
Jun 2

Riemannian Optimization for Hadamard Products of Low-Rank Matrices

arXiv:2606. 01216v1 Announce Type: new Abstract: The elementwise Hadamard product of two low-rank matrices provides a parameter-efficient model for data with multiplicative structure, but its modeling is challenging due to the presence of additional symmetries under coupled row/column scalings between the two factors.

By Pratik Jawanpuria, Ankish Chandresh, Bamdev Mishra
More like this →