Sandra Essays

Zentralblatt MATH identifier Minimax procedures Keywords Asymptotic equivalence high-dimensional statistics computational complexity minimax rate planted clique submatrix detection Citation Ma, Zongming; Wu, Yihong. More by Yihong Wu Search this author in: You do not have access to this content. You have partial access to this content. We provide proofs of Theorem 1 and Lemmas 5 and 6.

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. December First available in Project Euclid: Zentralblatt MATH identifier More by Zongming Ma Search this author in: References [1] Addario-Berry, L. 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: More by Yihong Wu Search this author in:

On combinatorial testing problems.

yihong wu thesis

References [1] Addario-Berry, L. 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: We provide proofs of Theorem 1 and Lemmas 5 and 6. Computational and statistical boundaries for submatrix localization in a large noisy matrix Cai, T. Article information Source Ann.

  ODESK COVER LETTER FOR BOOKKEEPING

yihong wu thesis

Download Email Please enter a valid email address. Using Schatten norm loss as a representative thewis, we show that the hardness of attaining the minimax estimation rate can crucially depend on the loss function.

Yihong Wu :: ECE ILLINOIS

You have partial access to this content. You do not have access to this content.

yihong wu thesis

Zentralblatt MATH identifier 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.

You have access thfsis this content. Keywords Asymptotic equivalence high-dimensional statistics computational complexity minimax rate planted clique submatrix detection.

December First available in Project Euclid: Google Scholar Project Euclid. Ma, Zongming; Wu, Yihong. 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: More like this Computational and statistical boundaries for submatrix localization in a large noisy matrix Cai, T. More by Yihong Wu Search this author in: Computational barriers in minimax submatrix detection.

  BOSCASTLE FLOODS CASE STUDY

Publications

Permanent link to this document https: To investigate the tradeoff between statistical performance and computational cost from a complexity-theoretic perspective, we consider a sequence thesid discretized models which are asymptotically equivalent to the Gaussian model. Minimax procedures Keywords Asymptotic equivalence high-dimensional statistics computational complexity minimax rate planted clique submatrix detection Citation Ma, Zongming; Wu, Yihong. Implications on the hardness of support recovery are also obtained.