A Note on Randomized Element-wise Matrix Sparsification

Abhisek Kundu, Petros Drineas

Type: Preprint

Publication Date: 2014-01-01

Citations: 14

DOI: https://doi.org/10.48550/arxiv.1404.0320

View Publication

Locations

arXiv (Cornell University) - View
DataCite API - View

Similar Works

Action	Title	Year	Authors
+ PDF Chat	A note on element-wise matrix sparsification via a matrix-valued Bernstein inequality	2011	Petros Drineas Anastasios Zouzias
+	Analysis of Resparsification	2016	Jakub Pachocki
+	Analysis of Resparsification.	2016	Jakub Pachocki
+	Near-Optimal Entrywise Sampling of Numerically Sparse Matrices	2020	Vladimir Braverman Robert Krauthgamer Aditya Krishnan Shay Sapir
+	Universal Matrix Sparsifiers and Fast Deterministic Algorithms for Linear Algebra	2023	Rajarshi Bhattacharjee Gregory Dexter Cameron Musco Archan Ray David P. Woodruff
+	Improved Column-Based Low-Rank Matrix Reconstruction	2011	Venkatesan Guruswami Ali Kemal Sinop
+ PDF Chat	Graph Sparsification by Approximate matrix Multiplication	2023	Neophytos Charalambides Alfred O. Hero
+	A Randomized Algorithm for the Approximation of Matrices	2006	Per‐Gunnar Martinsson Vladimir Rockhlin Mark Tygert
+	Tensor sparsification via a bound on the spectral norm of random tensors	2010	Nam Hoai Nguyen Petros Drineas Trac D. Tran
+	Tensor sparsification via a bound on the spectral norm of random tensors	2010	Nam Nguyen Petros Drineas Trac D. Tran
+	Comparison of Matrix Norm Sparsification	2022	Robert Krauthgamer Shay Sapir
+	Sublinear Time Eigenvalue Approximation via Random Sampling	2021	Rajarshi Bhattacharjee Gregory Dexter Petros Drineas Cameron Musco Archan Ray
+	Graph Sparsification by Approximate Matrix Multiplication	2023	Neophytos Charalambides Alfred O. Hero
+	$\ell_p$ Row Sampling by Lewis Weights	2014	Michael B. Cohen Richard Peng
+	New Studies of Randomized Augmentation and Additive Preprocessing	2014	Victor Y. Pan Liang Zhao
+	New studies of randomized augmentation and additive preprocessing	2016	Victor Y. Pan Liang Zhao
+ PDF Chat	Row-aware Randomized SVD with applications	2024	Davide Palitta Simona Portaro
+	On the approximation of a matrix	2021	Samriddha Sanyal
+	On the approximation of a matrix	2021	Samriddha Sanyal
+	TR-2011011: Randomized and Derandomized Matrix Computations II	2011	Victor Y. Pan Guoliang Qian Ai-Long Zheng

Works That Cite This (12)

Action	Title	Year	Authors
+ PDF Chat	Data-Independent Structured Pruning of Neural Networks via Coresets	2021	Ben Mussay Dan Feldman Samson Zhou Vladimir Braverman Margarita Osadchy
+	Data-Dependent Coresets for Compressing Neural Networks with Applications to Generalization Bounds	2018	Cenk Baykal Lucas Liebenwein Igor Gilitschenski Dan Feldman Daniela Rus
+	Data-Independent Neural Pruning via Coresets	2019	Ben Mussay Margarita Osadchy Vladimir Braverman Samson Zhou Dan Feldman
+	Provable Filter Pruning for Efficient Neural Networks	2020	Lucas Liebenwein Cenk Baykal Harry G. Lang Dan Feldman Daniela Rus
+	Provable Filter Pruning for Efficient Neural Networks	2019	Lucas Liebenwein Cenk Baykal Harry G. Lang Dan Feldman Daniela Rus
+ PDF Chat	An Introduction to Matrix Concentration Inequalities	2015	Joel A. Tropp
+	Exploiting Numerical Sparsity for Efficient Learning : Faster Eigenvector Computation and Regression	2018	Neha Gupta Aaron Sidford
+	Random perturbation and matrix sparsification and completion.	2018	Sean M. O’Rourke Van Vu Ke Wang
+	Data-Independent Structured Pruning of Neural Networks via Coresets	2020	Ben Mussay Daniel E. Feldman Samson Zhou Vladimir Braverman Margarita Osadchy
+	Recovering PCA from Hybrid-(ℓ 1 , ℓ 2 ) Sparse Sampling of Data Elements.	2015	Abhisek Kundu Petros Drineas Malik Magdon‐Ismail

Works Cited by This (2)

Action	Title	Year	Authors
+	Fast computation of low-rank matrix approximations	2007	Dimitris Achlioptas Frank McSherry
+	A Simpler Approach to Matrix Completion	2009	Benjamin Recht