Computational barriers to estimation from low-degree polynomials (Q2149001): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: LAS / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: On basing one-way functions on NP-hardness / rank
 
Normal rank
Property / cites work
 
Property / cites work: Detection of an anomalous cluster in a network / rank
 
Normal rank
Property / cites work
 
Property / cites work: Community detection in dense random networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Phase transition of the largest eigenvalue for nonnull complex sample covariance matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Eigenvalues of large sample covariance matrices of spiked population models / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5875785 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Lovász Theta Function for Random Regular Graphs and Community Detection in the Hard Regime / 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: The Dynamics of Message Passing on Dense Graphs, with Applications to Compressed Sensing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic thresholds for tensor PCA / rank
 
Normal rank
Property / cites work
 
Property / cites work: The eigenvalues and eigenvectors of finite, low rank perturbations of large random matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Detecting high log-densities / rank
 
Normal rank
Property / cites work
 
Property / cites work: How to iron out rough landscapes and get optimal performances: averaged gradient descent and its application to tensor PCA / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Worst‐Case to Average‐Case Reductions for NP Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An iterative construction of solutions of the TAP equations for the Sherrington-Kirkpatrick model / 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: The largest eigenvalues of finite rank deformation of large Wigner matrices: Convergence and nonuniversality of the fluctuations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Suboptimality of local algorithms for a class of max-cut problems / 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: Q5009502 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Walksat Stalls Well Below Satisfiability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Asymptotic mutual information for the balanced binary stochastic block model / 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: Higher criticism for detecting sparse heterogeneous mixtures. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4999009 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Random-Self-Reducibility of Complete Sets / 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: The largest eigenvalue of rank one deformation of large Wigner matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: The overlap gap property and approximate message passing algorithms for \(p\)-spin models / rank
 
Normal rank
Property / cites work
 
Property / cites work: The overlap gap property in principal submatrix recovery / 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: Submatrix localization via message passing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast spectral algorithms from sum-of-squares proofs: tensor decomposition and planted sparse vectors / rank
 
Normal rank
Property / cites work
 
Property / cites work: State evolution for general approximate message passing algorithms, with applications to spatial coupling / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Consistency and Sparsity for Principal Components Analysis in High Dimensions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient noise-tolerant learning from statistical queries / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sum of squares lower bounds for refuting any CSP / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational barriers in minimax submatrix detection / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lifting sum-of-squares lower bounds: degree-2 to degree-4 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Estimation of low-rank matrices via approximate message passing / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the degree of Boolean functions as real polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2930842 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimality and sub-optimality of PCA. I: Spiked random matrix 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: Local algorithms for independent sets are half-optimal / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding large average submatrices in high dimensional data / 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: Optimal low-degree hardness of maximum independent set / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tensor SVD: Statistical and Computational Limits / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 11:33, 29 July 2024

scientific article
Language Label Description Also known as
English
Computational barriers to estimation from low-degree polynomials
scientific article

    Statements

    Computational barriers to estimation from low-degree polynomials (English)
    0 references
    0 references
    0 references
    24 June 2022
    0 references
    computational complexity
    0 references
    low-degree polynomials
    0 references
    planted dense subgraph
    0 references
    planted submatrix
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers