Fast algorithms for least squares problems with Kronecker lower subsets
From MaRDI portal
Cites work
- A Practical Randomized CP Tensor Decomposition
- Coherence motivated sampling and convergence analysis of least squares polynomial chaos regression
- Compressed matrix multiplication
- Fast approximation of matrix coherence and statistical leverage
- Faster Johnson-Lindenstrauss transforms via Kronecker products
- Faster least squares approximation
- Guarantees for the Kronecker fast Johnson-Lindenstrauss transform using a coherence and sampling argument
- scientific article; zbMATH DE number 878984 (Why is no real title available?)
- Improved parallel QR method for large least squares problems involving Kronecker products
- Large Least Squares Problems Involving Kronecker Products
- Least squares polynomial chaos expansion: a review of sampling strategies
- Least squares problems involving generalized Kronecker products and application to bivariate polynomial regression
- Low-rank approximation and regression in input sparsity time
- Lower Memory Oblivious (Tensor) Subspace Embeddings with Fewer Random Bits: Modewise Methods for Least Squares
- Near-linear sample complexity for L_p polynomial regression
- Oblivious Sketching of High-Degree Polynomial Kernels
- OSNAP: faster numerical linear algebra algorithms via sparser subspace embeddings
- Randomized interpolative decomposition of separated representations
- Relative-Error CUR Matrix Decompositions
- Sampling algorithms for l₂ regression and applications
- Sparse Polynomial Approximation of High-Dimensional Functions
- Sparse polynomial chaos expansions via compressed sensing and D-optimal design
- Structured random sketching for PDE inverse problems
- The fast Johnson-Lindenstrauss transform and approximate nearest neighbors
This page was built for publication: Fast algorithms for least squares problems with Kronecker lower subsets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6834498)
