OSNAP: faster numerical linear algebra algorithms via sparser subspace embeddings
From MaRDI portal
Cited in
(14)- Fast algorithms for least squares problems with Kronecker lower subsets
- Fine-grained analysis and faster algorithms for iteratively solving linear systems
- Low-rank approximation: randomized QR with column pivoting and related methods using sparse projection and pass-efficient techniques
- Low-rank approximation of parameter-dependent matrices via CUR decomposition
- Surrogate-based autotuning for randomized sketching algorithms in regression problems
- Construction of hierarchically semiseparable matrix representation using adaptive Johnson-Lindenstrauss sketching
- Low-rank approximation algorithm using sparse projection and its applications
- Leverage score sampling for faster accelerated regression and ERM
- Subspace embeddings under nonlinear transformations
- A very sketchy talk (invited talk)
- Accelerating the Canonical Polyadic Alternating Least Squares Optimization via a Randomized Interpolative Decomposition
- Comparison theorems for the minimum eigenvalue of a random positive-semidefinite matrix
- Almost optimal superconstant-pass streaming lower bounds for reachability
- Optimal oblivious subspace embeddings with near-optimal sparsity
This page was built for publication: OSNAP: faster numerical linear algebra algorithms via sparser subspace embeddings
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6981764)
