Computational and Statistical Boundaries for Submatrix Localization in a
Large Noisy Matrix

Computational and Statistical Boundaries for Submatrix Localization in a Large Noisy Matrix

6 February 2015

T. Tony Cai

Alexander Rakhlin

Papers citing "Computational and Statistical Boundaries for Submatrix Localization in a Large Noisy Matrix"

14 / 14 papers shown

Title
DBSCAN of Multi-Slice Clustering for Third-Order Tensors Dina Faneva Andriantsiory J. B. Geloun M. Lebbah 10 1 0 14 Mar 2023
Inferring Hidden Structures in Random Graphs Wasim Huleihel 19 7 0 05 Oct 2021
Random Subgraph Detection Using Queries Wasim Huleihel A. Mazumdar S. Pal 25 6 0 02 Oct 2021
Lattice partition recovery with dyadic CART Oscar Hernan Madrid Padilla Yi Yu Alessandro Rinaldo 21 4 0 27 May 2021
A Goodness-of-fit Test on the Number of Biclusters in a Relational Data Matrix C. Watanabe Taiji Suzuki 25 0 0 23 Feb 2021
Computationally efficient sparse clustering Matthias Löffler Alexander S. Wein Afonso S. Bandeira 35 14 0 21 May 2020
Tensor Clustering with Planted Structures: Statistical Optimality and Computational Limits Yuetian Luo Anru R. Zhang 35 44 0 21 May 2020
Reducibility and Statistical-Computational Gaps from Secret Leakage Matthew Brennan Guy Bresler 29 86 0 16 May 2020
Estimation of Wasserstein distances in the Spiked Transport Model Jonathan Niles-Weed Philippe Rigollet 25 102 0 16 Sep 2019
Optimal Average-Case Reductions to Sparse PCA: From Weak Assumptions to Strong Hardness Matthew Brennan Guy Bresler 29 50 0 20 Feb 2019
Universality of Computational Lower Bounds for Submatrix Detection Matthew Brennan Guy Bresler Wasim Huleihel 35 26 0 19 Feb 2019
Tensor SVD: Statistical and Computational Limits Anru R. Zhang Dong Xia 21 166 0 08 Mar 2017
Improved Sum-of-Squares Lower Bounds for Hidden Clique and Hidden Submatrix Problems Y. Deshpande Andrea Montanari 27 84 0 23 Feb 2015
Detection of Planted Solutions for Flat Satisfiability Problems Quentin Berthet J. Ellenberg 35 6 0 21 Feb 2015