500 citations · 500 across the 2 of their papers we have counts for
3 papers
Graph-Regularized Low-Rank Matrix Completion by Variable Projection
Benoît Loucheur, P. -A. Absil, Michel Journée
We address the low-rank matrix completion problem by incorporating graph regularization into the existing Riemannian Trust-Region Matrix Completion (RTRMC) framework. The latter us…
Graph-Based Matrix Completion Applied to Weather Data
Benoît Loucheur, P. -A. Absil, Michel Journée
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 informa…
Generalized power method for sparse principal component analysis
Michel Journée, Yurii Nesterov, Peter Richtárik +1
In this paper we develop a new approach to sparse principal component analysis (sparse PCA). We propose two single-unit and two block optimization formulations of the sparse PCA pr…