Tensor clustering with planted structures: statistical optimality and computational limits (Q2119244): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Set OpenAlex properties.
 
(4 intermediate revisions by 4 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: MultiCluster / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 2005.10743 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4705344 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3549649 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nuclear norm minimization for the planted clique and biclique problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: High-Dimensional Covariance Decomposition into Sparse Markov and Independence Models / rank
 
Normal rank
Property / cites work
 
Property / cites work: Community detection in dense random networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5875785 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Nearly Tight Sum-of-Squares Lower Bound for the Planted Clique Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal detection of sparse principal components in high dimension / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cliques in random graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Biclustering in data mining / rank
 
Normal rank
Property / cites work
 
Property / cites work: Detection of a sparse submatrix of a high-dimensional noisy matrix / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sharp variable selection of a sparse submatrix in a high-dimensional noisy matrix / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational and statistical boundaries for submatrix localization in a large noisy matrix / rank
 
Normal rank
Property / cites work
 
Property / cites work: Statistical and computational limits for sparse matrix detection / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding Planted Subgraphs with Few Eigenvalues using the Schur--Horn Relaxation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational and statistical tradeoffs via convex relaxation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Incoherence-Optimal Matrix Completion / rank
 
Normal rank
Property / cites work
 
Property / cites work: Statistical-Computational Tradeoffs in Planted Problems and Submatrix Localization with a Growing Number of Clusters and Submatrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convex biclustering / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing the Union: Tight Approximations for Small Set Bipartite Vertex Expansion / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5009502 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Multilinear Singular Value Decomposition / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Best Rank-1 and Rank-(<i>R</i><sub>1</sub> ,<i>R</i><sub>2</sub> ,. . .,<i>R<sub>N</sub></i>) Approximation of Higher-Order Tensors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding Hidden Cliques in Linear Time with High Probability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding hidden cliques of size \(\sqrt{N/e}\) in nearly linear time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient Algorithms and Lower Bounds for Robust Linear Regression / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Average-Case Time Complexity of Certifying the Restricted Isometry Property / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4999009 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding and certifying a large hidden clique in a semirandom graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Complexity of Random Satisfiability Problems with Planted Solutions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Statistical Algorithms and a Lower Bound for Detecting Planted Cliques / rank
 
Normal rank
Property / cites work
 
Property / cites work: Limits of local algorithms over sparse random graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sparse CCA: adaptive estimation and computational barriers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Consistency of spectral hypergraph partitioning under planted partition model / rank
 
Normal rank
Property / cites work
 
Property / cites work: Most Tensor Problems Are NP-Hard / rank
 
Normal rank
Property / cites work
 
Property / cites work: Large Cliques Elude the Metropolis Process / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hidden Cliques and the Certification of the Restricted Isometry Property / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tensor Decompositions and Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational barriers in minimax submatrix detection / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sum-of-squares Lower Bounds for Planted Clique / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding one community in a sparse graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Statistical limits of spiked tensor models / rank
 
Normal rank
Property / cites work
 
Property / cites work: HIGH DIMENSIONAL ESTIMATION VIA SUM-OF-SQUARES PROOFS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2959905 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5302097 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Monotone Complexity of $k$-Clique on Random Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the maximal size of large-average and ANOVA-fit submatrices in a Gaussian random matrix / rank
 
Normal rank
Property / cites work
 
Property / cites work: Provable Sparse Tensor Decomposition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Community detection in sparse random networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Statistical and computational trade-offs in estimation of sparse principal components / rank
 
Normal rank
Property / cites work
 
Property / cites work: Three-way clustering of multi-tissue multi-individual gene expression data using semi-nonnegative tensor decomposition / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Sup-norm Perturbation of HOSVD and Low Rank Tensor Denoising / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rank-One Approximation to High Order Tensors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Sparse Singular Value Decomposition for High-Dimensional High-Order Data / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tensor SVD: Statistical and Computational Limits / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3026325780 / rank
 
Normal rank

Latest revision as of 11:53, 30 July 2024

scientific article
Language Label Description Also known as
English
Tensor clustering with planted structures: statistical optimality and computational limits
scientific article

    Statements

    Tensor clustering with planted structures: statistical optimality and computational limits (English)
    0 references
    0 references
    0 references
    23 March 2022
    0 references
    average-case complexity
    0 references
    high-order clustering
    0 references
    hypergraphic planted clique
    0 references
    hypergraphic planted dense subgraph
    0 references
    statistical-computational phase transition
    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