Nearly Tight Oblivious Subspace Embeddings by Trace Inequalities
From MaRDI portal
Publication:4575598
DOI10.1137/1.9781611974331.ch21zbMath1415.65106OpenAlexW4251295351MaRDI QIDQ4575598
Publication date: 16 July 2018
Published in: Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/1.9781611974331.ch21
Related Items
Randomized numerical linear algebra: Foundations and algorithms ⋮ Sharper Bounds for Regularized Data Fitting ⋮ Optimal and algorithmic norm regularization of random matrices ⋮ M-IHS: an accelerated randomized preconditioning method avoiding costly matrix decompositions ⋮ Randomized algorithms in numerical linear algebra ⋮ Randomized Low-Rank Approximation for Symmetric Indefinite Matrices ⋮ Practical Sketching Algorithms for Low-Rank Matrix Approximation ⋮ Fast randomized numerical rank estimation for numerically low-rank matrices ⋮ Unnamed Item ⋮ Determinant-Preserving Sparsification of SDDM Matrices ⋮ Simple Analyses of the Sparse Johnson-Lindenstrauss Transform. ⋮ Unnamed Item ⋮ Streaming Low-Rank Matrix Approximation with an Application to Scientific Simulation ⋮ Estimating Leverage Scores via Rank Revealing Methods and Randomization ⋮ Unnamed Item
This page was built for publication: Nearly Tight Oblivious Subspace Embeddings by Trace Inequalities
