Learning from Binary Multiway Data: Probabilistic Tensor Decomposition and its Statistical Optimality

11/13/2018
by   Miaoyan Wang, et al.
0

We consider the problem of decomposition of multiway tensor with binary entries. Such data problems arise frequently in numerous applications such as neuroimaging, recommendation system, topic modeling, and sensor network localization. We propose that the observed binary entries follow a Bernoulli model, develop a rank-constrained likelihood-based estimation procedure, and obtain the theoretical accuracy guarantees. Specifically, we establish the error bound of the tensor estimation, and show that the obtained rate is minimax optimal under the considered model. We demonstrate the efficacy of our approach through both simulations and analyses of multiple real-world datasets on the tasks of tensor completion and clustering.

READ FULL TEXT

page 17

page 18

research
06/10/2019

Multiway clustering via tensor block models

We consider the problem of identifying multiway block structure from a l...
research
02/16/2020

Tensor denoising and completion based on ordinal observations

Higher-order tensors arise frequently in applications such as neuroimagi...
research
10/21/2019

Generalized tensor regression with covariates on multiple modes

We consider the problem of tensor-response regression given covariates o...
research
11/08/2021

Smooth tensor estimation with unknown permutations

We consider the problem of structured tensor denoising in the presence o...
research
06/27/2021

Sparse Logistic Tensor Decomposition for Binary Data

Tensor data are increasingly available in many application domains. We d...
research
08/24/2017

Dynamic Tensor Clustering

Dynamic tensor data are becoming prevalent in numerous applications. Exi...
research
03/31/2017

Fundamental Conditions for Low-CP-Rank Tensor Completion

We consider the problem of low canonical polyadic (CP) rank tensor compl...

Please sign up or login with your details

Forgot password? Click here to reset