Input Sparsity Time Low-rank Approximation via Ridge Leverage Score Sampling
From MaRDI portal
Publication:4575860
DOI10.1137/1.9781611974782.115zbMath1410.68399arXiv1511.07263OpenAlexW2531542820MaRDI QIDQ4575860
Cameron Musco, Michael B. Cohen, Christopher Musco
Publication date: 16 July 2018
Published in: Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1511.07263
Related Items
Randomized numerical linear algebra: Foundations and algorithms ⋮ Semi-Infinite Linear Regression and Its Applications ⋮ Nyström landmark sampling and regularized Christoffel functions ⋮ One-pass additive-error subset selection for \(\ell_p\) subspace approximation and \((k, p)\)-clustering ⋮ Structural conditions for projection-cost preservation via randomized matrix multiplication ⋮ Randomized algorithms in numerical linear algebra ⋮ Unnamed Item ⋮ Approximating Spectral Clustering via Sampling: A Review ⋮ Density Independent Algorithms for Sparsifying k-Step Random Walks ⋮ Unnamed Item ⋮ Quick-means: accelerating inference for K-means by learning fast transforms ⋮ Allocation Strategies for High Fidelity Models in the Multifidelity Regime ⋮ Isolation kernel: the X factor in efficient and effective large scale online kernel learning ⋮ Diversity Sampling is an Implicit Regularization for Kernel Methods ⋮ Fast and Accurate Gaussian Kernel Ridge Regression Using Matrix Decompositions for Preconditioning ⋮ Estimating Leverage Scores via Rank Revealing Methods and Randomization ⋮ Unnamed Item ⋮ Unnamed Item
This page was built for publication: Input Sparsity Time Low-rank Approximation via Ridge Leverage Score Sampling
