Aug 2026· Statistical analysis and data mining· Vol 19· 0 citations· 13 references
TL;DR
The Bayesian sparse Kronecker product decomposition (BSKPD) is proposed, which represents a regression or classification coefficient tensor as a low‐rank sum of Kronecker products of sparse component tensors, and establishes identifiability and posterior consistency in both classical and high‐dimensional regimes.
Abstract
High‐dimensional tensor‐valued predictors are now routine in neuroimaging and other data‐rich domains, yet few statistical frameworks can jointly analyze continuous, binary, and count outcomes while scaling to realistic image resolutions. We propose the
Bayesian sparse Kronecker product decomposition
(BSKPD), which represents a regression or classification coefficient tensor as a low‐rank sum of Kronecker products of sparse component tensors. A sparse Kronecker product decomposition transformation reshapes tensor predictors and coefficients into lower‐dimensional matrices, enabling voxel‐level computation through standard matrix operations while preserving spatial structure. Sparsity is induced by a three‐parameter Beta–Normal (TPBN) global–local shrinkage prior on the Kronecker factors, yielding parsimonious and interpretable coefficient tensors that highlight informative brain regions. A unified exponential‐family formulation accommodates Gaussian, Bernoulli, and negative‐binomial responses, and Pólya–Gamma augmentation leads to closed‐form Gibbs updates. We establish identifiability and posterior consistency in both classical and high‐dimensional regimes, extending Bayesian theory to mixed‐type multivariate tensor regression. Simulations and Alzheimer's disease neuroimaging applications show that BSKPD yields interpretable whole‐brain coefficient maps while maintaining competitive predictive accuracy relative to existing approaches.
Multidimensional array data, or tensors, arise naturally in neuroimaging and other high-dimensional applications. We propose a parsimonious Bayesian tensor regression model for studies in which a brain image is the response and predictors are vector-valued covariates. The method extends Bayesian envelope dimension redu...
Z. Naji, M. Fuentes, Liang-Suo Ma et al.· 1 citation
Low-rank tensor factorization provides a flexible framework for completing multidimensional data from incomplete and corrupted observations. However, unweighted spectral regularizers impose a common shrinkage profile across singular components, which may excessively attenuate dominant low-rank components, and factorize...
Bing-Hao Wang, Feng Zhang, Wen-Dong Wang et al.· 0 citations
A unified framework for scalable estimation of tensor covariances based on a Kronecker-structured sparse inverse Cholesky (KSIC) projection, proving that the KSIC estimator gainfully exploits cross-mode information and is robust to data scarcity.
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.· IEEE Transactions on Image P...· 0 citations
Multilinear principal component analysis (MPCA) reduces the dimension of tensor-valued data while preserving their mode-specific structure, but its quadratic scatter criterion can be unstable under heavy-tailed distributions and contamination. We propose spatial-sign-based multilinear principal component analysis (SMPC...
Dong-Xu Yang, Wanfeng Liang, Le Zhou et al.· 0 citations
Tensor‐valued diffusion MRI enables disentangling microscopic diffusion anisotropy and isotropic heterogeneity through models such as diffusional variance decomposition (DIVIDE) and diffusion tensor distributions (DTD). However, these models require dense sampling across multiple
b
‐values and b‐tensor shapes, ma...
Cheng Yang, Jing-Guo Yan, Zi-Han Zhou et al.· Journal of Intelligent Medic...· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.