REVIEW 4 cited by
Statistical and Computational Limits for Sparse Matrix Detection
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
Signed reviews
abstract
This paper investigates the fundamental limits for detecting a high-dimensional sparse matrix contaminated by white Gaussian noise from both the statistical and computational perspectives. We consider $p\times p$ matrices whose rows and columns are individually $k$-sparse. We provide a tight characterization of the statistical and computational limits for sparse matrix detection, which precisely describe when achieving optimal detection is easy, hard, or impossible, respectively. Although the sparse matrices considered in this paper have no apparent submatrix structure and the corresponding estimation problem has no computational issue at all, the detection problem has a surprising computational barrier when the sparsity level $k$ exceeds the cubic root of the matrix size $p$: attaining the optimal detection boundary is computationally at least as hard as solving the planted clique problem. The same statistical and computational limits also hold in the sparse covariance matrix model, where each variable is correlated with at most $k$ others. A key step in the construction of the statistically optimal test is a structural property for sparse matrices, which can be of independent interest.
Forward citations
Cited by 4 Pith papers
-
On optimal distinguishers for Planted Clique
Under the Planted Clique Hypothesis, the optimal efficient distinguishing advantage for Planted Clique is (1+o(1))*k^2/(sqrt(pi)*n), and there exist planted distributions that are much harder to detect than the usual one.
-
Average-Case Lower Bounds for Learning Sparse Mixtures, Robust Estimation and Semirandom Adversaries
Assuming a k-partite planted clique conjecture, the authors prove tight k-to-k^2 sample-complexity lower bounds for robust sparse mean estimation, semirandom community recovery, and a universal class of sparse mixture...
-
Fundamental Limits of Query-Based Subgraph Detection
For non-adaptive edge-query detection of arbitrary planted subgraphs, the minimum query count is governed by whether the planted graph has dense local witnesses, high-degree hubs, or just many edges.
-
Recovery of Planted Subgraphs
Sharp conditions for exact recovery of general planted subgraphs in ER graphs are given by the minimal maximum subgraph density, with matching bounds, a spectral algorithm, and computational hardness results via low-d...
Discussion (0). Continue with ORCID to comment.