\texttt{pylspack}: parallel algorithms and data structures for sketching, column subset selection, regression, and leverage scores
From MaRDI portal
Publication:6599985
Cites work
- scientific article; zbMATH DE number 1775450 (Why is no real title available?)
- scientific article; zbMATH DE number 2086663 (Why is no real title available?)
- scientific article; zbMATH DE number 5937963 (Why is no real title available?)
- scientific article; zbMATH DE number 5485569 (Why is no real title available?)
- <scp>Ginkgo</scp> : A Modern Linear Operator Algebra Framework for High Performance Computing
- A fast randomized algorithm for overdetermined linear least-squares regression
- A simple method for generating gamma variables
- An improved approximation algorithm for the column subset selection problem
- An overview of the sparse basic linear algebra subprograms
- Approximate nearest neighbors and the fast Johnson-Lindenstrauss transform
- Blendenpik: Supercharging LAPACK's Least-Squares Solver
- Column subset selection is NP-complete
- Column subset selection problem is UG-hard
- Dimensionality reduction for \(k\)-means clustering and low rank approximation
- Direct Methods for Sparse Linear Systems
- Estimating Leverage Scores via Rank Revealing Methods and Randomization
- Exploiting multiple levels of parallelism in sparse matrix-matrix multiplication
- Extensions of Lipschitz mappings into a Hilbert space
- Fast approximation of matrix coherence and statistical leverage
- Fast dimension reduction using Rademacher series on dual BCH codes
- Fast matrix rank algorithms and applications
- Fast sparse matrix multiplication
- Faster kernel ridge regression using sketching and preconditioning
- Faster least squares approximation
- Faster subset selection for matrices and applications
- High-dimensional probability. An introduction with applications in data science
- Hutch++: Optimal Stochastic Trace Estimation
- Improved analysis of the subsampled randomized Hadamard transform
- Improved rectangular matrix multiplication using powers of the Coppersmith-Winograd tensor
- Input sparsity time low-rank approximation via ridge leverage score sampling
- Iterative Hessian sketch: fast and accurate solution approximation for constrained least-squares
- LSRN: A parallel iterative solver for strongly over- or underdetermined systems
- Limits on All Known (and Some Unknown) Approaches to Matrix Multiplication
- Low-distortion subspace embeddings in input-sparsity time and applications to robust linear regression
- Matrix rank certification
- Near-optimal algorithms for linear algebra in the current matrix multiplication time
- Nearly tight oblivious subspace embeddings by trace inequalities
- Newton Sketch: A Near Linear-Time Optimization Algorithm with Linear-Quadratic Convergence
- On fast multiplication of a matrix by its transpose
- Packing LPs are Hard to Solve Accurately, Assuming Linear Equations are Hard
- Randomized Linear Algebra Approaches to Estimate the von Neumann Entropy of Density Matrices
- Randomized numerical linear algebra: Foundations and algorithms
- Revisiting the Nyström method for improved large-scale machine learning
- Scikit-learn: machine learning in Python
- Sketching as a tool for numerical linear algebra
- SparseX: a library for high-performance sparse matrix-vector multiplication on multicore platforms
- Sparser Johnson-Lindenstrauss transforms
- Sparsity lower bounds for dimensionality reducing maps
- Two Fast Algorithms for Sparse Matrices: Multiplication and Permuted Transposition
- Uniform sampling for matrix approximation
This page was built for publication: \texttt{pylspack}: parallel algorithms and data structures for sketching, column subset selection, regression, and leverage scores
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6599985)
