Frequent Directions: Simple and Deterministic Matrix Sketching (Q2821796): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: On the largest principal angle between random subspaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Database-friendly random projections: Johnson-Lindenstrauss with binary coins. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast computation of low rank matrix approximations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mergeable summaries / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strong converse for identification via quantum channels / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Fast Random Sampling Algorithm for Sparsifying Matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Near Optimal Column-Based Matrix Reconstruction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4633910 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4448872 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4737200 / 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: Dimensionality Reduction for k-Means Clustering and Low Rank Approximation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4023085 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A sparse Johnson / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4411371 / 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 II: Computing a Low-Rank Approximation to a Matrix / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5405231 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Relative-Error $CUR$ Matrix Decompositions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Faster least squares approximation / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on element-wise matrix sparsification via a matrix-valued Bernstein inequality / rank
 
Normal rank
Property / cites work
 
Property / cites work: Turning Big data into tiny data: Constant-size coresets for <i>k</i>-means, PCA and projective clustering / 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: Improved Practical Matrix Sketching with Guarantees / 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: Q4945525 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4917542 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sparser Johnson-Lindenstrauss Transforms / rank
 
Normal rank
Property / cites work
 
Property / cites work: On differentially private low rank approximation / rank
 
Normal rank
Property / cites work
 
Property / cites work: On randomized one-round communication complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Communication Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sequential Karhunen-Loeve basis extraction and its application to images / rank
 
Normal rank
Property / cites work
 
Property / cites work: Randomized algorithms for the low-rank approximation of matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3765876 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding repeated elements / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3425115 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sums of random Hermitian matrices and an inequality by Rudelson / rank
 
Normal rank
Property / cites work
 
Property / cites work: Latent semantic indexing: A probabilistic analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sampling from large matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Non-asymptotic theory of random matrices: extreme singular values / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4821981 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Spectral norm of products of random and deterministic matrices / rank
 
Normal rank

Revision as of 15:23, 12 July 2024

scientific article
Language Label Description Also known as
English
Frequent Directions: Simple and Deterministic Matrix Sketching
scientific article

    Statements

    Frequent Directions: Simple and Deterministic Matrix Sketching (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    23 September 2016
    0 references
    0 references
    matrix sketching
    0 references
    streaming
    0 references
    \textsc{FrequentDirections}
    0 references
    covariance sketching
    0 references
    singular value decomposition
    0 references
    algorithm
    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
    0 references
    0 references
    0 references