DeepAI AI Chat
Log In Sign Up

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

by   Chuyang Ke, et al.
Purdue University

We study the problem of efficient exact partitioning of the hypergraphs generated by high-order planted models. A high-order planted model assumes some underlying cluster structures, and simulates high-order interactions by placing hyperedges among nodes. Example models include the disjoint hypercliques, the densest subhypergraphs, and the hypergraph stochastic block models. We show that exact partitioning of high-order planted models (a NP-hard problem in general) is achievable through solving a computationally efficient convex optimization problem with a tensor nuclear norm constraint. Our analysis provides the conditions for our approach to succeed on recovering the true underlying cluster structures, with high probability.


page 1

page 2

page 3

page 4


Exact Partitioning of High-order Models with a Novel Convex Tensor Cone Relaxation

In this paper we propose the first correct poly-time algorithm for exact...

Exact Inference in High-order Structured Prediction

In this paper, we study the problem of inference in high-order structure...

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

High-order clustering aims to identify heterogeneous substructure in mul...

On Polynomial Time Methods for Exact Low Rank Tensor Completion

In this paper, we investigate the sample size requirement for exact reco...

Regularized Recovery by Multi-order Partial Hypergraph Total Variation

Capturing complex high-order interactions among data is an important tas...

Learning Tensor Latent Features

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

Hypercore Decomposition for Non-Fragile Hyperedges: Concepts, Algorithms, Observations, and Applications

Hypergraphs are a powerful abstraction for modeling high-order relations...