YIHONG WU THESIS

Computational and statistical boundaries for submatrix localization in a large noisy matrix Cai, T. Keywords Asymptotic equivalence high-dimensional statistics computational complexity minimax rate planted clique submatrix detection. You do not have access to this content. We provide proofs of Theorem 1 and Lemmas 5 and 6. More by Zongming Ma Search this author in: Under the hypothesis that the planted clique detection problem cannot be solved in randomized polynomial time when the clique size is of smaller order than the square root of the graph size, the following phase transition phenomenon is established:

Minimax procedures Keywords Asymptotic equivalence high-dimensional statistics computational complexity minimax rate planted clique submatrix detection Citation Ma, Zongming; Wu, Yihong. Zentralblatt MATH identifier More by Zongming Ma Search this author in: Article information Source Ann. We provide proofs of Theorem 1 and Lemmas 5 and 6. MR Digital Object Identifier: Download Email Please enter a valid email address.

Under the hypothesis that the planted clique detection problem cannot be solved in randomized polynomial time when the clique size is of smaller order than the square root of the graph size, the following phase transition phenomenon is established: Implications on the hardness of support recovery are also obtained.

  VTAC PERSONAL STATEMENT ACADEMIC PERFORMANCE

yihong wu thesis

Using Schatten norm loss as a representative example, we show that the hardness of attaining the minimax estimation rate can crucially depend on the loss function. You have partial access to this content.

yihonf

This paper studies the minimax detection of a small submatrix of elevated mean in a large matrix contaminated by additive Gaussian noise. MR Digital Object Identifier: Zentralblatt MATH identifier We provide proofs of Theorem 1 and Lemmas 5 and 6. Minimax procedures Keywords Asymptotic equivalence high-dimensional statistics computational complexity minimax rate planted clique submatrix detection Citation Ma, Zongming; Wu, Yihong.

Shannon Theory for Compressed Sensing

Download Email Please enter a valid email address. More like this Computational and statistical boundaries for submatrix localization in a large noisy matrix Cai, T. Yiuong [1] Addario-Berry, L. To investigate the tradeoff between statistical performance and computational cost from a complexity-theoretic perspective, we consider a sequence of discretized models which are asymptotically equivalent to the Gaussian model. You have access to this content.

  JAGJIVAN RAM ESSAY COMPETITION

Yihong Wu :: ECE ILLINOIS

Permanent link to this wy https: Computational barriers in minimax submatrix detection. More by Yihong Wu Search this author in: More by Zongming Ma Search this author in: Keywords Asymptotic equivalence high-dimensional statistics computational complexity minimax rate planted clique submatrix detection.

yihong wu thesis

Computational and statistical boundaries for submatrix localization in a large noisy matrix Cai, T. Ma, Zongming; Wu, Yihong.

Publications

You do not have access to this content. On combinatorial testing problems.

yihong wu thesis

Article information Source Ann. Google Scholar Project Euclid.

December First available in Project Euclid: Abstract Article info and citation First page References Supplemental materials Abstract This paper studies the minimax detection of a small submatrix of elevated mean in a large matrix contaminated by additive Gaussian noise.

Author: admin