Pages that link to "Item:Q2352736"

The following pages link to Computational barriers in minimax submatrix detection (Q2352736):

Displaying 26 items.

• Comment on ``Hypothesis testing by convex optimization'' (Q491382) (← links)
• Optimal rates of statistical seriation (Q1715546) (← links)
• Notes on computational-to-statistical gaps: predictions using statistical physics (Q1729830) (← links)
• Optimality and sub-optimality of PCA. I: Spiked random matrix models (Q1800806) (← links)
• Minimax rates in network analysis: graphon estimation, community detection and hypothesis testing (Q2038283) (← links)
• The overlap gap property in principal submatrix recovery (Q2067659) (← links)
• Optimal adaptivity of signed-polygon statistics for network testing (Q2073714) (← links)
• A sieve stochastic gradient descent estimator for online nonparametric regression in Sobolev ellipsoids (Q2105198) (← links)
• Isotonic regression with unknown permutations: statistics, computation and adaptation (Q2119231) (← links)
• Tensor clustering with planted structures: statistical optimality and computational limits (Q2119244) (← links)
• Computational barriers to estimation from low-degree polynomials (Q2149001) (← links)
• Statistical and computational limits for sparse matrix detection (Q2196237) (← links)
• Estimation of Monge matrices (Q2203631) (← links)
• Phase transitions for detecting latent geometry in random graphs (Q2210754) (← links)
• Optimal testing for planted satisfiability problems (Q2259537) (← links)
• Computational barriers in minimax submatrix detection (Q2352736) (← links)
• Distribution-free detection of a submatrix (Q2400812) (← links)
• Estimation of Wasserstein distances in the spiked transport model (Q2676937) (← links)
• Parallel tempering for the planted clique problem (Q3303299) (← links)
• Submatrix localization via message passing (Q4558513) (← links)
• ECA: High-Dimensional Elliptical Component Analysis in Non-Gaussian Distributions (Q4690955) (← links)
• Distribution-Free, Size Adaptive Submatrix Detection with Acceleration (Q5110726) (← links)
• The Average-Case Complexity of Counting Cliques in Erdös--Rényi Hypergraphs (Q5157395) (← links)
• The Sup-norm Perturbation of HOSVD and Low Rank Tensor Denoising (Q5381114) (← links)
• A Unifying Tutorial on Approximate Message Passing (Q5863992) (← links)
• A goodness-of-fit test on the number of biclusters in a relational data matrix (Q6058528) (← links)