A Blind Block Term Decomposition of High Order Tensors

Authors

  • Yunfeng Cai Baidu Research
  • Ping Li Baidu Research

Keywords:

Matrix & Tensor Methods

Abstract

Tensor decompositions have found many applications in signal processing, data mining, machine learning, etc. In particular, the block term decomposition (BTD), which is a generalization of CP decomposition and Tucker decomposition/HOSVD, has been successfully used for the compression and acceleration of neural networks. However, computing BTD is NP-hard, and optimization based methods usually suffer from slow convergence or even fail to converge, which limits the applications of BTD. This paper considers a “blind” block term decomposition (BBTD) of high order tensors, in which the block diagonal structure of the core tensor is unknown. Our contributions include: 1) We establish the necessary and sufficient conditions for the existence of BTD, characterize the condition when a BTD solves the BBTD problem, and show that the BBTD is unique under a “low rank” assumption. 2) We propose an algebraic method to compute the BBTD. This method transforms the problem of determining the block diagonal structure of the core tensor into a clustering problem of complex numbers, in polynomial time. And once the clustering problem is solved, the BBTD can be obtained via computing several matrix decompositions. Numerical results show that our method is able to compute the BBTD, even in the presence of noise to some extent, whereas optimization based methods (e.g., MINF and NLS in TENSORLAB) may fail to converge.

Downloads

Published

2021-05-18

How to Cite

Cai, Y., & Li, P. (2021). A Blind Block Term Decomposition of High Order Tensors. Proceedings of the AAAI Conference on Artificial Intelligence, 35(8), 6868-6876. Retrieved from https://ojs.aaai.org/index.php/AAAI/article/view/16847

Issue

Section

AAAI Technical Track on Machine Learning I