Statistical Problems with Planted Structures: Information-Theoretical
and Computational Limits

Statistical Problems with Planted Structures: Information-Theoretical and Computational Limits

31 May 2018

Jiaming Xu

Papers citing "Statistical Problems with Planted Structures: Information-Theoretical and Computational Limits"

11 / 11 papers shown

Title
Precise Asymptotic Generalization for Multiclass Classification with Overparameterized Linear Models David X. Wu A. Sahai 26 2 0 23 Jun 2023
Statistical and computational rates in high rank tensor estimation Chanwoo Lee Miaoyan Wang 25 1 0 08 Apr 2023
Localized geometry detection in scale-free random graphs G. Bet Riccardo Michielan C. Stegehuis 17 0 0 06 Mar 2023
Detecting Correlated Gaussian Databases Zeynep K B. Nazer FedML 30 13 0 23 Jun 2022
Robust Testing in High-Dimensional Sparse Models Anand George C. Canonne 33 3 0 16 May 2022
Inferring Hidden Structures in Random Graphs Wasim Huleihel 14 7 0 05 Oct 2021
Random Subgraph Detection Using Queries Wasim Huleihel A. Mazumdar S. Pal 23 6 0 02 Oct 2021
Tensor Clustering with Planted Structures: Statistical Optimality and Computational Limits Yuetian Luo Anru R. Zhang 24 44 0 21 May 2020
Reducibility and Statistical-Computational Gaps from Secret Leakage Matthew Brennan Guy Bresler 19 85 0 16 May 2020
Universality of Computational Lower Bounds for Submatrix Detection Matthew Brennan Guy Bresler Wasim Huleihel 27 26 0 19 Feb 2019
Partial Recovery of Erdős-Rényi Graph Alignment via $k$ -Core Alignment Daniel Cullina Negar Kiyavash Prateek Mittal H. Vincent Poor 33 50 0 10 Sep 2018