2000 character limit reached
A Note on Randomized Element-wise Matrix Sparsification
Published 1 Apr 2014 in cs.IT and math.IT | (1404.0320v1)
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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.