.png){kind=icon}
返回
Covariate-Assisted Sparse Tensor Completion
.png){kind=icon}
OA
AI
DOI：10.1080/01621459.2022.2066537.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
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 nonmissing entries, which makes the standalone tensor completion method unsatisfactory. Beside the CTR tensor, additional ad features or user characteristics are often available. In this article, 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. Supplementary materials for this article are available online.
Keyword:
Clustering
High-dimensional statistics
Low-rank tensor completion
Nonconvex optimization
Sparsity
期刊
J
IF:
3
论文数:
5.2K
被引数:
4.8W
机构
引用论文
Additions and corrections: Potential energy models for nonbonding interactions in solid chlorine
.png){kind=icon}
PREAI
分享收藏
查看更多内容