Statistical and computational thresholds for the planted k-densest sub-hypergraph problem
- Working Paper
Rights / licenseCreative Commons Attribution 4.0 International
Recovery a planted signal perturbed by noise is a fundamental problem in machine learning. In this work, we consider the problem of recovery a planted k-densest sub-hypergraph on h-uniform hypergraphs over n nodes. This fundamental problem appears in different contexts, e.g., community detection, average case complexity, and neuroscience applications. We first observe that it can be viewed as a structural variant of tensor PCA in which the hypergraph parameters k and h determine the structure of the signal to be recovered when the observations are contaminated by Gaussian noise. In this work, we provide tight information-theoretic upper and lower bounds for the recovery problem, as well as the first non-trivial algorithmic bounds based on approximate message passing algorithms. The problem exhibits a typical information-to-computational-gap observed in analogous settings, that widens with increasing sparsity of the problem. Interestingly, the bounds show that the structure of the signal does have an impact on the existing bounds of tensor PCA that the unstructured planted signal does not capture. Show more
Journal / seriesarXiv
Pages / Article No.
Organisational unit03659 - Buhmann, Joachim M. / Buhmann, Joachim M.
02803 - Collegium Helveticum / Collegium Helveticum
Related publications and datasets
Is previous version of: http://hdl.handle.net/20.500.11850/578180
MoreShow all metadata