Why Are Big Data Matrices Approximately Low Rank? (Q5025778): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 2 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: Pyglrm / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: OBOE / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Representations for partially exchangeable arrays of random variables / rank
 
Normal rank
Property / cites work
 
Property / cites work: Perturbed Identity Matrices Have High Rank: Proof and Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: The approximate rank of a matrix and its algorithmic applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4790110 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hierarchical matrices. A means to efficiently solve elliptic boundary value problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Singular Values of Matrices with Displacement Structure / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matrix estimation by universal singular value thresholding / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stochastic blockmodels with a growing number of classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Eigenvalues and Condition Numbers of Random Matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Low-rank matrix approximation in the infinity norm / rank
 
Normal rank
Property / cites work
 
Property / cites work: A tail inequality for quadratic forms of subgaussian random vectors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extensions of Lipschitz mappings into a Hilbert space / rank
 
Normal rank
Property / cites work
 
Property / cites work: Limits of dense graph sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: On variants of the Johnson–Lindenstrauss lemma / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Remark on Stirling's Formula / rank
 
Normal rank
Property / cites work
 
Property / cites work: Relative Error Tensor Low Rank Approximation / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the singular values of matrices with high displacement rank / rank
 
Normal rank
Property / cites work
 
Property / cites work: Practical Sketching Algorithms for Low-Rank Matrix Approximation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized Low Rank Models / rank
 
Normal rank
Property / cites work
 
Property / cites work: High-Dimensional Probability / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Blessings of Multiple Causes / rank
 
Normal rank
Property / cites work
 
Property / cites work: A penalized matrix decomposition, with applications to sparse principal components and canonical correlation analysis / rank
 
Normal rank

Latest revision as of 21:36, 27 July 2024

scientific article; zbMATH DE number 7468824
Language Label Description Also known as
English
Why Are Big Data Matrices Approximately Low Rank?
scientific article; zbMATH DE number 7468824

    Statements

    Why Are Big Data Matrices Approximately Low Rank? (English)
    0 references
    0 references
    0 references
    3 February 2022
    0 references
    big data
    0 references
    low-rank matrices
    0 references
    Johnson-Lindenstrauss lemma
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers