Efficient Unbiased Sparsification

2024/02/22 by Leighton Barnes, Barnes, Leighton, Timothy Chow +14 · 2 citations
Computer Science · Engineering · #Advanced Numerical Analysis Techniques #Advanced Surface Polishing Techniques #Digital Image Processing Techniques #FOS: Computer and information sciences #FOS: Mathematics #Information Theory (cs.IT) #Machine Learning (cs.LG) #Statistics Theory (math.ST)

paper · pdf · doi:10.48550/arxiv.2402.14925

openalex publication_date 2024/02/22 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

An unbiased m-sparsification of a vector p∈ ℝⁿ is a random vector Q∈ ℝⁿ with mean p that has at most m

Cited by

• Beyond Self-Repellent Kernels: History-Driven Target Towards Efficient Nonlinear MCMC on General Graphs
• On Unbiased Low-Rank Approximation with Minimum Distortion

Related

• A Note on Randomized Element-wise Matrix Sparsification
• Sparsifying Suprema of Gaussian Processes
• Sharp Sufficient Conditions on Exact Sparsity Pattern Recovery
• On the Performance of Sparse Recovery via L_p-minimization (0<=p <=1)
• Sparsifying generalized linear models