Pages that link to "Item:Q2196237"

The following pages link to Statistical and computational limits for sparse matrix detection (Q2196237):

Displaying 8 items.

• Sharp detection of smooth signals in a high-dimensional sparse matrix with indirect observations (Q503078) (← links)
• Detection boundary in sparse regression (Q1952112) (← links)
• Tensor clustering with planted structures: statistical optimality and computational limits (Q2119244) (← links)
• MAP and Bayes tests in sparse vectors detection (Q2137736) (← links)
• Computational barriers to estimation from low-degree polynomials (Q2149001) (← links)
• Connection between the selection problem for a sparse submatrix of a large-size matrix and the Bayesian problem of hypotheses testing (Q2199139) (← links)
• A goodness-of-fit test on the number of biclusters in a relational data matrix (Q6058528) (← links)
• Overparameterized maximum likelihood tests for detection of sparse vectors (Q6137612) (← links)