TENSOR CLUSTERING WITH PLANTED STRUCTURES: STATISTICAL OPTIMALITY AND COMPUTATIONAL LIMITS

doi:10.1214/21-AOS2123

Return

TENSOR CLUSTERING WITH PLANTED STRUCTURES: STATISTICAL OPTIMALITY AND COMPUTATIONAL LIMITS

2022-02-01

Yuetian Luo *

Anru R. Zhang

DOI：10.1214/21-AOS2123

Original

Original request for help

Save

Abstract

En 中文

This paper studies the statistical and computational limits of high-order clustering with planted structures. We focus on two clustering models, constant high-order clustering (CHC) and rank-one higher-order clustering (ROHC), and study the methods and theory for testing whether a cluster exists (detection) and identifying the support of cluster (recovery). Specifically, we identify the sharp boundaries of signal-to-noise ratio for which CHC and ROHC detection/recovery are statistically possible. We also develop the tight computational thresholds: when the signal-to-noise ratio is below these thresholds, we prove that polynomial-time algorithms cannot solve these problems under the computational hardness conjectures of hypergraphic planted clique (HPC) detection and hyper-graphic planted dense subgraph (HPDS) recovery. We also propose polynomial-time tensor algorithms that achieve reliable detection and recovery when the signal-to-noise ratio is above these thresholds. Both sparsity and tensor structures yield the computational barriers in high-order tensor clustering. The interplay between them results in significant differences between high-order tensor clustering and matrix clustering in literature in aspects of statistical and computational phase transition diagrams, algorithmic approaches, hardness conjecture, and proof techniques. To our best knowledge, we are the first to give a thorough characterization of the statistical and computational trade-off for such a double computational-barrier problem. Finally, we provide evidence for the computational hardness conjectures of HPC detection (via low-degree polynomial and Metropolis methods) and HPDS recovery (via low-degree polynomial method).

Keywords:

Average-case complexity

high-order clustering

hypergraphic planted clique

hypergraphic planted dense subgraph

statistical-computational phase transition