Comparison of matrix norm sparsification

DOI10.1007/S00453-023-01172-6arXiv2201.12874OpenAlexW4387024401MaRDI QIDQ6066776

Robert Krauthgamer, Shay Sapir

Publication date: 13 December 2023

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2201.12874

zbMATH Keywords

Schatten normsmatrix sparsificationmatrix approximation

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx) Graph theory (05Cxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Convex and concave functions of singular values of matrix sums
• Some combinatorial-algebraic problems from complexity theory
• Spectrum estimation from samples
• A note on element-wise matrix sparsification via a matrix-valued Bernstein inequality
• Remarks on the singular numbers of a sum of completely continuous operators
• Exact matrix completion via convex optimization
• Pinching, Trimming, Truncating, and Averaging of Matrices
• Spectral Sparsification of Graphs
• Fast computation of low-rank matrix approximations
• A Fast Random Sampling Algorithm for Sparsifying Matrices
• Pinchings and Norms of Scaled Triangular Matrices
• Constructing Linear-Sized Spectral Sparsification in Almost-Linear Time
• Tensor sparsification via a bound on the spectral norm of random tensors: Algorithm 1.
• Recovering PCA from Hybrid-$(\ell_1,\ell_2)$ Sparse Sampling of Data Elements
• Twice-Ramanujan Sparsifiers
• The Power of Convex Relaxation: Near-Optimal Matrix Completion
• Low-rank approximation with 1/𝜖 ^1/3 matrix-vector products

This page was built for publication: Comparison of matrix norm sparsification