Relevance Singular Vector Machine for low-rank matrix sensing
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.
Code (0)
등록된 구현이 없습니다.
Tasks
Bayesian InferenceMatrix CompletionSimilar Papers 제목 키워드 기반
Updating Singular Value Decomposition for Rank One Matrix Perturbation
An efficient Singular Value Decomposition (SVD) algorithm is an important tool for distributed and streaming computation in big data problems. It is observed that update of singular vectors of a rank-1 perturbed matrix i…
Ranky : An Approach to Solve Distributed SVD on Large Sparse Matrices
Singular Value Decomposition (SVD) is a well studied research topic in many fields and applications from data mining to image processing. Data arising from these applications can be represented as a matrix where it is la…
Analysis of singular subspaces under random perturbations
We present a comprehensive analysis of singular vector and singular subspace perturbations in the context of the signal plus random Gaussian noise matrix model. Assuming a low-rank signal matrix, we extend the Davis-Kaha…
RankFeat: Rank-1 Feature Removal for Out-of-distribution Detection
The task of out-of-distribution (OOD) detection is crucial for deploying machine learning models in real-world settings. In this paper, we observe that the singular value distributions of the in-distribution (ID) and OOD…
Out-of-Distribution DetectionA random algorithm for low-rank decomposition of large-scale matrices with missing entries
A Random SubMatrix method (RSM) is proposed to calculate the low-rank decomposition of large-scale matrices with known entry percentage \rho. RSM is very fast as the floating-point operations (flops) required are compare…