A note on element-wise matrix sparsification via a matrix-valued Bernstein inequality (Q1944905): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / arXiv ID
 
Property / arXiv ID: 1006.0407 / 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: Fast computation of low-rank matrix approximations / 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: Exact matrix completion via convex optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Power of Convex Relaxation: Near-Optimal Matrix Completion / 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: Q3998992 / rank
 
Normal rank

Latest revision as of 07:26, 6 July 2024

scientific article
Language Label Description Also known as
English
A note on element-wise matrix sparsification via a matrix-valued Bernstein inequality
scientific article

    Statements

    A note on element-wise matrix sparsification via a matrix-valued Bernstein inequality (English)
    0 references
    0 references
    0 references
    28 March 2013
    0 references
    matrix-valued Bernstein bounds
    0 references
    matrix sparsification
    0 references
    algorithms
    0 references

    Identifiers

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