← Search

Paolo Penna

2 accepted papers

2022

Statistical and computational thresholds for the planted k-densest sub-hypergraph problem

AISTATS 2022poster

In this work, we consider the problem of recovery a planted k-densest sub-hypergraph on d-uniform hypergraphs. This fundamental problem appears in different contexts, e.g., community detection, average-case complexity, and neuroscience applications as a structural variant of tensor-PCA problem. We p…

Cited by 7SourcePDFScholar