Relevance singular vector machine for low-rank matrix sensing
Authors:
- 1 July 2014
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 21650608,p. 1-5
Abstract
In this paper we develop a new Bayesian inference method for low rank matrix reconstruction. We call the new method the Relevance Singular Vector Machine (RSVM) where appropriate priors are defined on the singular vectors of the underlying matrix to promote low rank. To accelerate computations, a numerically efficient approximation is developed. The proposed algorithms are applied to matrix completion and matrix reconstruction problems and their performance is studied numerically.Keywords
All Related Versions
This publication has 10 references indexed in Scilit:
- Sparse Bayesian Methods for Low-Rank Matrix EstimationIEEE Transactions on Signal Processing, 2012
- Alternating Least-Squares for Low-Rank Matrix ReconstructionIEEE Signal Processing Letters, 2012
- Low-rank Matrix Recovery via Iteratively Reweighted Least Squares MinimizationSIAM Journal on Optimization, 2011
- Iterative reweighted least squares for matrix rank minimization2010
- ADMiRA: Atomic Decomposition for Minimum Rank ApproximationIEEE Transactions on Information Theory, 2010
- Matrix Completion With NoiseProceedings of the IEEE, 2010
- A Singular Value Thresholding Algorithm for Matrix CompletionSIAM Journal on Optimization, 2010
- Exact Matrix Completion via Convex OptimizationFoundations of Computational Mathematics, 2009
- Bayesian Compressive SensingIEEE Transactions on Signal Processing, 2008
- Compressive Sensing [Lecture Notes]IEEE Signal Processing Magazine, 2007