Matrix recovery from quantized and corrupted measurements
Authors:
- 1 May 2014
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 15206149,p. 4973-4977
Abstract
This paper deals with the recovery of an unknown, low-rank matrix from quantized and (possibly) corrupted measurements of a subset of its entries. We develop statistical models and corresponding (multi-)convex optimization algorithms for quantized matrix completion (Q-MC) and quantized robust principal component analysis (Q-RPCA). In order to take into account the quantized nature of the available data, we jointly learn the underlying quantization bin boundaries and recover the low-rank matrix, while removing potential (sparse) corruptions. Experimental results on synthetic and two real-world collaborative filtering datasets demonstrate that directly operating with the quantized measurements - rather than treating them as real values - results in (often significantly) lower recovery error if the number of quantization bins is less than about 10.Keywords
This publication has 17 references indexed in Scilit:
- Spatio-Temporal Modeling of Legislation and VotesBayesian Analysis, 2013
- OrdRec2011
- Robust principal component analysis?Journal of the ACM, 2011
- Rank-Sparsity Incoherence for Matrix DecompositionSIAM Journal on Optimization, 2011
- A Singular Value Thresholding Algorithm for Matrix CompletionSIAM Journal on Optimization, 2010
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse ProblemsSIAM Journal on Imaging Sciences, 2009
- Collaborative filtering with interlaced generalized linear modelsNeurocomputing, 2008
- Lessons from the Netflix prize challengeACM SIGKDD Explorations Newsletter, 2007
- Compressed sensingIEEE Transactions on Information Theory, 2006
- An algorithmic framework for performing collaborative filtering1999