27 citations · 48 across the 2 of their papers we have counts for
2 papers
math.ST2015★ 27 cited
Low Rank Matrix Completion with Exponential Family Noise
Jean Lafond
The matrix completion problem consists in reconstructing a matrix from a sample of entries, possibly observed with noise. A popular class of estimator, known as nuclear norm penali…
math.ST2014★ 21 cited
Probabilistic low-rank matrix completion on finite alphabets
Jean Lafond, Olga Klopp, Eric Moulines +1
The task of reconstructing a matrix given a sample of observedentries is known as the matrix completion problem. It arises ina wide range of problems, including recommender systems…