Noise-Augmented $\ell_0$ Regularization of Tensor Regression with Tucker Decomposition
Tian Yan, Yinan Li, Fang Liu

TL;DR
This paper introduces NA$_0$CT$^2$, a novel Tucker decomposition-based regularization method for tensor regression that achieves exact $\
Contribution
NA$_0$CT$^2$ is the first Tucker decomposition-based method to attain exact $\
Findings
NA$_0$CT$^2$ improves prediction accuracy over existing methods.
The method effectively identifies important predictors.
Theoretical guarantees for $\
Abstract
Tensor data are multi-dimension arrays. Low-rank decomposition-based regression methods with tensor predictors exploit the structural information in tensor predictors while significantly reducing the number of parameters in tensor regression. We propose a method named NACT (Noise Augmentation for regularization on Core Tensor in Tucker decomposition) to regularize the parameters in tensor regression (TR), coupled with Tucker decomposition. We establish theoretically that NACT achieves exact regularization on the core tensor from the Tucker decomposition in linear TR and generalized linear TR. To our knowledge, NACT is the first Tucker decomposition-based regularization method in TR to achieve in core tensors. NACT is implemented through an iterative procedure and involves two straightforward steps in each iteration -- generating…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsTensor decomposition and applications
MethodsGLM · TuckER
