Pages that link to "Item:Q896557"

The following pages link to Finding hidden cliques of size \(\sqrt{N/e}\) in nearly linear time (Q896557):

Displaying 24 items.

• Convex optimization for the densest subgraph and densest submatrix problems (Q142862) (← links)
• High dimensional robust M-estimation: asymptotic variance via approximate message passing (Q343797) (← links)
• Guaranteed recovery of planted cliques and dense subgraphs by convex relaxation (Q896191) (← links)
• Notes on computational-to-statistical gaps: predictions using statistical physics (Q1729830) (← links)
• Universality of approximate message passing algorithms (Q2042851) (← links)
• On the computational tractability of statistical estimation on amenable graphs (Q2067660) (← links)
• Notes on computational hardness of hypothesis testing: predictions using the low-degree likelihood ratio (Q2103494) (← links)
• Tensor clustering with planted structures: statistical optimality and computational limits (Q2119244) (← links)
• Computational barriers to estimation from low-degree polynomials (Q2149001) (← links)
• The likelihood ratio test in high-dimensional logistic regression is asymptotically a rescaled Chi-square (Q2273603) (← links)
• Consistency of spectral clustering in stochastic block models (Q2338925) (← links)
• Sparsistency and agnostic inference in sparse PCA (Q2338928) (← links)
• Robust and computationally feasible community detection in the presence of arbitrary outlier nodes (Q2352734) (← links)
• Computational barriers in minimax submatrix detection (Q2352736) (← links)
• Do semidefinite relaxations solve sparse PCA up to the information limit? (Q2352742) (← links)
• Fundamental limits of weak recovery with applications to phase retrieval (Q2420637) (← links)
• Estimation of low-rank matrices via approximate message passing (Q2656598) (← links)
• Asymptotic Optimality of Constant-Order Policies for Lost Sales Inventory Models with Large Lead Times (Q3186534) (← links)
• Constrained low-rank matrix estimation: phase transitions, approximate message passing and applications (Q3303137) (← links)
• Parallel tempering for the planted clique problem (Q3303299) (← links)
• Recovering a hidden community beyond the Kesten–Stigum threshold in <i>O</i>(|<i>E</i>|log^*|<i>V</i>|) time (Q4684942) (← links)
• Mismatching as a tool to enhance algorithmic performances of Monte Carlo methods for the planted clique model (Q5020005) (← links)
• The committee machine: computational to statistical gaps in learning a two-layers neural network (Q5854128) (← links)
• Planted Dense Subgraphs in Dense Random Graphs Can Be Recovered using Graph-based Machine Learning (Q5870483) (← links)