A Bayesian Approach to Block-Term Tensor Decomposition Model Selection and Computation

01/08/2021
by   Paris V. Giampouras, et al.
0

The so-called block-term decomposition (BTD) tensor model, especially in its rank-(L_r,L_r,1) version, has been recently receiving increasing attention due to its enhanced ability of representing systems and signals that are composed of blocks of rank higher than one, a scenario encountered in numerous and diverse applications. Its uniqueness and approximation have thus been thoroughly studied. Nevertheless, the challenging problem of estimating the BTD model structure, namely the number of block terms and their individual ranks, has only recently started to attract significant attention. In this work, a Bayesian approach is taken to addressing the problem of rank-(L_r,L_r,1) BTD model selection and computation, based on the idea of imposing column sparsity jointly on the factors and in a hierarchical manner and estimating the ranks as the numbers of factor columns of non-negligible energy. Using variational inference in the proposed probabilistic model results in an iterative algorithm that comprises closed-form updates. Its Bayesian nature completely avoids the ubiquitous in regularization-based methods task of hyper-parameter tuning. Simulation results with synthetic data are reported, which demonstrate the effectiveness of the proposed scheme in terms of both rank estimation and model fitting.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
06/20/2021

Online Rank-Revealing Block-Term Tensor Decomposition

The so-called block-term decomposition (BTD) tensor model, especially in...
research
02/22/2020

Block-Term Tensor Decomposition: Model Selection and Computation

The so-called block-term decomposition (BTD) tensor model has been recen...
research
09/07/2018

Tensor Ring Decomposition with Rank Minimization on Latent Space: An Efficient Approach for Tensor Completion

In tensor completion tasks, the traditional low-rank tensor decompositio...
research
10/09/2014

Bayesian Robust Tensor Factorization for Incomplete Multiway Data

We propose a generative model for robust tensor factorization in the pre...
research
09/05/2020

Towards Probabilistic Tensor Canonical Polyadic Decomposition 2.0: Automatic Tensor Rank Learning Using Generalized Hyperbolic Prior

Tensor rank learning for canonical polyadic decomposition (CPD) has long...
research
02/06/2016

A Tractable Fully Bayesian Method for the Stochastic Block Model

The stochastic block model (SBM) is a generative model revealing macrosc...
research
05/08/2022

Fast and Structured Block-Term Tensor Decomposition For Hyperspectral Unmixing

The block-term tensor decomposition model with multilinear rank-(L_r,L_r...

Please sign up or login with your details

Forgot password? Click here to reset