DeepAI AI Chat
Log In Sign Up

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

by   Chuyang Ke, et al.

In this paper we propose the first correct poly-time algorithm for exact partitioning of high-order models (a worst case NP-hard problem). We define a general class of m-degree Homogeneous Polynomial Models, which subsumes several examples motivated from prior literature. Exact partitioning can be formulated as a tensor optimization problem. We relax this NP-hard problem to a convex conic form problem (poly-time solvable by interior point methods). To this end, we carefully define the positive semidefinite tensor cone, and show its convexity, and the convexity of its dual cone. This allows us to construct a primal-dual certificate to show that the solution of the convex relaxation is correct (equal to the unobserved true group assignment) under some sample complexity conditions.


page 1

page 2

page 3

page 4


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

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

On the Complexity of Detecting Convexity over a Box

It has recently been shown that the problem of testing global convexity ...

The iteration time and the general position number in graph convexities

In this paper, we study two graph convexity parameters: iteration time a...

The Complexity of SPEs in Mean-payoff Games

We establish that the subgame perfect equilibrium (SPE) threshold proble...

Sparse Approximation Over the Cube

This paper presents an anlysis of the NP-hard minimization problem min{b...

Semidefinite Relaxations of Products of Nonnegative Forms on the Sphere

We study the problem of maximizing the geometric mean of d low-degree no...

Primal-Dual Optimization Algorithms over Riemannian Manifolds: an Iteration Complexity Analysis

In this paper we study nonconvex and nonsmooth multi-block optimization ...