A Note on Randomized Element-wise Matrix Sparsification
Information Theory
2014-04-02 v1 math.IT
Abstract
Given a matrix A \in R^{m x n}, we present a randomized algorithm that sparsifies A by retaining some of its elements by sampling them according to a distribution that depends on both the square and the absolute value of the entries. We combine the ideas of [4, 1] and provide an elementary proof of the approximation accuracy of our algorithm following [4] without the truncation step.
Cite
@article{arxiv.1404.0320,
title = {A Note on Randomized Element-wise Matrix Sparsification},
author = {Abhisek Kundu and Petros Drineas},
journal= {arXiv preprint arXiv:1404.0320},
year = {2014}
}
Comments
5 pages