The All-or-Nothing Phenomenon in Sparse Tensor PCA

v1v2 (latest)

The All-or-Nothing Phenomenon in Sparse Tensor PCA

22 July 2020

Jonathan Niles-Weed

ArXiv (abs)PDF HTML

Papers citing "The All-or-Nothing Phenomenon in Sparse Tensor PCA"

10 / 10 papers shown

Title
Sharp Thresholds Imply Circuit Lower Bounds: from random 2-SAT to Planted Clique D. Gamarnik Elchanan Mossel Ilias Zadik 92 3 0 07 Nov 2023
Sharp thresholds in inference of planted subgraphs Elchanan Mossel Jonathan Niles-Weed Youngtak Sohn Nike Sun Ilias Zadik 66 6 0 28 Feb 2023
Statistical and Computational Phase Transitions in Group Testing A. Coja-Oghlan Oliver Gebhard Max Hahn-Klimroth Alexander S. Wein Ilias Zadik 75 21 0 15 Jun 2022
Performance of Bayesian linear regression in a model with mismatch Jean Barbier Wei-Kuo Chen D. Panchenko Manuel Sáenz 89 22 0 14 Jul 2021
Fundamental limits for rank-one matrix estimation with groupwise heteroskedasticity Joshua K. Behne Galen Reeves 60 12 0 22 Jun 2021
The Complexity of Sparse Tensor PCA Davin Choo Tommaso dÓrsi 52 8 0 11 Jun 2021
It was "all" for "nothing": sharp phase transitions for noiseless discrete channels Jonathan Niles-Weed Ilias Zadik 71 10 0 24 Feb 2021
On maximum-likelihood estimation in the all-or-nothing regime Luca Corinzia Paolo Penna Wojtek Szpankowski J. M. Buhmann 23 1 0 25 Jan 2021
Statistical and computational thresholds for the planted $k$ -densest sub-hypergraph problem Luca Corinzia Paolo Penna Wojtek Szpankowski J. M. Buhmann 53 6 0 23 Nov 2020
Tensor Clustering with Planted Structures: Statistical Optimality and Computational Limits Yuetian Luo Anru R. Zhang 134 46 0 21 May 2020