\texttt{pylspack}: parallel algorithms and data structures for sketching, column subset selection, regression, and leverage scores

Cites Work

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

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)