93 citations · 153 across the 5 of their papers we have counts for
Showing math.STShow all
3 papers · 1 filter
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…
math.ST2014
Adaptive Multinomial Matrix Completion
Olga Klopp, Jean Lafond, Eric Moulines +1
The task of estimating a matrix given a sample of observed entries is known as the \emph{matrix completion problem}. Most works on matrix completion have focused on recovering an u…