Rank-Revealing Bayesian Block-Term Tensor Completion With Graph Information
- 23 January 2026
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Signal Processing
- Vol. 74 (1053587X) , 654-669
Abstract
Block-term decomposition (BTD), particularly its rank-(Lr,Lr, 1) special case, is widely used in signal processing. Traditional methods for computing BTD either unrealistically assume the number of blocks and block ranks are known or require exhaustive tuning of these parameters. While sparsity-promoting regularization has been introduced to estimate these parameters more efficiently, it still requires regularization parameter tuning. Bayesian learning addresses these issues by employing sparsity-promoting priors on the number of blocks and block ranks, but so far is limited to fully observed BTD tensors. To process incomplete BTD tensors, only a few optimization-based methods have been proposed, and they continue to suffer from heavy parameter tuning. To enable tuning-free BTD completion, a prior that simultaneously enforces block-wise sparsity and withinblock column-wise sparsity while incorporating graph structure is introduced within the Bayesian framework. Besides theoretically establishing the legitimacy of the prior distribution, a mean-field design is developed to obtain a closed-form updating variational inference (VI) algorithm without loss of graph information. Extensive experiments on both synthetic datasets and real-world datasets demonstrate the superiority of the proposed method over existing optimization-based algorithms and the Bayesian model without graph information, in terms of rank learning, tensor recovery, and factor recovery.Keywords
Funding Information
- Zhejiang Provincial Natural Science Foundation of China (LR26F010004)
- National Natural Science Foundation of China (62371418)
- Fundamental Research Funds for the Central Universities (226-2025-00168)
This publication has 51 references indexed in Scilit:
- On the tensor-based approach to adaptive joint channel estimation/data detection in flexible multicarrier MIMO systemsDigital Signal Processing, 2024
- Online rank-revealing block-term tensor decompositionSignal Processing, 2023
- Tensor train factorization under noisy and incomplete data with automatic rank estimationPattern Recognition, 2023
- Bayesian low-rank matrix completion with dual-graph embedding: Prior analysis and tuning-free inferenceSignal Processing, 2022
- Tensor Based Blind Source Separation in Longitudinal Magnetic Resonance Imaging Analysis2019
- Blind fMRI source unmixing via higher-order tensor decompositionsJournal of Neuroscience Methods, 2019
- Block term decomposition with rank estimation using group sparsity2017
- Parameter estimation in block term decomposition for noninvasive atrial fibrillation analysis2017
- Tensorlab 3.0 — Numerical optimization strategies for large-scale constrained and coupled matrix/tensor factorization2016
- Enhancing Sparsity by Reweighted ℓ 1 MinimizationJournal of Fourier Analysis and Applications, 2008