Covariate-Assisted Sparse Tensor Completion
From MaRDI portal
Abstract: We aim to provably complete a sparse and highly-missing tensor in the presence of covariate information along tensor modes. Our motivation comes from online advertising where users click-through-rates (CTR) on ads over various devices form a CTR tensor that has about 96% missing entries and has many zeros on non-missing entries, which makes the standalone tensor completion method unsatisfactory. Beside the CTR tensor, additional ad features or user characteristics are often available. In this paper, we propose Covariate-assisted Sparse Tensor Completion (COSTCO) to incorporate covariate information for the recovery of the sparse tensor. The key idea is to jointly extract latent components from both the tensor and the covariate matrix to learn a synthetic representation. Theoretically, we derive the error bound for the recovered tensor components and explicitly quantify the improvements on both the reveal probability condition and the tensor recovery accuracy due to covariates. Finally, we apply COSTCO to an advertisement dataset consisting of a CTR tensor and ad covariate matrix, leading to 23% accuracy improvement over the baseline. An important by-product is that ad latent components from COSTCO reveal interesting ad clusters, which are useful for better ad targeting.
Cites work
- 10.1162/jmlr.2003.3.4-5.993
- A comparison of algorithms for fitting the PARAFAC model
- Community detection on mixture multilayer networks via regularized tensor decomposition
- Convex coupled matrix and tensor completion
- Coupled canonical polyadic decompositions and (coupled) decompositions in multilinear rank-\((L_r,n,L_r,n,1)\) terms. I: Uniqueness
- Covariate-adjusted tensor classification in high dimensions
- Cross: efficient low-rank tensor completion
- Dynamic tensor clustering
- Effective Tensor Sketching via Sparsification
- Generalized Liquid Association Analysis for Multimodal Data Integration
- High-dimensional covariance decomposition into sparse Markov and independence models
- High-dimensional probability. An introduction with applications in data science
- scientific article; zbMATH DE number 1215246 (Why is no real title available?)
- Noisy tensor completion via the sum-of-squares hierarchy
- Nonconvex Low-Rank Tensor Completion from Noisy Data
- On polynomial time methods for exact low-rank tensor completion
- Optimal computational and statistical rates of convergence for sparse nonconvex learning problems
- Optimal sparse singular value decomposition for high-dimensional high-order data
- Provable sparse tensor decomposition
- Sparse and Low-Rank Tensor Estimation via Cubic Sketchings
- Sparse Nonnegative Tensor Factorization and Completion With Noisy Observations
- Spectral algorithms for tensor completion
- Statistically optimal and computationally efficient low rank tensor completion from noisy entries
- Tensor Decomposition for Signal Processing and Machine Learning
- Tensor Decompositions and Applications
- Tensor decompositions for learning latent variable models
- Tensor Regression with Applications in Neuroimaging Data Analysis
Cited in
(2)
This page was built for publication: Covariate-Assisted Sparse Tensor Completion
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6144775)
