Low Rank Approximation and Decomposition of Large Matrices Using Error Correcting Codes

Low rank approximation is an important tool used in many applications of signal processing and machine learning. Recently, randomized sketching algorithms were proposed to effectively construct low rank approximations and obtain approximate singular value decompositions of large matrices. Similar id...

Full description

Saved in:

Bibliographic Details
Published in:	IEEE transactions on information theory Vol. 63; no. 9; pp. 5544 - 5558
Main Authors:	Ubaru, Shashanka, Mazumdar, Arya, Saad, Yousef
Format:	Journal Article
Language:	English
Published:	New York IEEE 01.09.2017 The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subjects:	Algorithm design and analysis Approximation Approximation algorithms Columns (structural) Decomposition Error correcting codes Error correction Error correction & detection Error correction codes Least squares method low rank approximation Machine learning Mathematical analysis Matrix decomposition Matrix methods randomized sketching algorithms Regression Regression analysis Signal processing Sparse matrices Statistical analysis subspace embedding Transforms
ISSN:	0018-9448, 1557-9654
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!