Skip to content

Bayesian sparse tensor wheel decomposition for missing data recovery

Oct 2026 · Science China Technological Sciences · Vol 69 · 0 citations · 42 references

TL;DR

The main innovation of the proposed BTW model lies in introducing a structured sparsity prior into TW decomposition, which enables automatic TW-rank determination during Bayesian inference, eliminating the need for cumbersome manual rank selection.

View source

Similar papers

Sep 2026

Bayesian Robust Fully-Connected Tensor Network Decomposition for Visual Data Denoising

Tensor Robust Principal Component Analysis (TRPCA) aims to recover low-rank and sparse components from the noisy tensor data, which has attracted significant attention in visual data denoising. However, existing CANDECOMP/PARAFAC (CP) and Tucker decomposition methods fail to fully exploit inter-dimensional correlations...

Chang-Long Li, Ze-Can Yang, Laurence T. Yang et al. · 0 citations
Preprint Oct 2026

Noisy Matrix Completion under Informative Missingness

Noisy matrix completion is a fundamental problem in statistical learning and has attracted a substantial amount of interest over the last two decades. In a variety of applications, the missingness pattern is highly informative, yet it has received relatively less attention. Most existing methods either overlook this so...

Xuan-Yu Chen, Xiao-Yue Niu, Gong-Jun Xu et al. · 0 citations
Open access Aug 2026

STOD: Sparse Tensor Train Optimization via Orthogonal Decomposition for High-Dimensional Learning

This paper proposes a novel Tensor Train (TT)-based tensor-on-tensor regression optimization framework for variable selection based on mode-1 hyperslice sparsity, and designs an alternating iterative algorithm equipped with a preconditioned metric to efficiently solve the proposed model.

Xiao-Yu Li, Zi-Yan Luo · 0 citations
Preprint Sep 2026

From Good Starts to Optimal Inference: Generalized Latent Factor Models with Missingness and Implicit Regularization

A theory is developed that connects a computationally tractable nonconvex procedure directly to statistical inference for nonlinear latent factor models with exponential-family links and partially observed entries with severe missingness, weak low-rank signals, and diminishing local curvature.

Cheng-Zhu Huang, Yu-Qi Gu · 0 citations
Open access Sep 2026

Tensor Completion using Subspace Information

Tensor completion has attracted significant attention in both applications and theoretical research. Under standard uniform sampling, existing polynomial-time guarantees generally require more observations than the number of degree of freedom, motivating the study of a possible statistical-to-computational gap in highl...

Jing-Yang Li, M. K. Ng · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.