Fast estimation method for rank of a high-dimensional sparse matrix

10/25/2021
by   Chen Zhao, et al.
0

Numerical computing the rank of a matrix is a fundamental problem in scientific computation. The data sets generated by Internet often correspond to the analysis of high-dimensional sparse matrices. Notwithstanding the recent advances in the promotion of traditional singular value decomposition (SVD), an efficient estimation algorithm for rank of a high-dimensional sparse matrix is still lacked. Inspired by the controllability theory of complex networks, we converted the rank of a matrix into max-matching computing. Then we established a fast rank estimation algorithm by using cavity method, a powerful approximate technique for computing the max-matching, to estimate the rank of a sparse matrix. In the merit of its natural low complexity of cavity method, we showed that the rank of a high-dimensional sparse matrix can be estimated in a much faster way than SVD with high accuracy. Our method offers an efficient pathway to fast estimate the rank of the high-dimensional sparse matrix, when the time cost of computing the rank by SVD is unacceptable.

READ FULL TEXT

page 1

page 3

page 5

page 6

page 7

page 8

page 9

page 10

research
02/22/2017

On the Power of Truncated SVD for General High-rank Matrix Estimation Problems

We show that given an estimate A that is close to a general high-rank po...
research
09/21/2020

Ranky : An Approach to Solve Distributed SVD on Large Sparse Matrices

Singular Value Decomposition (SVD) is a well studied research topic in m...
research
11/09/2020

Fast and Accurate Pseudoinverse with Sparse Matrix Reordering and Incremental Approach

How can we compute the pseudoinverse of a sparse feature matrix efficien...
research
03/10/2015

Fast and Robust Fixed-Rank Matrix Recovery

We address the problem of efficient sparse fixed-rank (S-FR) matrix deco...
research
06/09/2017

A Maximum Matching Algorithm for Basis Selection in Spectral Learning

We present a solution to scale spectral algorithms for learning sequence...
research
02/15/2011

A Generalized Least Squares Matrix Decomposition

Variables in many massive high-dimensional data sets are structured, ari...
research
07/30/2021

A Scalable Approach to Estimating the Rank of High-Dimensional Data

A key challenge to performing effective analyses of high-dimensional dat...

Please sign up or login with your details

Forgot password? Click here to reset