DeepAI AI Chat
Log In Sign Up

Exact Clustering in Tensor Block Model: Statistical Optimality and Computational Limit

by   Rungang Han, et al.

High-order clustering aims to identify heterogeneous substructure in multiway dataset that arises commonly in neuroimaging, genomics, and social network studies. The non-convex and discontinuous nature of the problem poses significant challenges in both statistics and computation. In this paper, we propose a tensor block model and the computationally efficient methods, high-order Lloyd algorithm (HLloyd) and high-order spectral clustering (HSC), for high-order clustering in tensor block model. The convergence of the proposed procedure is established, and we show that our method achieves exact clustering under reasonable assumptions. We also give the complete characterization for the statistical-computational trade-off in high-order clustering based on three different signal-to-noise ratio regimes. Finally, we show the merits of the proposed procedures via extensive experiments on both synthetic and real datasets.


page 1

page 2

page 3

page 4


Tensor Clustering with Planted Structures: Statistical Optimality and Computational Limits

This paper studies the statistical and computational limits of high-orde...

Learning Tensor Latent Features

We study the problem of learning latent feature models (LFMs) for tensor...

Multiway Spherical Clustering via Degree-Corrected Tensor Block Models

We consider the problem of multiway clustering in the presence of unknow...

Integrating Tensor Similarity to Enhance Clustering Performance

Clustering aims to separate observed data into different categories. The...

Exact Partitioning of High-order Planted Models with a Tensor Nuclear Norm Constraint

We study the problem of efficient exact partitioning of the hypergraphs ...

Multiway clustering via tensor block models

We consider the problem of identifying multiway block structure from a l...

Uniform tensor clustering by jointly exploring sample affinities of various orders

Conventional clustering methods based on pairwise affinity usually suffe...