paper-with-me

Papers

Low-Multi-Rank High-Order Bayesian Robust Tensor Factorization

2023-11-10 · Jianan Liu, Chunguang Li

The recently proposed tensor robust principal component analysis (TRPCA) methods based on tensor singular value decomposition (t-SVD) have achieved numerous successes in many fields. However, most of these methods are only applicable to third-order tensors, whereas the data obtained in practice are often of higher order, such as fourth-order color videos, fourth-order hyperspectral videos, and fifth-order light-field images. Additionally, in the t-SVD framework, the multi-rank of a tensor can describe more fine-grained low-rank structure in the tensor compared with the tubal rank. However, determining the multi-rank of a tensor is a much more difficult problem than determining the tubal rank. Moreover, most of the existing TRPCA methods do not explicitly model the noises except the sparse noise, which may compromise the accuracy of estimating the low-rank tensor. In this work, we propose a novel high-order TRPCA method, named as Low-Multi-rank High-order Bayesian Robust Tensor Factorization (LMH-BRTF), within the Bayesian framework. Specifically, we decompose the observed corrupted tensor into three parts, i.e., the low-rank component, the sparse component, and the noise component. By constructing a low-rank model for the low-rank component based on the order-$d$ t-SVD and introducing a proper prior for the model, LMH-BRTF can automatically determine the tensor multi-rank. Meanwhile, benefiting from the explicit modeling of both the sparse and noise components, the proposed method can leverage information from the noises more effectivly, leading to an improved performance of TRPCA. Then, an efficient variational inference algorithm is established for parameters estimation. Empirical studies on synthetic and real-world datasets demonstrate the effectiveness of the proposed method in terms of both qualitative and quantitative results.

📄 PDF Abstract BibTeX arXiv:2311.05888

Code (0)

등록된 구현이 없습니다.

Tasks

Variational Inference

Methods 이 논문이 사용한 방법론

Variational Inference 설명 없음

Similar Papers 제목 키워드 기반

Tensor Decomposition via Variational Auto-Encoder

2016-11-03 · Bin Liu, Zenglin Xu, Yingming Li

Tensor decomposition is an important technique for capturing the high-order interactions among multiway data. Multi-linear tensor composition methods, such as the Tucker decomposition and the CANDECOMP/PARAFAC (CP), assu…

Missing ValuesTensor Decomposition

Low-Rank Tensor Completion: A Pseudo-Bayesian Learning Approach

2017-10-01 · ICCV 2017 10 · Wei Chen, Nan Song

Low rank tensor completion, which solves a linear inverse problem with the principle of parsimony, is a powerful technique used in many application domains in computer vision and pattern recognition. As a surrogate funct…

Tensor Regression Meets Gaussian Processes

2017-10-31 · Rose Yu, Guangyu Li, Yan Liu

Low-rank tensor regression, a new model class that learns high-order correlation from data, has recently received considerable attention. At the same time, Gaussian processes (GP) are well-studied machine learning models…

Bayesian InferenceGaussian Processesregression

Probabilistic Block Term Decomposition for the Modelling of Higher-Order Arrays

2023-10-04 · Jesper Løve Hinrich, Morten Mørup

Tensors are ubiquitous in science and engineering and tensor factorization approaches have become important tools for the characterization of higher order structure. Factorizations includes the outer-product rank Canonic…

Bayesian Inference

Bayesian Tensorized Neural Networks with Automatic Rank Selection

2019-05-24 · Cole Hawkins, Zheng Zhang

Tensor decomposition is an effective approach to compress over-parameterized neural networks and to enable their deployment on resource-constrained hardware platforms. However, directly applying tensor compression in the…

Model CompressionTensor Decomposition