Optimal CUR Matrix Decompositions (Q2968164): Difference between revisions

From MaRDI portal
ReferenceBot (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Database-friendly random projections: Johnson-Lindenstrauss with binary coins. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Twice-ramanujan sparsifiers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithm 844 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Near-Optimal Column-Based Matrix Reconstruction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved Matrix Algorithms via the Subsampled Randomized Hadamard Transform / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4633910 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Universal classes of hash functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Numerical linear algebra in the streaming model / rank
 
Normal rank
Property / cites work
 
Property / cites work: Low-Rank Approximation and Regression in Input Sparsity Time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matrix approximation and projective clustering via volume sampling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Adaptive Sampling and Fast Low-Rank Matrix Approximation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4471298 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Monte Carlo Algorithms for Matrices I: Approximating Matrix Multiplication / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Monte Carlo Algorithms for Matrices II: Computing a Low-Rank Approximation to a Matrix / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Monte Carlo Algorithms for Matrices III: Computing a Compressed Approximate Matrix Decomposition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Subspace Sampling and Relative-Error Matrix Approximation: Column-Row-Based Methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3093333 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Relative-Error $CUR$ Matrix Decompositions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized Rank-Constrained Matrix Approximations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast monte-carlo algorithms for finding low-rank approximations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Relative Errors for Deterministic Low-Rank Matrix Approximations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3188054 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A theory of pseudoskeleton approximations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pseudo-skeleton approximations by matrices of maximal volume / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strong rank revealing Cholesky factorization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Column-Based Low-Rank Matrix Reconstruction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding structure with randomness: Probabilistic algorithms for constructing approximate matrix decompositions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved bound for rank revealing LU factorizations / rank
 
Normal rank
Property / cites work
 
Property / cites work: CUR matrix decompositions for improved data analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Low-distortion subspace embeddings in input-sparsity time and applications to robust linear regression / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strong rank revealing LU factorizations / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the existence and computation of rank-revealing LU factorizations / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fast randomized algorithm for overdetermined linear least-squares regression / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sampling from large matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: On generalized matrix approximation problem in the spectral norm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Four algorithms for the the efficient computation of truncated pivoted QR approximations to a sparse matrix / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mosaic-skeleton approximations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Incomplete cross approximation in the mosaic-skeleton method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2933911 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational Advertising: Techniques for Targeting Relevant Ads / rank
 
Normal rank
Property / cites work
 
Property / cites work: Randomized Extended Kaczmarz for Solving Least Squares / rank
 
Normal rank

Latest revision as of 12:35, 13 July 2024

scientific article; zbMATH DE number 6451563
  • Optimal CUR matrix decompositions
Language Label Description Also known as
English
Optimal CUR Matrix Decompositions
scientific article; zbMATH DE number 6451563
  • Optimal CUR matrix decompositions

Statements

Optimal CUR Matrix Decompositions (English)
0 references
Optimal CUR matrix decompositions (English)
0 references
0 references
0 references
10 March 2017
0 references
26 June 2015
0 references
randomized algorithms
0 references
numerical linear algebra
0 references
low-rank approximations
0 references
CUR decomposition
0 references
singular value decomposition
0 references
CUR
0 references
SVD
0 references
adaptive sampling
0 references
column subset selection
0 references
input-sparsity-time
0 references
leverage scores
0 references
low rank matrix decomposition
0 references
spectral sparsification
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references

Identifiers

0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references