Statistical and computational trade-offs in estimation of sparse principal components (Q342660)

From MaRDI portal
Revision as of 10:28, 30 July 2024 by Openalex240730090724 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Statistical and computational trade-offs in estimation of sparse principal components
scientific article

    Statements

    Statistical and computational trade-offs in estimation of sparse principal components (English)
    0 references
    0 references
    0 references
    0 references
    18 November 2016
    0 references
    computational lower bounds
    0 references
    planted clique problem
    0 references
    polynomial time algorithm
    0 references
    sparse principal component analysis
    0 references

    Identifiers